



01769nas a2200217   4500008004100000024003400041245005000075210005000125260001300175490000600188520108800194653004301282653004301325653002701368653003101395100002101426700002301447700002501470700001901495856003701514       2023                        eng d  aReport number: LA-UR-22-2023700aAdvantages and limitations of quantum routing0 aAdvantages and limitations of quantum routing  c2/1/20230 v43 a<p>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: (1) allowing arbitrary two-qubit unitaries, or (2) 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 Ω(n) speedup if we also allow fast local interactions.</p>10aData Structures and Algorithms (cs.DS)10aFOS: Computer and information sciences10aFOS: Physical sciences10aQuantum Physics (quant-ph)1 aBapat, Aniruddha1 aChilds, Andrew, M.1 aGorshkov, Alexey, V.1 aSchoute, Eddie  uhttps://arxiv.org/abs/2206.01766