Subsystem many-hypercube codes: High-rate concatenated codes with low-weight syndrome measurements

Abstract

Quantum error-correcting codes (QECCs) require high encoding rate in addition to high threshold unless a sufficiently large number of physical qubits are available. The many-hypercube (MHC) codes defined as the concatenation of the [[6,4,2]] quantum error-detecting code have been proposed as high-performance and high-encoding-rate QECCs. However, the concatenated codes have a disadvantage that the syndrome weight grows exponentially with respect to the concatenation level. To address this issue, here we propose subsystem quantum codes based on the MHC codes. In particular, we study the smallest subsystem MHC codes, namely, subsystem codes derived from the concatenated [[4,2,2]] error-detecting codes. The resulting codes have a constant syndrome-measurement weight of 4, while keeping high encoding rates. We build the block-MAP and neural-network decoders and show that they demonstrate superior performance to the bounded-distance decoder.

8 pages, 4 figures

References in corpus (27)

• Surface codes: Towards practical large-scale quantum computation
• Quantum Computing with Very Noisy Devices
• Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
• High-threshold and low-overhead fault-tolerant quantum memory
• Stim: a fast stabilizer circuit simulator
• Stabilizer Formalism for Operator Quantum Error Correction
• Decoding Across the Quantum LDPC Code Landscape
• Dynamically Generated Logical Qubits
• Machine-learning-assisted correction of correlated qubit errors in a topological code
• Decoding Small Surface Codes with Feedforward Neural Networks
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• A Fault-Tolerant Honeycomb Memory
• Deep neural decoders for near term fault-tolerant experiments
• Advantages of versatile neural-network decoding for topological codes
• Comparing neural network based decoders for the surface code
• Floquet codes without parent subsystem codes
• Neural network decoder for topological color codes with circuit level noise
• Fault-tolerant quantum error correction for Steane's seven-qubit color code with few or no extra qubits
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Boundaries for the Honeycomb Code
• Benchmarking the Planar Honeycomb Code
• Unifying flavors of fault tolerance with the ZX calculus
• Engineering 3D Floquet codes by rewinding
• Floquetifying the Colour Code
• Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing
• Dynamical Logical Qubits in the Bacon-Shor Code
• Concatenate codes, save qubits