Spatially parallel decoding for multi-qubit lattice surgery
arXiv:2403.01353 · doi:10.1088/2058-9565/adc6b6
Abstract
Running quantum algorithms protected by quantum error correction requires a real time, classical decoder. To prevent the accumulation of a backlog, this decoder must process syndromes from the quantum device at a faster rate than they are generated. Most prior work on real time decoding has focused on an isolated logical qubit encoded in the surface code. However, for surface code, quantum programs of utility will require multi-qubit interactions performed via lattice surgery. A large merged patch can arise during lattice surgery -- possibly as large as the entire device. This puts a significant strain on a real time decoder, which must decode errors on this merged patch and maintain the level of fault-tolerance that it achieves on isolated logical qubits. These requirements are relaxed by using spatially parallel decoding, which can be accomplished by dividing the physical qubits on the device into multiple overlapping groups and assigning a decoder module to each. We refer to this approach as spatially parallel windows. While previous work has explored similar ideas, none have addressed system-specific considerations pertinent to the task or the constraints from using hardware accelerators. In this work, we demonstrate how to configure spatially parallel windows, so that the scheme (1) is compatible with hardware accelerators, (2) supports general lattice surgery operations, (3) maintains the fidelity of the logical qubits, and (4) meets the throughput requirement for real time decoding. Furthermore, our results reveal the importance of optimally choosing the buffer width to achieve a balance between accuracy and throughput -- a decision that should be influenced by the device's physical noise.
Update to journal version. Quantum Sci. Technol (2025)
References in corpus (21)
- Surface codes: Towards practical large-scale quantum computation
- Quantum Error Correction for Quantum Memories
- Suppressing quantum errors by scaling a surface code logical qubit
- Surface code quantum computing by lattice surgery
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Stim: a fast stabilizer circuit simulator
- Realization of an Error-Correcting Surface Code with Superconducting Qubits
- Windowed Decoding of Protograph-based LDPC Convolutional Codes over Erasure Channels
- Entangling logical qubits with lattice surgery
- Surface code implementation of block code state distillation
- Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
- Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Parallel window decoding enables scalable fault tolerant quantum computation
- Simulation of rare events in quantum error correction
- Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures
- A local pre-decoder to reduce the bandwidth and latency of quantum error correction
- A circuit-level protocol and analysis for twist-based lattice surgery
- Techniques for combining fast local decoders with global decoders under circuit-level noise
- The role of entropy in topological quantum error correction
- Modular decoding: parallelizable real-time decoding for quantum computers