Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2303.04342 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Table des matières:
- Quantum walks have been used to develop quantum algorithms since their inception, and can be seen as an alternative to the usual circuit model; combining single-particle quantum walks on sparse graphs with two-particle scattering on a line lattice is sufficient to perform universal quantum computation. In this work we solve the problem of two-particle scattering on the line lattice for a family of interactions without translation invariance, recovering the Bose-Hubbard interaction as the limiting case. Due to its generality, our systematic approach lays the groundwork to solve the more general problem of multi-particle scattering on general graphs, which in turn can enable design of different or simpler quantum gates and gadgets. As a consequence of this work, we show that a CPHASE gate can be achieved with high fidelity when the interaction acts only on a small portion of the line graph.