If noisy-intermediate-scale-quantum-era quantum computers are to perform useful tasks, they will need to employ powerful error mitigation techniques.Quasiprobability methods can permit perfect error compensation at the cost of additional circuit executions, provided that the nature of the error model is fully understood and sufficiently local both spatially and temporally.Unfortunately, these conditions are challenging to satisfy.Here we present a method by which the proper compensation strategy can instead be learned ab initio.Our training process uses multiple variants of the primary circuit where all non-Clifford gates are substituted with gates that are efficient to simulate classically.The process yields a configuration that is near optimal versus noise in the real system with its non-Clifford gate set.Having presented a range of learning strategies, we demonstrate the power of the technique both with real quantum hardware (IBM devices) and exactly emulated imperfect quantum computers.The systems suffer a range of noise severities and types, including spatially and temporally correlated variants.In all cases the protocol successfully adapts to the noise and mitigates it to a high degree.
If noisy-intermediate-scale-quantum-era quantum computers are to perform useful tasks, they will need to employ powerful error mitigation techniques.Quasiprobability methods can permit perfect error compensation at the cost of additional circuit executions, provided that the nature of the error model is fully understood and sufficiently local both spatially and temporally.Unfortunately, these conditions are challenging to satisfy.Here we present a method by which the proper compensation strategy can instead be learned ab initio.Our training process uses multiple variants of the primary circuit where all non-Clifford gates are substituted with gates that are efficient to simulate classically.The process yields a configuration that is near optimal versus noise in the real system with its non-Clifford gate set.Having presented a range of learning strategies, we demonstrate the power of the technique both with real quantum hardware (IBM devices) and exactly emulated imperfect quantum computers.The systems suffer a range of noise severities and types, including spatially and temporally correlated variants.In all cases the protocol successfully adapts to the noise and mitigates it to a high degree.
To address the challenge posed by noise in real quantum devices, quantum error mitigation techniques play a crucial role. These techniques are resource-efficient, making them suitable for implementation in noisy intermediate-scale quantum devices, unlike the more resource-intensive quantum error correction codes. A notable example of such a technique is Clifford Data Regression, which employs a supervised learning approach. This work investigates two variants of this technique, both of which introduce a non-trivial set of gates into the original circuit. The first variant uses multiple copies of the original circuit, while the second adds a layer of single-qubit rotations. Different characteristics of these methods are analyzed theoretically, such as their complexity, or the scaling of the error with various parameters. Additionally, the performance of these methods is evaluated through numerical experiments, demonstrating a reduction in root mean square error.
We explore the field of quantum computing and specifically address the crucial problem of error reduction in the context of IBM simulators. Although quantum computing is a rapidly developing technology with great potential, its practical applications are severely hindered by its inherent error-proneness. We tackle this problem by introducing new developments in quantum error correction techniques designed for IBM simulators. In contrast to conventional methods that frequently depend on large matrices or pre-established error models; our technique presents a flexible and dynamic approach. By utilizing several variations of a main circuit, in which classically efficient gates are used in place of non-Clifford gates, we are able to discover the best compensation scheme from scratch for actual quantum systems. The suggested method exhibits great flexibility in handling different levels of noise and different kinds of noise, such as spatially and temporally correlated variations. It also effectively reduces errors on IBM quantum hardware as well as precisely emulated imperfect quantum computers. By offering a thorough investigation of sophisticated error mitigation techniques, this research advances the continuing quest for dependable quantum computations and opens up interesting new directions for improving both the accuracy and performance of quantum computing operations carried out on IBM simulators.
Noise in quantum hardware is the primary obstacle to realizing the transformative potential of quantum computing. Quantum error mitigation (QEM) offers a promising pathway to enhance computational accuracy on near-term devices, yet existing methods face a difficult trade-off between performance, resource overhead, and theoretical guarantees. In this work, we introduce neighbor-informed learning (NIL), a versatile and scalable QEM framework that unifies and strengthens existing methods such as zero-noise extrapolation (ZNE) and probabilistic error cancellation (PEC), while offering improved flexibility, accuracy, efficiency, and robustness.
NIL learns to predict the ideal output of a target quantum circuit from the noisy outputs of its structurally related ``neighbor'' circuits. A key innovation is our 2-design training method, which generates training data for our machine learning model. In contrast to conventional learning-based QEM protocols that create training circuits by replacing non-Clifford gates with uniformly random Clifford gates, our approach achieves higher accuracy and efficiency, as demonstrated by both theoretical analysis and numerical simulation. Furthermore, we prove that the required size of the training set scales only \emph{logarithmically} with the total number of neighbor circuits, enabling NIL to be applied to problems involving large-scale quantum circuits. Our work establishes a theoretically grounded and practically efficient framework for QEM, paving a viable path toward achieving quantum advantage on noisy hardware.
Quantum error mitigation (QEM) is critical for harnessing the potential of near-term quantum devices. Particularly, QEM protocols can be designed based on machine learning, where the mapping between noisy computational outputs and ideal ones can be learned on a training set consisting of Clifford circuits or near-Clifford circuits that contain only a limited number of non-Clifford gates. This learned mapping is then applied to noisy target circuits to estimate the ideal computational output. In this work, we propose a learning-based error mitigation framework called Clifford Perturbation Data Regression (CPDR), which constructs training sets by Clifford circuits with small perturbations. Specifically, these circuits are parameterized quantum circuits, where the rotation angles of the gates are restricted to a narrow range, ensuring that the gates remain close to Clifford gates. This design enables the efficient simulation of the training circuits using the Sparse Pauli Dynamics method. As a result, CPDR is able to utilize training sets with a better diversity to train the model, compared with previous learning-based QEM models that construct training sets with only Clifford or near-Clifford circuits. Numerical simulations on small-scale Ising model circuits demonstrate that the performance of CPDR dramatically outperforms that of existing methods such as Zero-Noise Extrapolation and learning-based Probabilistic Error Cancellation. Furthermore, using the experimental data from IBM's 127-qubit Eagle processor, our findings suggest that CPDR demonstrates improved accuracy compared to the original mitigation results reported in [Nature 618, 500 (2023)].
In addressing the challenge posed by noise in actual quantum devices, the application of quantum error mitigation techniques becomes essential. These techniques are resource-efficient, making them viable for implementation in noisy intermediate-scale quantum devices, unlike the resource-intensive quantum error correction codes. A prominent example among these techniques is Clifford Data Regression, which employs a supervised learning approach. This work explores two variants of this technique, both of which add a non-trivial set of gates to the original circuit. The first variant leverages copies of the original circuit, whereas the second approach adds a layer of 1-qubit rotations.
Achieving near-term quantum advantage will require accurate estimation of quantum observables despite significant hardware noise. For this purpose, we propose a novel, scalable error-mitigation method that applies to gate-based quantum computers. The method generates training data { X i noisy , X i exact } via quantum circuits composed largely of Clifford gates, which can be efficiently simulated classically, where X i noisy and X i exact are noisy and noiseless observables respectively. Fitting a linear ansatz to this data then allows for the prediction of noise-free observables for arbitrary circuits. We analyze the performance of our method versus the number of qubits, circuit depth, and number of non-Clifford gates. We obtain an order-of-magnitude error reduction for a ground-state energy problem on 16 qubits in an IBMQ quantum computer and on a 64-qubit noisy simulator.