Momentum switches
arXiv:1406.4510 · doi:10.26421/QIC15.7-8
Abstract
Certain continuous-time quantum walks can be viewed as scattering processes. These processes can perform quantum computations, but it is challenging to design graphs with desired scattering behavior. In this paper, we study and construct momentum switches, graphs that route particles depending on their momenta. We also give an example where there is no exact momentum switch, although we construct an arbitrarily good approximation.
References in corpus (9)
- Quantum Computation and Decision Trees
- Universal computation by quantum walk
- Universal computation by multi-particle quantum walk
- Exact synthesis of multiqubit Clifford+T circuits
- A Quantum Algorithm for the Hamiltonian NAND Tree
- Levinson's theorem for graphs II
- Quantum scattering theory on graphs with tails
- Levinson's theorem for graphs
- Single-qubit unitary gates by graph scattering