Advantages and Limitations of Quantum Routing

The SWAP gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely quantum operations could outperform SWAP for the task of permuting qubits within an architecture, which we call routing. We consider quantum routing in two models: (i) allowing arbitrary two-qubit unitaries, or (ii) allowing Hamiltonians with norm-bounded interactions. We lower bound the circuit depth or time of quantum routing in terms of spectral properties of graphs representing the architecture interaction constraints, and give a generalized upper bound for all simple connected n-vertex graphs. In particular, we give conditions for a superpolynomial classical-quantum routing separation, which exclude graphs with a small spectral gap and graphs of bounded degree. Finally, we provide examples of a quadratic separation between gate-based and Hamiltonian routing models with a constant number of local ancillas per qubit and of an O (n) speedup if we also allow fast local interactions.

Automated summary

The SWAP gate is a classical operation that can be considered as a tool for moving information on quantum hardware. However, genuine quantum operations have the potential to outperform SWAP in terms of qubit permutation within an architecture, which is known as routing. We explore quantum routing in two models, allowing either arbitrary two-qubit unitaries or Hamiltonians with norm-bounded interactions. Through spectral analysis of graphs representing interaction constraints, we provide lower bounds for the circuit depth or time of quantum routing and a generalized upper bound for all simple connected n-vertex graphs. Additionally, we identify conditions for a superpolynomial classical-quantum routing separation, excluding graphs with a small spectral gap and graphs of bounded degree. Finally, we demonstrate examples of quadratic separation between gate-based and Hamiltonian routing models, with a constant number of local ancillas per qubit, as well as an O(n) speedup with fast local interactions.