The XYZ${}^2$ hexagonal stabilizer code

Abstract

We consider a topological stabilizer code on a honeycomb grid, the "XYZ${}^2$" code. The code is inspired by the Kitaev honeycomb model and is a simple realization of a "matching code" discussed by Wootton [J. Phys. A: Math. Theor. 48, 215302 (2015)], with a specific implementation of the boundary. It utilizes weight-six ($XYZXYZ$) plaquette stabilizers and weight-two ($XX$) link stabilizers on a planar hexagonal grid composed of $2d^2$ qubits for code distance $d$, with weight-three stabilizers at the boundary, stabilizing one logical qubit. We study the properties of the code using maximum-likelihood decoding, assuming perfect stabilizer measurements. For pure $X$, $Y$, or $Z$ noise, we can solve for the logical failure rate analytically, giving a threshold of 50%. In contrast to the rotated surface code and the XZZX code, which have code distance $d^2$ only for pure $Y$ noise, here the code distance is $2d^2$ for both pure $Z$ and pure $Y$ noise. Thresholds for noise with finite $Z$ bias are similar to the XZZX code, but with markedly lower sub-threshold logical failure rates. The code possesses distinctive syndrome properties with unidirectional pairs of plaquette defects along the three directions of the triangular lattice for isolated errors, which may be useful for efficient matching-based or other approximate decoding.

arXiv comment15 pages, 7 figures

References in corpus (52)

• Quantum Computing in the NISQ era and beyond
• Fault-tolerant quantum computation by anyons
• Anyons in an exactly solved model and beyond
• Variational Quantum Algorithms
• Surface codes: Towards practical large-scale quantum computation
• Quantum Simulation
• Topological quantum memory
• Quantum computational chemistry
• Quantum Error Correction for Quantum Memories
• Quantum algorithms: an overview
• State preservation by repetitive error detection in a superconducting quantum circuit
• Quantum information processing with superconducting circuits: a review
• Fault-tolerant quantum computation with high threshold in two dimensions
• Quantum algorithms for quantum chemistry and quantum materials science
• Stabilizer Codes and Quantum Error Correction
• Quantum computing for finance: overview and prospects
• Physics of the Kitaev model: fractionalization, dynamical correlations, and material connections
• Quantum orders in an exact soluble model
• Exponential suppression of bit or phase flip errors with repetitive error correction
• Quantum codes on a lattice with boundary
• Repeated Quantum Error Detection in a Surface Code
• Stabilizer Formalism for Operator Quantum Error Correction
• Deterministic entanglement of superconducting qubits by parity measurement and feedback
• Demonstration of fault-tolerant universal quantum gate operations
• The XZZX Surface Code
• Experimental demonstration of fault-tolerant state preparation with superconducting qubits
• Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
• Dynamically Generated Logical Qubits
• Logical-qubit operations in an error-detecting surface code
• Entangling logical qubits with lattice surgery
• Tailoring surface codes for highly biased noise
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• High threshold error correction for the surface code
• A Fault-Tolerant Honeycomb Memory
• Topological phases and quantum computation
• Experimental demonstration of continuous quantum error correction
• An efficient Markov chain Monte Carlo algorithm for the surface code
• Perturbative approach to an exactly solved problem: the Kitaev honeycomb model
• Tunable joint measurements in the dispersive regime of cavity QED
• Boundaries for the Honeycomb Code
• Experimental exploration of five-qubit quantum error correcting code with superconducting qubits
• Constructions and Noise Threshold of Topological Subsystem Codes
• Multi-path Summation for Decoding 2D Topological Codes
• Demonstrating non-Abelian braiding of surface code defects in a five qubit experiment
• Undoing measurement-induced dephasing in circuit QED
• The Capabilities of a Perturbed Toric Code as a Quantum Memory
• A family of stabilizer codes for $D({\mathbb{Z}}_2)$ anyons and Majorana modes
• Generating topological order from a 2D cluster state using a duality mapping
• Topological quantum error correction in the Kitaev honeycomb model
• Error-rate-agnostic decoding of topological stabilizer codes

Cited by in corpus (15)

• Anyon condensation and the color code
• Tailoring quantum error correction to spin qubits
• Correcting non-independent and non-identically distributed errors with surface codes
• Conservation laws and quantum error correction: towards a generalised matching decoder
• A cellular automaton decoder for a noise-bias tailored color code
• Data-driven decoding of quantum error correcting codes using graph neural networks
• Low-overhead quantum error correction codes with a cyclic topology
• The domain wall color code
• Geodesic Algorithm for Unitary Gate Design with Time-Independent Hamiltonians
• Exact results on finite size corrections for surface codes tailored to biased noise
• Tailoring Dynamical Codes for Biased Noise: The X${}^3$Z${}^3$ Floquet Code
• Minimising surface-code failures using a color-code decoder
• Quantum control without quantum states
• Generalizing the matching decoder for the Chamon code
• Biased-Noise Thresholds of Zero-Rate Holographic Codes with Tensor-Network Decoding