Abstract In the current era of noisy intermediate-scale quantum computers, noisy qubits can result in biased results for early quantum algorithm applications. This is a significant challenge for interpreting results from quantum computer simulations for quantum chemistry, nuclear physics, high energy physics (HEP), and other emerging scientific applications. An important class of qubit errors are readout errors. The most basic method to correct readout errors is matrix inversion, using a response matrix built from simple operations to probe the rate of transitions from known initial quantum states to readout outcomes. One challenge with inverting matrices with large off-diagonal components is that the results are sensitive to statistical fluctuations. This challenge is familiar to HEP, where prior-independent regularized matrix inversion techniques (“unfolding”) have been developed for years to correct for acceptance and detector effects, when performing differential cross section measurements. We study one such method, known as iterative Bayesian unfolding, as a potential tool for correcting readout errors from universal gate-based quantum computers. This method is shown to avoid pathologies from commonly used matrix inversion and least squares methods.
Abstract In the current era of noisy intermediate-scale quantum computers, noisy qubits can result in biased results for early quantum algorithm applications. This is a significant challenge for interpreting results from quantum computer simulations for quantum chemistry, nuclear physics, high energy physics (HEP), and other emerging scientific applications. An important class of qubit errors are readout errors. The most basic method to correct readout errors is matrix inversion, using a response matrix built from simple operations to probe the rate of transitions from known initial quantum states to readout outcomes. One challenge with inverting matrices with large off-diagonal components is that the results are sensitive to statistical fluctuations. This challenge is familiar to HEP, where prior-independent regularized matrix inversion techniques (“unfolding”) have been developed for years to correct for acceptance and detector effects, when performing differential cross section measurements. We study one such method, known as iterative Bayesian unfolding, as a potential tool for correcting readout errors from universal gate-based quantum computers. This method is shown to avoid pathologies from commonly used matrix inversion and least squares methods.
Measurement errors are a significant obstacle to achieving scalable quantum computation. To counteract systematic readout errors, researchers have developed postprocessing techniques known as measurement error mitigation methods. However, these methods face a tradeoff between scalability and returning nonnegative probabilities. In this paper, we present a solution to overcome this challenge. Our approach focuses on iterative Bayesian unfolding, a standard mitigation technique used in high-energy physics experiments, and implements it in a scalable way. We demonstrate our method on experimental Greenberger-Horne-Zeilinger state preparation on up to 127 qubits and on the Bernstein-Vazirani algorithm on up to 26 qubits. Compared to state-of-the-art methods (such as M3), our implementation guarantees valid probability distributions, returns comparable or better-mitigated results, and does so without a noticeable time and memory overhead. Published by the American Physical Society 2024
We show that the method of iterative Bayesian unfolding for mitigating readout errors in quantum computers can be derived from an information theoretic analysis. This inspires more flexible applications of this error-mitigation scheme. In particular, we distinguish between structural mitigation and unstructural mitigation. Structural mitigation addresses nearly deterministic quantum computation, where the computer is expected to output a single- or few-outcome bit strings. It is shown that the readout errors alone can be corrected by few repetitions of the computation. In contrast, unstructural mitigation is designed for quantum simulation, where the computer outputs bit strings broadly distributed. In this case, one is interested in mitigating certain observables of interest. As most observables of interest are dependent on few bits and not the whole bit string, it is sufficient to mitigate the marginal distributions over these dependent bits. As long as the cross talk of readout errors can be ignored, it is shown that the iterative Bayesian unfolding applied locally for these marginal distributions gives similar results as mitigation using least squared errors. We illustrate our analysis using the data of the preparation of the Greenberger-Horne-Zeilinger state in a 127-qubit quantum computer.
In Phys. Rev. A 108, L060402 (2023), we introduced a Bayesian measurement error mitigation algorithm, which leveraged complete information from the readout signal, and validated the protocol on a quantum device with five superconducting qubits. Here, we present an improved algorithm's implementation, tailored for multiqubit experiments on near-term superconducting qubit quantum devices. In particular, we provide a detailed algorithm workflow, from calibrating the detector response functions to the postprocessing of measurement outcomes, offering a computationally efficient solution for the output size typical of current quantum computing devices. We show how the numerical representation of the noise function affects the performance of the error mitigation algorithm and test the convergence criteria. We benchmark our protocol on actual quantum computers with superconducting qubits, where the readout signal encodes the measurement information as unprocessed analog data before qubit state assignment. Finally, we compare the performance of our algorithm against other measurement error mitigation methods, such as iterative Bayesian unfolding and the Mthree method, and show how our method can be integrated on top of other readout error mitigation protocols.
Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. These errors can be mitigated by classical postprocessing given the access of an experimental response matrix that describes the error associated with the measurement of each computational basis state. However, the resources required to characterize a complete response matrix and to compute the corrected probability distribution scale exponentially with the number of qubits, n. In this work, we modify standard matrix inversion techniques using perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high-order bit-flip events is strongly suppressed. Given a characteristic error rate q, we discuss a method to recover the probability of the all-zeros bit string p0 by sampling only a small subspace of the response matrix before inverting readout error, resulting in a relative speedup of poly[2n/(nw)], which we motivate using a simplified error model for which the approximation incurs only O(qw) error for some integer w. We then provide a generalized technique to efficiently recover full output distributions with O(qw) error in the perturbative limit. These approximate techniques for readout-error correction may greatly accelerate near-term quantum computing applications.
Readout error models for noisy quantum devices almost universally assume that measurement noise is classical: the measurement statistics are obtained from the ideal computational-basis populations by a column-stochastic assignment matrix A. This description is equivalent to assuming that the effective positive-operator-valued measurement (POVM) is diagonal in the measurement basis, and therefore completely insensitive to quantum coherences. We relax this assumption and derive a fully general expression for the observed measurement probabilities under arbitrary completely positive trace-preserving (CPTP) noise preceding a computational-basis measurement. Writing the ideal post-circuit state ρ~ in terms of its populations x and coherences y, we show that the observed probability vector z satisfies z=Ax+Cy, where A is the familiar classical assignment matrix and C is a coherence-response matrix constructed from the off-diagonal matrix elements of the effective POVM in the computational basis. The classical model z=Ax arises if and only if all POVM elements are diagonal; in this sense C quantifies accessible information about coherent readout distortions and interference between computational-basis states, all of which are invisible to models that retain only A. Our numerical experiments show that incorporating C into readout recovery can improve fidelity over classical inversion and enable selective Pauli twirling with exponentially reduced circuit overhead. This work therefore provides a natural, fully general framework for coherence-sensitive readout modeling on current and future quantum devices.
Readout errors are a significant source of noise for near-term intermediate-scale quantum computers. Mismeasuring a qubit as $|1\ensuremath{\rangle}$ when it should be $|0\ensuremath{\rangle}$ occurs much less often than mismeasuring a qubit as $|0\ensuremath{\rangle}$ when it should have been $|1\ensuremath{\rangle}$. We make the simple observation that one can improve the readout fidelity of quantum computers by applying targeted X gates prior to performing a measurement. These X gates are placed so that the expected number of qubits in the $|1\ensuremath{\rangle}$ state is minimized. Classical postprocessing can undo the effect of the X gates so that the expectation value of any observable is unchanged. This protocol is designed to have no effect when readout errors are symmetric. We show that the statistical uncertainty following readout error corrections is smaller when using readout rebalancing. The statistical advantage is circuit and computer dependent and is demonstrated for the W state, a Grover search, and for a Gaussian state. The benefit in statistical precision is most pronounced (and nearly a factor of 2 in some cases) when states with many qubits in the excited state have high probability.