Topological and subsystem codes on low-degree graphs with flag qubits
arXiv:1907.09528 · doi:10.1103/PhysRevX.10.011022
Abstract
In this work we introduce two code families, which we call the heavy hexagon code and heavy square code. Both code families are implemented by assigning physical data and ancilla qubits to both vertices and edges of low degree graphs. Such a layout is particularly suitable for superconducting qubit architectures to minimize frequency collisions and crosstalk. In some cases, frequency collisions can be reduced by several orders of magnitude. The heavy hexagon code is a hybrid surface/Bacon-Shor code mapped onto a (heavy) hexagonal lattice whereas the heavy square code is the surface code mapped onto a (heavy) square lattice. In both cases, the lattice includes all the ancilla qubits required for fault-tolerant error-correction. Naively, the limited qubit connectivity might be thought to limit the error-correcting capability of the code to less than its full distance. Therefore, essential to our construction is the use of flag qubits. We modify minimum weight perfect matching decoding to efficiently and scalably incorporate information from measurements of the flag qubits and correct up to the full code distance while respecting the limited connectivity. Simulations show that high threshold values for both codes can be obtained using our decoding protocol. Further, our decoding scheme can be adapted to other topological code families.
arXiv comment20 pages, 21 figures, Comments welcome! V2 conforms to journal specifications
References in corpus (39)
- Surface codes: Towards practical large-scale quantum computation
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
- Building logical qubits in a superconducting quantum computing system
- Qubit architecture with high coherence and fast tunable coupling
- 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
- Topological Order with a Twist: Ising Anyons from an Abelian Model
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Stabilizer Formalism for Operator Quantum Error Correction
- A universal gate for fixed-frequency qubits via a tunable bus
- Low-distance Surface Codes under Realistic Quantum Noise
- Implementing a strand of a scalable fault-tolerant quantum computing fabric
- 3D integrated superconducting qubits
- Experimental demonstration of fault-tolerant state preparation with superconducting qubits
- Quantum error correction with only two extra qubits
- Subsystem fault tolerance with the Bacon-Shor code
- Demonstration of weight-four parity measurements in the surface code architecture
- Tunable Superconducting Qubits with Flux-Independent Coherence
- Flag fault-tolerant error correction with arbitrary distance codes
- Fault-tolerant quantum computation with few qubits
- Quantum computation with Turaev-Viro codes
- Constructions and Noise Threshold of Hyperbolic Surface Codes
- Poking holes and cutting corners to achieve Clifford gates with the surface code
- The surface code with a twist
- Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
- Fault-tolerant magic state preparation with flag qubits
- Neural network decoder for topological color codes with circuit level noise
- Fault-tolerant preparation of approximate GKP states
- Proof of finite surface code threshold for matching
- Fault-Tolerant Quantum Computing in the Pauli or Clifford Frame with Slow Error Diagnostics
- Universal Quantum Computation with Gapped Boundaries
- 2-D Compass Codes
- Universal logical gates with constant overhead: instantaneous Dehn twists for hyperbolic quantum codes
- Handling Leakage with Subsystem Codes
- The Small Stellated Dodecahedron Code and Friends
Cited by in corpus (112)
- Noisy intermediate-scale quantum (NISQ) algorithms
- Building a fault-tolerant quantum computer using concatenated cat codes
- Advances in Space Quantum Communications
- Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
- Fluxonium: an alternative qubit platform for high-fidelity operations
- First-principles analysis of cross-resonance gate operation
- Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
- Efficient classical simulation of noisy random quantum circuits in one dimension
- A fault-tolerant continuous-variable measurement-based quantum computation architecture
- Scalable High-Performance Fluxonium Quantum Processor
- A Fault-Tolerant Honeycomb Memory
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Flag fault-tolerant error correction for any stabilizer code
- A case study of variational quantum algorithms for a job shop scheduling problem
- Low overhead fault-tolerant quantum error correction with the surface-GKP code
- Calibrated decoders for experimental quantum error correction
- The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
- A Modular Quantum Compilation Framework for Distributed Quantum Computing
- Improved decoding of circuit noise and fragile boundaries of tailored surface codes
- Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
- Multicore Quantum Computing
- Surface code compilation via edge-disjoint paths
- Methods for simulating string-net states and anyons on a digital quantum computer
- Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- Suppressing quantum circuit errors due to system variability
- Decoding algorithms for surface codes
- Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
- Demonstration of quantum volume 64 on a superconducting quantum computing system
- Path-Independent Quantum Gates with Noisy Ancilla
- Path toward manufacturable superconducting qubits with relaxation times exceeding 0.1 ms
- Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
- High-threshold quantum computing by fusing one-dimensional cluster states
- Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
- Benchmarking the Planar Honeycomb Code
- Short-Depth Circuits for Dicke State Preparation
- Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
- Optimizing frequency allocation for fixed-frequency superconducting quantum processors
- A scalable and fast artificial neural network syndrome decoder for surface codes
- Large-scale quantum approximate optimization on non-planar graphs with machine learning noise mitigation
- Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors
- Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms
- Efficient quantum readout-error mitigation for sparse measurement outcomes of near-term quantum devices
- A local pre-decoder to reduce the bandwidth and latency of quantum error correction
- Minimum quantum run-time characterization and calibration via restless measurements with dynamic repetition rates
- A circuit-level protocol and analysis for twist-based lattice surgery
- Characterizing crosstalk of superconducting transmon processors
- Creating entangled logical qubits in the heavy-hex lattice with topological codes
- Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
- Dissipative Dynamics of Graph-State Stabilizers with Superconducting Qubits
- Generating Fault-Tolerant Cluster States from Crystal Structures
- Extended flag gadgets for low-overhead circuit verification
- A four-dimensional toric code with non-Clifford transversal gates
- Characterization of entanglement on superconducting quantum computers of up to 414 qubits
- Blueprint for all-to-all connected superconducting spin qubits
- Adaptive syndrome measurements for Shor-style error correction
- Initial Design of a W-band Superconducting Kinetic Inductance Qubit (Kineticon)
- Quantum Approximate Multi-Objective Optimization
- A SAT approach to the initial mapping problem in SWAP gate insertion for commuting gates
- Fault-tolerant Compass Codes
- Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
- Classical Chaos in Quantum Computers
- Achieving fault tolerance on capped color codes with few ancillas
- Error-corrected Hadamard gate simulated at the circuit level
- Fault-tolerant quantum error correction using error weight parities
- Direct calculation of the ZZ-interaction rates in the multi-mode circuit-QED
- Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
- Comparative study of quantum error correction strategies for the heavy-hexagonal lattice
- Artificial Neural Network Syndrome Decoding on IBM Quantum Processors
- Designing fault-tolerant circuits using detector error models
- On maximum-likelihood decoding with circuit-level errors
- Improving threshold for fault-tolerant color code quantum computing by flagged weight optimization
- Co-Designed Architectures for Modular Superconducting Quantum Computers
- Microwave-activated gates between a fluxonium and a transmon qubit
- Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation
- Testing complementarity on a transmon quantum processor
- Fault-tolerant syndrome extraction and cat state preparation with fewer qubits
- Floquet Analysis of Frequency Collisions
- Constructive plaquette compilation for the parity architecture
- Probing Quantum Telecloning on Superconducting Quantum Processors
- Quantum computer error structure probed by quantum error correction syndrome measurements
- Surface Code Design for Asymmetric Error Channels
- Noise-Adaptive Quantum Compilation Strategies Evaluated with Application-Motivated Benchmarks
- Hexagonal matching codes with 2-body measurements
- Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation
- Low-Depth Flag-Style Syndrome Extraction for Small Quantum Error-Correction Codes
- Empirical learning of dynamical decoupling on quantum processors
- Flexible constraint compilation in the parity architecture
- Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
- Exact results on finite size corrections for surface codes tailored to biased noise
- Effectiveness of the syndrome extraction circuit with flag qubits on IBM quantum hardware
- Subsystem CSS codes, a tighter stabilizer-to-CSS mapping, and Goursat's Lemma
- Optimization tools for distance-preserving flag fault-tolerant error correction
- Magic Mirror on the Wall, How to Benchmark Quantum Error Correction Codes, Overall ?
- Parallelization techniques for quantum simulation of fermionic systems
- Distance-four quantum codes with combined postselection and error correction
- Achieving computational gains with quantum error-correction primitives: Generation of long-range entanglement enhanced by error detection
- Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
- Demonstration of teleportation across a quantum network code
- Transversal CNOT gate with multi-cycle error correction
- Crosstalk-Based Parameterized Quantum Circuit Approximation
- Gravitational-wave matched filtering on a quantum computer
- Sparse Non-Markovian Noise Modeling of Transmon-Based Multi-Qubit Operations
- Efficient Online Quantum Circuit Learning with No Upfront Training
- A graph-state based synthesis framework for Clifford isometries
- Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
- Efficient Syndrome Decoder for Heavy Hexagonal QECC via Machine Learning
- Between Shor and Steane: A unifying construction for measuring error syndromes
- Calibration of syndrome measurements in a single experiment
- Recent quantum runtime (dis)advantages
- Spin-augmented observables for efficient photonic quantum error correction
- Kramers-protected hardware-efficient error correction with Andreev spin qubits
- Improving success probability in the LHZ parity embedding by computing with quantum walks