Error-correcting codes were originally developed to protect both classical computation and communication from noise. Quantum error correction (QEC) adapts these ideas to the quantum setting, where the no-cloning theorem and continuous-variable error models raise qualitatively new difficulties and underlie schemes for fault-tolerant quantum computation. In contrast, quantum error mitigation (QEM) offers practical techniques to reduce noise effects in quantum devices without the significant hardware overhead required by QEC. This work examines the task of QEM from several perspectives. Using some intuitions built upon classical and quantum communication scenarios, we clarify some fundamental distinctions between QEC and QEM. We then discuss the implications of noise invertibility for QEM and give an explicit construction called Drazin inverse for non-invertible noise, which is trace preserving while the commonly used Moore–Penrose pseudoinverse may not be. Finally, we study the consequences of having an imperfect knowledge about the noise and derive conditions when noise can be reduced using QEM.
Error-correcting codes were originally developed to protect both classical computation and communication from noise. Quantum error correction (QEC) adapts these ideas to the quantum setting, where the no-cloning theorem and continuous-variable error models raise qualitatively new difficulties and underlie schemes for fault-tolerant quantum computation. In contrast, quantum error mitigation (QEM) offers practical techniques to reduce noise effects in quantum devices without the significant hardware overhead required by QEC. This work examines the task of QEM from several perspectives. Using some intuitions built upon classical and quantum communication scenarios, we clarify some fundamental distinctions between QEC and QEM. We then discuss the implications of noise invertibility for QEM and give an explicit construction called Drazin inverse for non-invertible noise, which is trace preserving while the commonly used Moore–Penrose pseudoinverse may not be. Finally, we study the consequences of having an imperfect knowledge about the noise and derive conditions when noise can be reduced using QEM.
Error-correcting codes were invented to correct errors on noisy communication channels. Quantum error correction (QEC), however, may have a wider range of uses, including information transmission, quantum simulation/computation, and fault-tolerance. These invite us to rethink QEC, in particular, about the role that quantum physics plays in terms of encoding and decoding. The fact that many quantum algorithms, especially near-term hybrid quantum-classical algorithms, only use limited types of local measurements on quantum states, leads to various new techniques called Quantum Error Mitigation (QEM). This work examines the task of QEM from several perspectives. Using some intuitions built upon classical and quantum communication scenarios, we clarify some fundamental distinctions between QEC and QEM. We then discuss the implications of noise invertibility for QEM, and give an explicit construction called Drazin-inverse for non-invertible noise, which is trace preserving while the commonly-used Moore-Penrose pseudoinverse may not be. Finally, we study the consequences of having an imperfect knowledge about the noise, and derive conditions when noise can be reduced using QEM.
Quantum error mitigation (QEM) and quantum error correction (QEC) are two research areas that are often considered as distinct entities, and the problem of combining the two approaches in a non-trivial way has only recently started to be explored. In this paper, we explore a paradigm at the intersection of the two, based on the error mitigation technique of Zero-Noise Extrapolation (ZNE), that uses the distance of an error correcting code as a noise parameter. This is distinct from some alternative approaches, as QEC is here used as a subroutine inside the QEM framework, while other proposals use QEM as a subroutine inside QEC experiments. Intuitively, we exploit the fact that a reduction in the physical noise level is analogous to an increase in the code distance, as both of them result in a decrease in the logical error rate. As such, the extrapolation to zero noise in the case of ZNE becomes comparable to the extrapolation to infinite distance in the case of this method. We describe how to calculate expectation values from a fault-tolerant computation, and we gain some analytical intuition for our ansatz choice. We explore the performance of the considered method to reduce the errors in a range of expectation values for a realistic circuit-level noise model and realistic device imperfections on the rotated surface code, and we particularly show that the performance of the method holds even in the case of non-stabiliser input states.
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.
Quantum computation is expected to have significant practical applications. The main problem in quantum computing is susceptibility to noise. Quantum error correction was developed to allow large-scale applications of quantum computing by achieving fault tolerance. However, as large-scale fault-tolerant quantum computation is not available, the question of applications of near-term hardware remains important. Current noisy intermediate-scale (NISQ) quantum devices can be used for small applications or as testbeds for larger applications; noise suppression techniques are of significant importance to their applicability. This thesis addresses noise suppression via quantum error mitigation (QEM) and quantum error correction (QEC) for near-term applications. The work aims to improve the understanding of noise-suppression techniques and their performance for exploring the physical systems of interest. The results presented in this thesis are divided into QEM and QEC chapters. The majority of the work is focused on QEM. The main interest of this thesis is the application of QEM to Hamiltonian simulations. Two simulation methods: the Trotter method and a quantum signal processing-based method, are explored. Both simulation methods, enhanced by zero-noise extrapolation, are employed to simulate the transverse-field Ising model. The obtained numerical results are promising, as the QEM allows a good recovery of noiseless values in low-noise shallow circuits, even with fixed sampling resources. A further result obtained in the QEM domain is a definition of a mitigation technique based on optimal measurement (in a metrological sense). The presentation includes analytical calculations of implementation costs and error propagation, as well as a numerical application to Hamiltonian simulation, yielding promising results: noise suppression by several orders of magnitude. The QEC part of the thesis explores its application in quantum metrology. The focus is on parameter sensing in many-body Hamiltonians. The results are purely analytical and extend a known lemma to m-local homogeneous Pauli Hamiltonian parameter sensing. This allows discussion of the scaling achieved for sensing the Hamiltonian parameters with respect to the code properties. The results in this thesis establish applications of QEM and QEC in selected near-term applications, quantify their performance, and discuss caveats and potential future applications. This thesis presents a theoretical and numerical study with implications for future experimental implementations. The relative success of the QEM and QEC shown in this thesis relies on tailoring the techniques to a chosen problem, highlighting the importance of technique adaptation in near-term applications.
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.
Study of the Issue Quantum error correction (QEC) is crucial yet incurs significant qubit overhead costs. The current QEC codes lack sufficient efficiency for near-term devices. The current generation of NISQ devices, which often rely on delicate nanostructured qubit architectures, is prone to noise, decoherence, and gate faults, which severely limit their computing capability and scalability. While traditional quantum error correction codes, such as the surface code, are theoretically resilient, they often require significant qubit overhead and complex management systems that exceed the hardware capabilities of NISQ-era devices. This raises the question of whether new, resource-efficient QEC strategies or hybrid error mitigation approaches can be tailored to the limits of nanostructured NISQ designs. This document examines the constraints of existing quantum error correction (QEC) codes, which are crucial for preserving the fidelity of quantum computations yet require substantial qubit resources. This study examines the shortcomings of current Quantum Error Correction (QEC) codes in relation to Noisy Intermediate-Scale Quantum (NISQ) devices and explores alternative strategies to create more efficient, low-overhead QEC frameworks appropriate for imminent quantum technologies.