Towards practical classical processing for the surface code: timing analysis
arXiv:1202.5602 · doi:10.1103/PhysRevA.86.042313
Abstract
Topological quantum error correction codes have high thresholds and are well suited to physical implementation. The minimum weight perfect matching algorithm can be used to efficiently handle errors in such codes. We perform a timing analysis of our current implementation of the minimum weight perfect matching algorithm. Our implementation performs the classical processing associated with an nxn lattice of qubits realizing a square surface code storing a single logical qubit of information in a fault-tolerant manner. We empirically demonstrate that our implementation requires only O(n^2) average time per round of error correction for code distances ranging from 4 to 512 and a range of depolarizing error rates. We also describe tests we have performed to verify that it always obtains a true minimum weight perfect matching.
arXiv comment13 pages, 13 figures, version accepted for publication
References in corpus (8)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Surface codes: Towards practical large-scale quantum computation
- Topological quantum memory
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological fault-tolerance in cluster state quantum computation
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Fast Decoders for Topological Quantum Codes
- Towards practical classical processing for the surface code
Cited by in corpus (27)
- Quantum Error Correction for Quantum Memories
- Interfacing spin qubits in quantum dots and donors - hot, dense and coherent
- Low-distance Surface Codes under Realistic Quantum Noise
- Error corrected quantum annealing with hundreds of qubits
- Removing leakage-induced correlated errors in superconducting quantum error correction
- Sparse Blossom: correcting a million errors per core second with minimum-weight matching
- Coping with qubit leakage in topological codes
- Deep neural decoders for near term fault-tolerant experiments
- Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
- Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
- Proof of finite surface code threshold for matching
- Cellular automaton decoders of topological quantum memories in the fault tolerant setting
- Lattice Surgery Translation for Quantum Computation
- Practical Topological Cluster State Quantum Computing Requires Loss Below 1%
- Techniques for combining fast local decoders with global decoders under circuit-level noise
- Analytic asymptotic performance of topological codes
- Simulating the Transverse Ising Model on a Quantum Computer: Error Correction with the Surface Code
- Anonymous broadcasting of classical information with a continuous-variable topological quantum code
- A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum Computing
- Measurement-free implementations of small-scale surface codes for quantum dot qubits
- Logic Synthesis for Fault-Tolerant Quantum Computers
- Accurate simulations of planar topological codes cannot use cyclic boundaries
- Actis: A Strictly Local Union-Find Decoder
- Strictly local one-dimensional topological quantum error correction with symmetry-constrained cellular automata
- Fast noise-resistant control of donor nuclear spin qubits in silicon
- Snowflake: A Distributed Streaming Decoder
- Channel Polarization of Two-dimensional-input Quantum Symmetric Channels