Long-ranged gates in quantum computation architectures with limited connectivity

Abstract

We propose a quantum computation architecture based on geometries with nearest-neighbor interactions, including e.g. planar structures. We show how to efficiently split the role of qubits into data and entanglement-generation qubits. Multipartite entangled states, e.g. 2D cluster states, are generated among the latter, and flexibly transformed via mid-circuit measurements to multiple, long-ranged Bell states, which are used to perform several two-qubit gates in parallel on data qubits. We introduce planar architectures with $n$ data and $n$ auxiliary qubits that allow one to perform $O(\sqrt{n})$ long-ranged two-qubit gates simultaneously, with only one round of nearest neighbor gates and one round of mid-circuit measurements. We also show that our approach is applicable in existing superconducting quantum computation architectures, with only a constant overhead.

13 pages, 7 figures, replaced with published version

References in corpus (32)

• Measurement-based quantum computation with cluster states
• Trapped-Ion Quantum Computing: Progress and Challenges
• Logical quantum processor based on reconfigurable atom arrays
• Measurement-based quantum computation
• Multi-party entanglement in graph states
• Quantum error correction below the surface code threshold
• Parallel implementation of high-fidelity multi-qubit gates with neutral atoms
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• A compact ion-trap quantum computing demonstrator
• Demonstration of fault-tolerant universal quantum gate operations
• Measurement-induced entanglement and teleportation on a noisy quantum processor
• Quantum network routing and local complementation
• Efficient Long-Range Entanglement using Dynamic Circuits
• Preparation of matrix product states with log-depth quantum circuits
• Fundamentals of universality in one-way quantum computation
• A dual-species Rydberg array
• Constant-depth preparation of matrix product states with adaptive quantum circuits
• Quantum Fourier Transform using Dynamic Circuits
• Approximating many-body quantum states with quantum circuits and measurements
• Optimized Quantum Networks
• State preparation by shallow circuits using feed forward
• Toward a 2D Local Implementation of Quantum LDPC Codes
• Measurement-Based Long-Range Entangling Gates in Constant Depth
• Influence of noise in entanglement-based quantum networks
• Classifying One-Dimensional Quantum States Prepared by a Single Round of Measurements
• Noisy Stabilizer Formalism
• Characterizing MPS and PEPS Preparable via Measurement and Feedback
• Flexible quantum data bus for quantum networks
• Teleporting two-qubit entanglement across 19 qubits on a superconducting quantum computer
• A modular entanglement-based quantum computer architecture
• Gate teleportation-assisted routing for quantum algorithms
• Graph state extraction from two-dimensional cluster states