Comparative study of quantum error correction strategies for the heavy-hexagonal lattice

Abstract

Topological quantum error correction is a milestone in the scaling roadmap of quantum computers, which targets circuits with trillions of gates that would allow running quantum algorithms for real-world problems. The square-lattice surface code has become the workhorse to address this challenge, as it poses milder requirements on current devices both in terms of required error rates and small local connectivities. In some platforms, however, the connectivities are kept even lower in order to minimise gate errors at the hardware level, which limits the error correcting codes that can be directly implemented on them. In this work, we make a comparative study of possible strategies to overcome this limitation for the heavy-hexagonal lattice, the architecture of current IBM superconducting quantum computers. We explore two complementary strategies: the search for an efficient embedding of the surface code into the heavy-hexagonal lattice, as well as the use of codes whose connectivity requirements are naturally tailored to this architecture, such as subsystem-type and Floquet codes. Using noise models of increased complexity, we assess the performance of these strategies for IBM devices in terms of their error thresholds and qubit footprints. An optimized SWAP-based embedding of the surface code is found to be the most promising strategy towards a near-term demonstration of quantum error correction advantage.

References in corpus (78)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum computational advantage using photons
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Error mitigation for short-depth quantum circuits
• Quantum Error Correction for Quantum Memories
• Trapped-Ion Quantum Computing: Progress and Challenges
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• Suppressing quantum errors by scaling a surface code logical qubit
• Logical quantum processor based on reconfigurable atom arrays
• Quantum algorithms: an overview
• State preservation by repetitive error detection in a superconducting quantum circuit
• Quantum information processing with superconducting circuits: a review
• An atom-by-atom assembler of defect-free arbitrary 2d atomic arrays
• Demonstration of a small programmable quantum computer with atomic qubits
• High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
• High-fidelity quantum logic gates using trapped-ion hyperfine qubits
• Building logical qubits in a superconducting quantum computing system
• Quantum Error Mitigation
• Realization of Three-Qubit Quantum Error Correction with Superconducting Circuits
• Surface code quantum computing by lattice surgery
• Fault-Tolerant Quantum Dynamical Decoupling
• Demonstration of the trapped-ion quantum-CCD computer architecture
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Detecting arbitrary quantum errors via stabilizer measurements on a sublattice of the surface code
• Procedure for systematically tuning up crosstalk in the cross resonance gate
• A simple all-microwave entangling gate for fixed-frequency superconducting qubits
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• High-threshold and low-overhead fault-tolerant quantum memory
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Stim: a fast stabilizer circuit simulator
• A compact ion-trap quantum computing demonstrator
• Realization of an Error-Correcting Surface Code with Superconducting Qubits
• Quantum simulation and computing with Rydberg-interacting qubits
• Deterministic entanglement of superconducting qubits by parity measurement and feedback
• Computing prime factors with a Josephson phase qubit quantum processor
• Low-distance Surface Codes under Realistic Quantum Noise
• Complete methods set for scalable ion trap quantum information processing
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Implementing a strand of a scalable fault-tolerant quantum computing fabric
• Dynamically Error-Corrected Gates for Universal Quantum Computation
• 3D integrated superconducting qubits
• Experimental demonstration of fault-tolerant state preparation with superconducting qubits
• Quantum error correction with only two extra qubits
• Magic State Distillation: Not as Costly as You Think
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Subsystem fault tolerance with the Bacon-Shor code
• Fault-tolerant quantum computation against biased noise
• Demonstration of weight-four parity measurements in the surface code architecture
• Parallel Entangling Operations on a Universal Ion Trap Quantum Computer
• Initialization by measurement of a two-qubit superconducting circuit
• Topological and subsystem codes on low-degree graphs with flag qubits
• High-Fidelity Bell-State Preparation with ${}^{40}$Ca${}^{+}$ Optical Qubits
• Dynamically Generated Logical Qubits
• Verifying Multipartite Entangled GHZ States via Multiple Quantum Coherences
• High-Fidelity, Frequency-Flexible Two-Qubit Fluxonium Gates with a Transmon Coupler
• Fault-tolerant thresholds for quantum error correction with the surface code
• Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
• Encoding a magic state with beyond break-even fidelity
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• A Fault-Tolerant Honeycomb Memory
• Flag fault-tolerant error correction for any stabilizer code
• Experimental demonstration of continuous quantum error correction
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Demonstration of fault-tolerant Steane quantum error correction
• Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
• Demonstration of algorithmic quantum speedup
• Boundaries for the Honeycomb Code
• Performance of planar Floquet codes with Majorana-based qubits
• 2-D Compass Codes
• Benchmarking the Planar Honeycomb Code
• Optimally combining dynamical decoupling and quantum error correction
• Floquetifying the Colour Code
• A Pair Measurement Surface Code on Pentagons
• Improved Pairwise Measurement-Based Surface Code
• Hexagonal matching codes with 2-body measurements

Cited by in corpus (5)

• Effectiveness of the syndrome extraction circuit with flag qubits on IBM quantum hardware
• Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
• Transversal CNOT gate with multi-cycle error correction
• Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
• A dynamic circuit for the honeycomb Floquet code