Abstract High error-rates preclude the preparation of fully error-corrected logical qubit state on noisy intermediate scale quantum (NISQ) computers. When operand logical qubits inherit large state-preparation noise, it is difficult to show that subsequent logical gate fails less frequently than its physical (unprotected) version. We articulate a scheme of decoupling transversal logical gate errors from state-preparation noise and experimentally validate its use-case for IBM Q quantum processors. We find that in the absence of state preparation noise, the IBM Q processors significantly raise the likelihood of certain two-qubit errors in the operand(s) of [[7, 1, 3]] transversal gates. Yet, encoding can still be shown to improve the gate fidelity provided that the gate operands are strategically decoded/corrected for the likely two-qubit errors in lieu of their less likely single-qubit counterparts. This trade-off enables quantum CSS code to principally correct longer strings of errors without increasing the codeword size and paves new avenues of investigating fault-tolerance in NISQ computers.
Abstract High error-rates preclude the preparation of fully error-corrected logical qubit state on noisy intermediate scale quantum (NISQ) computers. When operand logical qubits inherit large state-preparation noise, it is difficult to show that subsequent logical gate fails less frequently than its physical (unprotected) version. We articulate a scheme of decoupling transversal logical gate errors from state-preparation noise and experimentally validate its use-case for IBM Q quantum processors. We find that in the absence of state preparation noise, the IBM Q processors significantly raise the likelihood of certain two-qubit errors in the operand(s) of [[7, 1, 3]] transversal gates. Yet, encoding can still be shown to improve the gate fidelity provided that the gate operands are strategically decoded/corrected for the likely two-qubit errors in lieu of their less likely single-qubit counterparts. This trade-off enables quantum CSS code to principally correct longer strings of errors without increasing the codeword size and paves new avenues of investigating fault-tolerance in NISQ computers.
Noisy Intermediate-Scale Quantum (NISQ) devices represent current quantum computing technology with 50-1000 qubits operating without comprehensive fault-tolerant error correction. The fundamental challenge lies in balancing error correction necessity against prohibitive resource overhead. Conventional quantum error correction codes require 10:1 to 1000:1 qubit ratios and syndrome extraction circuits exceeding 50 gates, consuming entire NISQ capacities. This work presents a comprehensive low-overhead quantum error correction framework specifically designed for NISQ constraints. Our approach combines three elements: optimised stabiliser codes which get qubit ratios of 3:1 to 10:1, adaptive syndrome extraction which works with circuits with less than 20 gates and machine learning-enhanced decoding which is specific to the noise profiles of the hardware. Experimental validation on IBM Quantum (127- qubit Eagle), IonQ trapped-ion systems, and Google Sycamore simulation demonstrates successful quantum state protection achieving 2.7× error suppression with 60% overhead reduction versus conventional surface codes. The proposed code achieves logical error rates of 0.0065 using only 10 physical qubits compared to 25 qubits for equivalent surface codes. Machine learning decoder attains 94.3% accuracy with 12-microsecond inference latency, enabling real-time error correction. Break-even performance achieved at 0.8% physical error rates establishes practical pathways for near-term quantum advantage in variational algorithms and quantum simulation applications.
Noisy Intermediate-Scale Quantum (NISQ) devices represent current quantum computing technology with 50-1000 qubits operating without comprehensive fault-tolerant error correction. The fundamental challenge lies in balancing error correction necessity against prohibitive resource overhead. Conventional quantum error correction codes require 10:1 to 1000:1 qubit ratios and syndrome extraction circuits exceeding 50 gates, consuming entire NISQ capacities. This work presents a comprehensive low-overhead quantum error correction framework specifically designed for NISQ constraints. Our approach combines three elements: optimised stabiliser codes which get qubit ratios of 3:1 to 10:1, adaptive syndrome extraction which works with circuits with less than 20 gates and machine learning-enhanced decoding which is specific to the noise profiles of the hardware. Experimental validation on IBM Quantum (127- qubit Eagle), IonQ trapped-ion systems, and Google Sycamore simulation demonstrates successful quantum state protection achieving 2.7× error suppression with 60% overhead reduction versus conventional surface codes. The proposed code achieves logical error rates of 0.0065 using only 10 physical qubits compared to 25 qubits for equivalent surface codes. Machine learning decoder attains 94.3% accuracy with 12-microsecond inference latency, enabling real-time error correction. Break-even performance achieved at 0.8% physical error rates establishes practical pathways for near-term quantum advantage in variational algorithms and quantum simulation applications.
Quantum computers will require encoding of quantum information to protect them from noise. Fault-tolerant quantum computing architectures illustrate how this might be done but have not yet shown a conclusive practical advantage. Here we demonstrate that a small but useful error detecting code improves the fidelity of the fault-tolerant gates implemented in the code space as compared to the fidelity of physically equivalent gates implemented on physical qubits. By running a randomized benchmarking protocol in the logical code space of the [4,2,2] code, we observe an order of magnitude improvement in the infidelity of the gates, with the two-qubit infidelity dropping from 5.8(2)% to 0.60(3)%. Our results are consistent with fault-tolerance theory and conclusively demonstrate the benefit of carrying out computation in a code space that can detect errors. Although the fault-tolerant gates offer an impressive improvement in fidelity, the computation as a whole is not below the fault-tolerance threshold because of noise associated with state preparation and measurement on this device.
Quantum computation promises to revolutionize information processing by exploiting superposition and entanglement, enabling applications such as quantum simulation, combinatorial optimization, and secure quantum communication. Beyond individual processors, the quantum internet aims to connect quantum nodes through entanglement distribution, enabling distributed computation. However, quantum states are fragile: environmental interactions, imperfect gate operations, and measurement errors can quickly degrade encoded information. Reliable quantum computation therefore requires carefully designed quantum error-correcting codes and fault-tolerant protocols. Unlike classical redundancy schemes, quantum error correction must preserve delicate phase relationships and relies on indirect error detection through syndrome extraction with ancillary qubits, enabling error identification without collapsing encoded states. Topological codes, in particular, emerged early as the preferred choice for many architectures due to their planar structure, local interactions, and natural support for fault-tolerant logical operations. Color codes, for instance, allow transversal implementation of all Clifford gates, whereas non-Clifford operations require magic-state injection. More recent constructions, including quantum low-density parity-check codes, offer higher encoding rates and reduced resource overhead, but require long-range qubit connectivity and more complex protocols. Despite experimental progress, several challenges remain. Many platforms exhibit biased noise, motivating codes that exploit channel asymmetry. Real-time decoding remains a critical bottleneck, as fault-tolerant computation requires low-latency processing of rapidly generated syndrome data. Fault-tolerant logical state initialization also remains resource-intensive and scales poorly with code distance. Addressing these challenges, this thesis develops a unified framework spanning theory and experiment. It provides precise performance analysis of quantum error-correcting codes in the low physical error-rate regime, introduces codes tailored to biased noise, develops fast low-complexity decoding algorithms for real-time operation, and presents modular and efficient protocols for fault-tolerant state preparation of CSS codes. The latter is demonstrated experimentally through the preparation of a logical zero state of the Golay code on the Quantinuum H2 trapped-ion quantum computer.
The promise of quantum computers hinges on the ability to scale to large system sizes, e.g., to run quantum computations consisting of more than 100 million operations fault-tolerantly. This in turn requires suppressing errors to levels inversely proportional to the size of the computation. As a step towards this ambitious goal, we present experiments on a trapped-ion QCCD processor where, through the use of fault-tolerant encoding and error correction, we are able to suppress logical error rates to levels below the physical error rates. In particular, we entangled logical qubits encoded in the [[7,1,3]] code with error rates 9.8 times to 500 times lower than at the physical level, and entangled logical qubits encoded in a [[12,2,4]] code based on Knill's C4/C6 scheme with error rates 4.7 times to 800 times lower than at the physical level, depending on the judicious use of post-selection. Moreover, we demonstrate repeated error correction with the [[12,2,4]] code, with logical error rates below physical circuit baselines corresponding to repeated CNOTs, and show evidence that the error rate per error correction cycle, which consists of over 100 physical CNOTs, approaches the error rate of two physical CNOTs. These results signify a transition from noisy intermediate scale quantum computing to reliable quantum computing, and demonstrate advanced capabilities toward large-scale fault-tolerant quantum computing.
Quantum computing is entering a transitional regime between noisy intermediate-scale quantum (NISQ) processing and early fault-tolerant quantum computation (FTQC), in which increasingly capable hardware is beginning to support repeated syndrome measurements, partial error correction, and logical-qubit operations, while residual physical and logical errors remain non-negligible. In this regime, error suppression, error mitigation, and quantum error correction are increasingly better viewed as complementary layers of a unified error-reduction strategy rather than as separate approaches, with each acting at a different stage of the quantum computation to improve simulation reliability. Thus, in this review, we provide a practical and forward-looking overview of the principal hardware error sources and the corresponding error suppression and mitigation methods for reducing their impact across the current NISQ-FTQC transition. We discuss hardware-aware circuit design, coherent-error suppression, readout mitigation, noise extrapolation, classical inference, and software-supported workflows, with particular emphasis on their implementation on actual quantum processors. We further examine how error mitigation techniques can be adapted to encoded and logical-qubit settings so that they can operate alongside quantum error correction to suppress residual logical errors and improve the accuracy of computation in the early fault-tolerant regime.