Assertions are used extensively in programming to check for program bugs or runtime errors. In quantum computers, runtime errors are many orders of magnitude more likely, making it critical to detect such errors. The problem is exacerbated due to several factors: direct observation of the quantum state destroys it, and the process of detecting errors can itself introduce extra errors. Here, we introduce methods for efficiently detecting errors in quantum circuits by leveraging spacetime codes. These checks introduce little additional error and can be tailored to the underlying quantum hardware, including its qubit connectivity graph and dominant sources of noise. We show the practicality of the approach by successfully preparing maximally entangled states on 50 logical qubits. Such error detection methods form a viable bridge between near-term error mitigation and longer-term error correction in quantum computers.
Assertions are used extensively in programming to check for program bugs or runtime errors. In quantum computers, runtime errors are many orders of magnitude more likely, making it critical to detect such errors. The problem is exacerbated due to several factors: direct observation of the quantum state destroys it, and the process of detecting errors can itself introduce extra errors. Here, we introduce methods for efficiently detecting errors in quantum circuits by leveraging spacetime codes. These checks introduce little additional error and can be tailored to the underlying quantum hardware, including its qubit connectivity graph and dominant sources of noise. We show the practicality of the approach by successfully preparing maximally entangled states on 50 logical qubits. Such error detection methods form a viable bridge between near-term error mitigation and longer-term error correction in quantum computers.
We introduce a low-overhead approach for detecting errors in arbitrary Clifford circuits on arbitrary qubit connectivities. Our method is based on the framework of spacetime codes, and is particularly suited to near-term hardware since it has a much milder overhead in qubits and gates compared to error correction, while achieving a better sampling overhead than existing error mitigation methods. We present efficient algorithms for finding valid checks that are simultaneously low weight, satisfy connectivity constraints, and cover large detecting regions within the circuit. Using this approach, we experimentally demonstrate error detection on circuits of up to 50 logical qubits containing 2450 CZ gates, and show physical to logical fidelity gains of up to 236×. Furthermore, we show our algorithm can efficiently find checks in universal circuits, but the space of valid checks diminishes exponentially with the non-Cliffordness of the circuit. These theoretical and experimental results suggest that Clifford-dominated circuits are promising candidates for near-term quantum advantage.
Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit.
We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.
An assertion is a predicate that should be evaluated true during program execution. In this paper, we present the development of quantum assertion schemes and show how they are used for hardware error mitigation and software debugging. Compared to assertions in classical programs, quantum assertions are challenging due to the no-cloning theorem and potentially destructive measurement. We discuss how these challenges can be circumvented such that certain properties of quantum states can be verified non-destructively during program execution. Furthermore, we show that besides detecting program bugs, dynamic assertion circuits can mitigate noise effects via post-selection of the assertion results. Our case studies demonstrate the use of quantum assertions in various quantum algorithms.
Quantum error mitigation (QEM) is typically viewed as a suite of practical techniques for today's noisy intermediate-scale quantum devices, with limited relevance once fault-tolerant quantum computers become available. In this work, we challenge this conventional wisdom by showing that QEM can continue to provide substantial benefits in the era of quantum error correction (QEC), and in an even more efficient manner than it does on current devices. We introduce a framework for logical-level QEM that leverages soft information naturally produced by QEC decoders, requiring no additional data, hardware modifications, or runtime overhead beyond what QEC protocols already provide. Within this framework, we develop and analyze three logical-level QEM techniques: post-selection and runtime abort policies, probabilistic error cancellation, and zero-noise extrapolation. Our techniques reduce logical error rates by more than 100x while discarding fewer than 0.1% of shots; they also provide in situ characterization of logical channels for QEM protocols. As a proof of principle, we benchmark our approach using a surface-code architecture and two state-of-the-art decoders based on tensor-network contraction and minimum-weight perfect matching. We evaluate logical-level QEM on random Clifford circuits and molecular simulation algorithms and find that, compared to previous approaches relying on QEC only or QEC combined with QEM, we can achieve up to 87.4% spacetime overhead savings. Our results demonstrate that logical-level QEM with QEC decoder soft information can reliably improve logical performance, underscoring the efficiency and usefulness of QEM techniques for fault-tolerant quantum computers.
This paper explores a novel approach to quantum error correction (QEC) centered around the deliberate incorporation of entanglement-based redundancy directly within the design of quantum circuits. Current QEC strategies often rely on external, post-processing correction stages, which introduce significant overhead and complexity. We argue that a more efficient and intrinsically robust solution lies in building self-correcting circuits where redundancy is woven into the circuit's architecture itself, utilizing entangled qubits to detect and mitigate errors in real-time. This approach shifts the paradigm from correction *after* computation to correction *during* computation. The core mechanism involves encoding logical information across multiple physical qubits through carefully designed entangled states, creating a network capable of detecting errors via measurement and then implementing corrective operations through controlled interactions. We present a theoretical framework for designing such circuits, detailing the key considerations for state preparation, entanglement distribution, and error detection/correction protocols. We demonstrate, through mathematical analysis and circuit design principles, that this entanglement-based redundancy can substantially improve the resilience of quantum computations against various noise sources. The proposed method offers a potentially transformative pathway towards fault-tolerant quantum computing, reducing the overall complexity and resource requirements associated with error correction.
Correcting errors due to noise in quantum circuits run on current and near-term quantum hardware is essential for any convincing demonstration of quantum advantage. Indeed, in many cases it has been shown that noise renders quantum circuits efficiently classically simulable, thereby destroying any quantum advantage potentially offered by an ideal (noiseless) implementation of these circuits. Although the technique of quantum error correction (QEC) allows correcting these errors very accurately, QEC usually requires a large overhead of physical qubits which is not reachable with currently available quantum hardware. This has been the motivation behind the field of quantum error mitigation, which aims at developing techniques to correct an important part of the errors in quantum circuits, while also being compatible with current and near-term quantum hardware. In this work, we present a technique for quantum error mitigation which is based on a technique from quantum verification, the so-called accreditation protocol, together with postselection. Our technique allows for correcting the expectation value of an observable O, which is the output of multiple runs of noisy quantum circuits, where the noise in these circuits is at the level of preparations, gates, and measurements. We discuss the sample complexity of our procedure and provide rigorous guarantees of errors being mitigated under some realistic assumptions on the noise. Our technique is tailored to time-dependent behaviors, as we allow for the output states to be different between different runs of the accreditation protocol. We validate our findings by running our technique on currently available quantum hardware.