Perturbative readout error mitigation for near term quantum computers

• URL: http://arxiv.org/abs/2105.08161v2
• Date: Fri, 30 Jun 2023 15:45:57 GMT
• Title: Perturbative readout error mitigation for near term quantum computers
• Authors: Evan Peters, Andy C. Y. Li, Gabriel N. Perdue
• Abstract summary: Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. We modify standard matrix techniques using two perturbative approximations with significantly reduced complexity and bounded error. These approximate techniques for readout error correction may greatly accelerate near term quantum computing applications.
• Score: 0.5156484100374058
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 \emph{response matrix} that describes the error associated with 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 in the number of qubits $n$. In this work, we modify standard matrix inversion techniques using two perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high order bitflip events is strongly suppressed. Given a characteristic error rate $q$, our first method recovers the probability of the all-zeros bitstring $p_0$ by sampling only a small subspace of the response matrix before inverting readout error resulting in a relative speedup of $\text{poly}\left(2^{n} / \big(\begin{smallmatrix} n \\ w \end{smallmatrix}\big)\right)$, which we motivate using a simplified error model for which the approximation incurs only $O(q^w)$ error for some integer $w$. We then provide a generalized technique to efficiently recover full output distributions with $O(q^w)$ error in the perturbative limit. These approximate techniques for readout error correction may greatly accelerate near term quantum computing applications.

Related papers

• Statistical mechanical mapping and maximum-likelihood thresholds for the surface code under generic single-qubit coherent errors [0.0]
  We consider single-qubit coherent errors in the surface code, i.e., rotations by angle $alpha$ about an axis that can be chosen arbitrarily. We numerically establish the existence of an error-correcting phase, which we chart in a subspace of rotation axes to estimate the corresponding maximum-likelihood thresholds.
  arXiv  Detail & Related papers  (2024-10-29T18:23:23Z)
• Robust Error Accumulation Suppression for Quantum Circuits [0.6282171844772421]
  We present a robust error accumulation suppression technique to manage errors in quantum computers. For coherent errors, we show a reduction of the error scaling in an $L$-depth circuit from $O(sqrtL)$ to $O(sqrtL)$. We derive the general form of decoherence noise that can be suppressed by REAS.
  arXiv  Detail & Related papers  (2024-01-30T10:38:53Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Error Correction of Quantum Algorithms: Arbitrarily Accurate Recovery Of Noisy Quantum Signal Processing [4.360680431298019]
  We present a first step in achieving error correction at the level of quantum algorithms by combining a unified perspective on modern quantum algorithms via quantum signal processing. Our algorithmic-level error correction method is applied to Grover's fixed-point search algorithm as a demonstration.
  arXiv  Detail & Related papers  (2023-01-20T12:56:20Z)
• Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
  We study the problem of designing worst-case to average-case reductions for quantum algorithms. We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
  arXiv  Detail & Related papers  (2022-12-06T22:01:49Z)
• The Accuracy vs. Sampling Overhead Trade-off in Quantum Error Mitigation Using Monte Carlo-Based Channel Inversion [84.66087478797475]
  Quantum error mitigation (QEM) is a class of promising techniques for reducing the computational error of variational quantum algorithms. We consider a practical channel inversion strategy based on Monte Carlo sampling, which introduces additional computational error. We show that when the computational error is small compared to the dynamic range of the error-free results, it scales with the square root of the number of gates.
  arXiv  Detail & Related papers  (2022-01-20T00:05:01Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Qubit Readout Error Mitigation with Bit-flip Averaging [0.0]
  We present a scheme to more efficiently mitigate qubit readout errors on quantum hardware. Our scheme removes biases in the readout errors allowing a general error model to be built with far fewer calibration measurements. Our approach can be combined with, and simplify, other mitigation methods allowing tractable mitigation even for large numbers of qubits.
  arXiv  Detail & Related papers  (2021-06-10T15:08:06Z)
• Exponential suppression of bit or phase flip errors with repetitive error correction [56.362599585843085]
  State-of-the-art quantum platforms typically have physical error rates near $10-3$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits. We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
  arXiv  Detail & Related papers  (2021-02-11T17:11:20Z)
• Exponential Error Suppression for Near-Term Quantum Devices [0.0]
  In NISQ era, complexity and scale required to adopt even the smallest QEC is prohibitive. We show that for the crucial case of estimating expectation values of observables one can indeed achieve an effective exponential suppression.
  arXiv  Detail & Related papers  (2020-11-11T18:00:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.