Tailored cluster states with high threshold under biased noise

Abstract

Fault-tolerant cluster states form the basis for scalable measurement-based quantum computation. Recently, new stabilizer codes for scalable circuit-based quantum computation have been introduced that have very high thresholds under biased noise where the qubit predominantly suffers from one type of error, e.g. dephasing. However, extending these advances in stabilizer codes to generate high-threshold cluster states for biased noise has been a challenge, as the standard method for foliating stabilizer codes to generate fault-tolerant cluster states does not preserve the noise bias. In this work, we overcome this barrier by introducing a generalization of the cluster state that allows us to foliate stabilizer codes in a bias-preserving way. As an example of our approach, we construct a foliated version of the XZZX code which we call the XZZX cluster state. We demonstrate that under a circuit-level noise model, our XZZX cluster state has a threshold more than double the usual cluster state when dephasing errors are more likely than errors which cause bit flips by a factor of $O(100)$ or more.

arXiv commentMain text: 12 pages, 7 figures. Supplement: 5 pages, 5, figures

References in corpus (64)

• Fault-tolerant quantum computation by anyons
• Persistent entanglement in arrays of interacting particles
• Topological quantum memory
• Measurement-based quantum computation with cluster states
• Measurement of conditional phase shifts for quantum logic
• Measurement-based quantum computation
• Universal Quantum Computation with Continuous-Variable Cluster States
• Fault-tolerant quantum computation with high threshold in two dimensions
• Resource-efficient linear optical quantum computation
• Quantum computation with optical coherent states
• A near deterministic linear optical CNOT gate
• Topological fault-tolerance in cluster state quantum computation
• Optical quantum computation using cluster states
• Demonstration of Entanglement of Electrostatically Coupled Singlet-Triplet Qubits
• The Kerr-Cat Qubit: Stabilization, Readout, and Gates
• Quantum orders in an exact soluble model
• A fault-tolerant one-way quantum computer
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Weak nonlinearities: A new route to optical quantum computation
• Fault-tolerant linear optical quantum computing with small-amplitude coherent states
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Building a fault-tolerant quantum computer using concatenated cat codes
• The XZZX Surface Code
• Exponential suppression of bit-flips in a qubit encoded in an oscillator
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Fault-tolerant quantum computation against biased noise
• Long-range quantum entanglement in noisy cluster states
• Bias-preserving gates with stabilized cat qubits
• 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
• Fault tolerant quantum computation with very high threshold for loss errors
• Fault-tolerant quantum computation with cluster states
• Continuous-time cross-phase modulation and quantum computation
• Realization of a $\Lambda$ system with metastable states of a capacitively-shunted fluxonium
• Measurement-based quantum computation with trapped ions
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Foliated Quantum Codes
• Producing cluster states in charge qubits and flux qubits
• The one-way quantum computer -- a non-network model of quantum computation
• Optimal photons for quantum information processing
• Efficient one-step generation of large cluster states with solid-state circuits
• Generation of quantum-dot cluster states with superconducting transmission line resonator
• The efficiencies of generating cluster states with weak non-linearities
• A scalable, high-speed measurement-based quantum computer using trapped ions
• Parallelized quantum error correction with fracton topological codes
• Quantum Dot Cluster State Computing with Encoded Qubits
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Frequency and temporal effects in linear optical quantum computing
• One-step preparation of cluster states in quantum dot molecules
• Universal fault-tolerant measurement-based quantum computation
• Fault-tolerant quantum computation with non-deterministic entangling gates
• Universal quantum computation on the power of quantum non-demolition measurements
• High-threshold topological quantum error correction against biased noise
• Error models for mode-mismatch in linear optics quantum computing
• Practical Topological Cluster State Quantum Computing Requires Loss Below 1%
• The Capabilities of a Perturbed Toric Code as a Quantum Memory
• Efficient Parity Encoded Optical Quantum Computing
• Cluster state generation using van der Waals and dipole-dipole interactions in optical lattices
• Coherent State Topological Cluster State Production
• One-way quantum computing in superconducting circuits
• Generating Fault-Tolerant Cluster States from Crystal Structures
• Lattice Surgery on the Raussendorf Lattice
• A high threshold code for modular hardware with asymmetric noise
• Understanding photonic quantum-logic gates: The road to fault tolerance

Cited by in corpus (10)

• High threshold codes for neutral atom qubits with biased erasure errors
• High-threshold quantum computing by fusing one-dimensional cluster states
• Robust teleportation of a surface code and cascade of topological quantum phase transitions
• Tailoring fusion-based error correction for high thresholds to biased fusion failures
• Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics
• Leveraging Qubit Loss Detection in Fault Tolerant Quantum Algorithms
• Time-bin entanglement in the deterministic generation of linear photonic cluster states
• Tailoring Dynamical Codes for Biased Noise: The X${}^3$Z${}^3$ Floquet Code
• Preservation of entanglement in local noisy channels
• Simulated-annealing decoder for the XZZX code with greedy-matching initialization