Tailoring fusion-based error correction for high thresholds to biased fusion failures

Abstract

We introduce fault-tolerant (FT) architectures for error correction with the XZZX cluster state based on performing measurements of two-qubit Pauli operators $Z\otimes Z$ and $X\otimes X$, or fusions, on a collection of few-body entangled resource states. Our construction is tailored to be effective against noise that predominantly causes faulty $X\otimes X$ measurements during fusions. This feature offers practical advantage in linear optical quantum computing with dual-rail photonic qubits, where failed fusions only erase $X\otimes X$ measurement outcomes. By applying our construction to this platform, we find a record high FT threshold to fusion failures exceeding $25\%$ in the experimentally relevant regime of non-zero loss rate per photon, considerably simplifying hardware requirements.

arXiv comment7+6 pages, 4+6 figures, comments welcome

References in corpus (31)

• Review article: Linear optical quantum computing
• Persistent entanglement in arrays of interacting particles
• Measurement-based quantum computation with cluster states
• 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
• Topological fault-tolerance in cluster state quantum computation
• Optical quantum computation using cluster states
• Quantum orders in an exact soluble model
• A fault-tolerant one-way quantum computer
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• How good must single photon sources and detectors be for efficient linear optical quantum computation?
• Long-range quantum entanglement in noisy cluster states
• 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae
• High-threshold fault-tolerant quantum computation with analog quantum error correction
• Fault-tolerant quantum computation with cluster states
• Thresholds for topological codes in the presence of loss
• Resource costs for fault-tolerant linear optical quantum computing
• Foliated Quantum Codes
• Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
• The one-way quantum computer -- a non-network model of quantum computation
• A Photonic Implementation for the Topological Cluster State Quantum Computer
• Fully fault tolerant quantum computation with non-deterministic gates
• High-threshold quantum computing by fusing one-dimensional cluster states
• Universal fault-tolerant measurement-based quantum computation
• Fault-tolerant quantum computation with non-deterministic entangling gates
• High-threshold fault-tolerant quantum computation with the Gottesman-Kitaev-Preskill qubit under noise in an optical setup
• Optimization of the surface code design for Majorana-based qubits
• Efficient Parity Encoded Optical Quantum Computing
• Tailored cluster states with high threshold under biased noise

Cited by in corpus (9)

• High-threshold quantum computing by fusing one-dimensional cluster states
• High photon-loss threshold quantum computing using GHZ-state measurements
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Tailoring fusion-based photonic quantum computing schemes to quantum emitters
• Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics
• Boosted Bell-state measurements for photonic quantum computation
• Linear-optical fusion boosted by high-dimensional entanglement
• Tailoring Dynamical Codes for Biased Noise: The X${}^3$Z${}^3$ Floquet Code
• Optomechanical resource for fault-tolerant quantum computing