Quantum Routing and Entanglement Dynamics Through Bottlenecks

Abstract

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate "bottleneck" region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions $L,R$ with $N_L,N_R$ qubits, respectively, coupled only through an intermediate region $C$ with $N_C$ qubits, for any $\delta >0$ we show a lower bound of $\Omega (N_R^{1-\delta }/\sqrt{N_L}{N}_C)$ on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between $L$ and $C,R$ that can be generated in time $t$ by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from $O(N_{L}t)$ to $O(\sqrt{N_L}t)$. As a special case, when applied to the star graph (i.e., one vertex connected to $N$ leaves), we obtain an $\Omega (\sqrt{N^{1-\delta }})$ lower bound on the routing time and on the time to prepare $N/2$ Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time $\Theta (\sqrt{N})$ using Hamiltonian quantum routing, obtaining a speed-up over gate-based routing, which takes time $\Theta (N)$.

References in corpus (33)

• Quantum entanglement
• Quantum sensing
• Quantum-enhanced measurements: beating the standard quantum limit
• Superconducting Qubits: Current State of Play
• Trapped-Ion Quantum Computing: Progress and Challenges
• Symmetric Informationally Complete Quantum Measurements
• On the role of entanglement in quantum computational speed-up
• A Theory of Trotter Error
• Quantum Entanglement in Fermionic Lattices
• Evenly distributed unitaries: on the structure of unitary designs
• A Sharp Fannes-type Inequality for the von Neumann Entropy
• Exponential improvement in precision for simulating sparse Hamiltonians
• Mapping local Hamiltonians of fermions to local Hamiltonians of spins
• Separable states can be used to distribute entanglement
• On the capacities of bipartite Hamiltonians and unitary gates
• Quantum Entanglement of Identical Particles
• Quantum network routing and local complementation
• Entanglement rates and area laws
• Multipartite entanglement in quantum algorithms
• Upper bounds on entangling rates of bipartite Hamiltonians
• Speed limits and locality in many-body quantum dynamics
• Quantum Skew Divergence
• Entanglement flow in multipartite systems
• Hamiltonian simulation with random inputs
• Improving Quantum Computation by Optimized Qubit Routing
• Advantages and limitations of quantum routing
• Entanglement accelerates quantum simulation
• Quantum routing with fast reversals
• Quantum Routing with Teleportation
• Fast and Accurate Greenberger-Horne-Zeilinger Encoding Using All-to-all Interactions
• How much entanglement is needed for quantum error correction?
• Optimal light cone for macroscopic particle transport in long-range systems: A quantum speed limit approach
• Frobenius light cone and the shift unitary