Structural encoding with classical codes for computational-basis bit-flip correction in the early fault-tolerant regime

Abstract

Achieving reliable performance on early fault-tolerant quantum hardware will depend on protocols that manage noise without incurring prohibitive overhead. We propose a novel framework that integrates quantum computation with the functionality of classical error correction. In this approach, quantum computation is performed within the codeword subspace defined by a classical error correction code. The correction of various types of errors that manifest as bit flips is carried out based on the final measurement outcomes. The approach leverages the asymmetric structure of many key algorithms, where problem-defining diagonal operators (e.g., oracles) are paired with fixed non-diagonal operators (e.g., diffusion operators). The proposed encoding maps computational basis states to classical codewords. This approach commutes with diagonal operators, obviating their overhead and confining the main computational cost to simpler non-diagonal components. Noisy simulations corroborate this analysis, demonstrating that the proposed scheme serves as a viable protocol-level layer for enhancing performance in the early fault-tolerant regime.

23 pages, 6 figures

References in corpus (31)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Surface codes: Towards practical large-scale quantum computation
• Noisy intermediate-scale quantum (NISQ) algorithms
• Error mitigation for short-depth quantum circuits
• Quantum Error Correction for Quantum Memories
• Trapped-Ion Quantum Computing: Progress and Challenges
• Quantum Computing with Very Noisy Devices
• Characterizing Quantum Supremacy in Near-Term Devices
• Logical quantum processor based on reconfigurable atom arrays
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Roads towards fault-tolerant universal quantum computation
• Efficient Z-Gates for Quantum Computing
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Benchmarking an 11-qubit quantum computer
• Quantum computing with neutral atoms
• Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
• Mitigating measurement errors in multi-qubit experiments
• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• Low-cost error mitigation by symmetry verification
• Digital zero noise extrapolation for quantum error mitigation
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Quantum Sampling Problems, BosonSampling and Quantum Supremacy
• Fundamental limits of quantum error mitigation
• Fault-tolerant quantum computation with few qubits
• Error Mitigation by Symmetry Verification on a Variational Quantum Eigensolver
• Benchmarking a trapped-ion quantum computer with 30 qubits
• Quantum Error Mitigation using Symmetry Expansion
• Boundaries of quantum supremacy via random circuit sampling
• Group-theoretic error mitigation enabled by classical shadows and symmetries