The accumulation of noise in quantum computers is the dominant issue stymieing the push of quantum algorithms beyond their classical counterparts.We do not expect to be able to afford the overhead required for quantum error correction in the next decade, so in the meantime we must rely on low-cost, unscalable error mitigation techniques to bring quantum computing to its full potential.In this paper we present a new error mitigation technique based on quantum phase estimation that can also reduce errors in expectation value estimation (e.g., for variational algorithms).The general idea is to apply phase estimation while effectively postselecting for the system register to be in the starting state, which allows us to catch and discard errors that knock us away from there.We refer to this technique as "verified phase estimation" (VPE) and show that it can be adapted to function without the use of control qubits in order to simplify the control circuitry for near-term implementations.Using VPE, we demonstrate the estimation of expectation values on numerical simulations of intermediate-scale quantum circuits with multiple orders of magnitude improvement over unmitigated estimation at near-term error rates (even after accounting for the additional complexity of phase estimation).Our numerical results suggest that VPE can mitigate against any single errors that might occur; i.e., the error in the estimated expectation values often scale as O(p 2 ), where p is the probability of an error occurring at any point in the circuit.This property reveals VPE as a practical technique for mitigating errors in near-term quantum experiments.
The accumulation of noise in quantum computers is the dominant issue stymieing the push of quantum algorithms beyond their classical counterparts.We do not expect to be able to afford the overhead required for quantum error correction in the next decade, so in the meantime we must rely on low-cost, unscalable error mitigation techniques to bring quantum computing to its full potential.In this paper we present a new error mitigation technique based on quantum phase estimation that can also reduce errors in expectation value estimation (e.g., for variational algorithms).The general idea is to apply phase estimation while effectively postselecting for the system register to be in the starting state, which allows us to catch and discard errors that knock us away from there.We refer to this technique as "verified phase estimation" (VPE) and show that it can be adapted to function without the use of control qubits in order to simplify the control circuitry for near-term implementations.Using VPE, we demonstrate the estimation of expectation values on numerical simulations of intermediate-scale quantum circuits with multiple orders of magnitude improvement over unmitigated estimation at near-term error rates (even after accounting for the additional complexity of phase estimation).Our numerical results suggest that VPE can mitigate against any single errors that might occur; i.e., the error in the estimated expectation values often scale as O(p 2 ), where p is the probability of an error occurring at any point in the circuit.This property reveals VPE as a practical technique for mitigating errors in near-term quantum experiments.
Near-term quantum computers have been built as intermediate-scale quantum devices and are fragile against quantum noise effects, namely, NISQ devices. Traditional quantum-error-correcting codes are not implemented on such devices and to perform quantum computation in good accuracy with these machines we need to develop alternative approaches for mitigating quantum computational errors. In this work, we propose quantum error mitigation (QEM) scheme for quantum computational errors which occur due to couplings with environments during gate operations, i.e., decoherence. To establish our QEM scheme, first we estimate the quantum noise effects on single-qubit states and represent them as groups of quantum circuits, namely, quantum-noise-effect circuit groups. Then our QEM scheme is conducted by subtracting expectation values generated by the quantum-noise-effect circuit groups from those obtained by the quantum circuits for the quantum algorithms under consideration. As a result, the quantum noise effects are reduced, and we obtain approximately the ideal expectation values via the quantum-noise-effect circuit groups and the numbers of elementary quantum circuits composing them scale polynomial with respect to the products of the depths of quantum algorithms and the numbers of register bits. To numerically demonstrate the validity of our QEM scheme, we run noisy quantum simulations of qubits under amplitude damping effects for four types of quantum algorithms. Furthermore, we implement our QEM scheme on IBM Q Experience processors and examine its efficacy. Consequently, the validity of our scheme is verified via both the quantum simulations and the quantum computations on the real quantum devices. Our QEM scheme is solely composed of quantum-computational operations (quantum gates and measurements), and thus, it can be conducted by any type of quantum device. In addition, it can be applied to error mitigation for many other types of quantum noise effects as well as noisy quantum computing of long-depth quantum algorithms.
Variational Quantum Algorithms (VQAs) are a promising application for near-term quantum processors, however the quality of their results is greatly limited by noise. For this reason, various error mitigation techniques have emerged to deal with noise that can be applied to these algorithms. Recent work introduced a technique for mitigating expectation values against correlated measurement errors that can be applied to measurements of 10s of qubits. We apply these techniques to VQAs and demonstrate its effectiveness in improving estimates to the cost function. Moreover, we use the data resulting from this technique to experimentally characterize measurement errors in terms of the device connectivity on devices of up to 20 qubits. These results should be useful for better understanding the near-term potential of VQAs as well as understanding the correlations in measurement errors on large, near-term devices.
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.
Recent experimental breakthroughs have signalled the imminent arrival of the early fault-tolerant era. However, for a considerable period in the foreseeable future, relying solely on quantum error correction for full error suppression will remain extremely challenging due to its substantial hardware overhead. Additional help from quantum error mitigation (QEM) is essential for bridging this gap towards achieving quantum advantage. The application of QEM has so far been restricted to expectation value estimation, leaving its extension to sampling-based algorithms -- which is expected to play a pivotal role in the early fault-tolerant era -- an unresolved challenge. In this work, we present a framework for applying any QEM techniques to obtain the error-mitigated output distribution, showing that this incurs no greater cost than estimating a single observable. We also devised a way to sample from this distribution and constructed an explicit scheme for applying any QEM methods to quantum phase estimation, which can be generalised to other sampling algorithms. Numerical experiments were conducted to validate the efficacy of these methods. We believe our methods significantly broaden the scope of QEM, extending its applicability to most algorithms of practical interest and forming a crucial step towards realising quantum advantage.
Contemporary quantum computers have relatively high levels of noise, making it difficult to use them to perform useful calculations, even with a large number of qubits.Quantum error correction is expected to eventually enable fault-tolerant quantum computation at large scales, but until then, it will be necessary to use alternative strategies to mitigate the impact of errors.We propose a near-term friendly strategy to mitigate errors by entangling and measuring M copies of a noisy state ρ.This enables us to estimate expectation values with respect to a state with dramatically reduced error ρ M =Trðρ M Þ without explicitly preparing it, hence the name "virtual distillation."As M increases, this state approaches the closest pure state to ρ exponentially quickly.We analyze the effectiveness of virtual distillation and find that it is governed in many regimes by the behavior of this pure state (corresponding to the dominant eigenvector of ρ).We numerically demonstrate that virtual distillation is capable of suppressing errors by multiple orders of magnitude and explain how this effect is enhanced as the system size grows.Finally, we show that this technique can improve the convergence of randomized quantum algorithms, even in the absence of device noise.
As fully fault-tolerant quantum computers capable of solving useful problems remain a distant goal, we anticipate an era of during which limited error correction is available. We propose a framework for designing early fault-tolerant algorithms by trading between error-correction overhead and residual logical noise, and apply it to quantum phase estimation (QPE). We develop a quantum-Fourier-transform- (QFT) based QPE technique that is robust to global depolarizing noise and outperforms the previous state of the art at low and moderate noise rates. We further introduce the explicitly unbiased maximum-likelihood estimator (EUMLE), a data-processing technique that mitigates errors in QFT-based QPE schemes. EUMLE provides consistent asymptotically normal error-mitigated estimates, addressing the open problem of extending error mitigation beyond expectation-value estimation. Applying this scheme to the ground-state problem of the two-dimensional Hubbard model and various molecular Hamiltonians, we find that we can roughly halve the number of physical qubits with a ∼ 10 times wall-clock time overhead, but that further reduction causes a steep run-time increase. This work provides an end-to-end analysis of early fault-tolerance cost reductions and space-time trade-offs, and identifies which areas can be improved in the future.