Linear-optical quantum computation with arbitrary error-correcting codes
arXiv:2408.04126 · doi:10.1103/PhysRevLett.134.100602
Abstract
High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require efficient generation of non-local, many-body entanglement. We provide a linear-optical architecture with these properties, compatible with arbitrary codes and Gottesman-Kitaev-Preskill qubits on generic lattices, and featuring a natural way to leverage physical noise bias. Simulations of hyperbolic surface codes and bivariate bicycle codes, promising families of quantum low-density parity-check codes, reveal a threshold comparable to the 2D surface code with substantially better encoding rates.
20 pages, 4 figures, comments welcome
References in corpus (34)
- Review article: Linear optical quantum computing
- Measurement-based quantum computation with cluster states
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
- Photonic quantum information processing: a concise review
- High-threshold and low-overhead fault-tolerant quantum memory
- Sparse Graph Codes for Quantum Error-Correction
- Quantum Low-Density Parity-Check Codes
- Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
- The XZZX Surface Code
- Decoding Across the Quantum LDPC Code Landscape
- Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes
- Improved quantum capacity bounds of Gaussian loss channels and achievable rates with Gottesman-Kitaev-Preskill codes
- Propagating Gottesman-Kitaev-Preskill states encoded in an optical oscillator
- Single-Mode Displacement Sensor
- Constructions and Noise Threshold of Hyperbolic Surface Codes
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- Foliated Quantum Codes
- Continuous-variable gate teleportation and bosonic-code error correction
- Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
- All-Optical Long-Distance Quantum Communication with Gottesman-Kitaev-Preskill qubits
- Improved decoding of circuit noise and fragile boundaries of tailored surface codes
- Fault-tolerant quantum computation with static linear optics
- Noise analysis of single-qumode Gaussian operations using continuous-variable cluster states
- Enhanced noise resilience of the surface-GKP code via designed bias
- Matrix decompositions in Quantum Optics: Takagi/Autonne, Bloch-Messiah/Euler, Iwasawa, and Williamson
- Flexible quantum circuits using scalable continuous-variable cluster states
- Generation of Flying Logical Qubits using Generalized Photon Subtraction with Adaptive Gaussian Operations
- The role of entropy in topological quantum error correction
- Streamlined quantum computing with macronode cluster states
- Biased Gottesman-Kitaev-Preskill repetition code
- Qubit-oscillator concatenated codes: decoding formalism & code comparison
- Weight Reduced Stabilizer Codes with Lower Overhead
- Subsystem CSS codes, a tighter stabilizer-to-CSS mapping, and Goursat's Lemma
- Equivalent noise properties of scalable continuous-variable cluster states
Cited by in corpus (5)
- Quantum error correction for long chains of trapped ions
- Single-shot and measurement-based quantum error correction via fault complexes
- End-to-end switchless architecture for fault-tolerant photonic quantum computing
- Logical channel for heralded and pure loss with the Gottesman-Kitaev-Preskill code
- Logical channels in approximate Gottesman-Kitaev-Preskill error correction