Information theoretic approach to readout error mitigation for quantum computers

• URL: http://arxiv.org/abs/2307.09667v2
• Date: Fri, 24 Nov 2023 13:32:08 GMT
• Title: Information theoretic approach to readout error mitigation for quantum computers
• Authors: Hai-Chau Nguyen
• Abstract summary: We show that the method of iterative bayesian unfolding for mitigating readout errors in quantum computers can be derived from an information theoretic analysis. In particular, we distinguish between structural mitigation and unstructural mitigation. We illustrate our analysis using the data of the preparation of the GHZ state in a 127-qubit quantum computer.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 bitstrings. 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 bitstrings 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 bitstring, 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 GHZ state in a 127-qubit quantum computer.

Related papers

• Suppressing Correlated Noise in Quantum Computers via Context-Aware Compiling [0.9623525909952625]
  Correlations in noise can occur as a result of spatial and temporal configurations of instructions executing on the quantum processor. We devise compiler strategies to suppress these errors using dynamical decoupling or error compensation into the rest of the circuit. Our experiments show an increase of 18.5% in layer fidelity for a candidate 10-qubit circuit layer compared to context-unaware suppression.
  arXiv  Detail & Related papers  (2024-03-11T16:08:52Z)
• Incoherent Approximation of Leakage in Quantum Error Correction [0.03922370499388702]
  Quantum error correcting codes typically do not account for quantum state transitions - leakage - out of the computational subspace. We introduce a Random Phase Approximation (RPA) on quantum channels that preserves the incoherence between the computational and leakage subspaces. We show that RPA yields accurate error correction statistics in the repetition and surface codes with physical error parameters.
  arXiv  Detail & Related papers  (2023-12-16T00:52:23Z)
• Efficient separate quantification of state preparation errors and measurement errors on quantum computers and their mitigation [0.5439020425819]
  Current noisy quantum computers have multiple types of errors, which can occur in the state preparation, measurement/readout, and gate operation. We propose a simple and resource-efficient approach to quantify separately the state preparation and readout error rates.
  arXiv  Detail & Related papers  (2023-10-29T02:51:06Z)
• Volumetric Benchmarking of Error Mitigation with Qermit [0.0]
  We develop a methodology to assess the performance of quantum error mitigation techniques. Our benchmarks are volumetric in design, and are performed on different superconducting hardware devices. Qermit is an open source python package for quantum error mitigation.
  arXiv  Detail & Related papers  (2022-04-20T18:13:04Z)
• 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)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• 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)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Quantum Algorithms for Data Representation and Analysis [68.754953879193]
  We provide quantum procedures that speed-up the solution of eigenproblems for data representation in machine learning. The power and practical use of these subroutines is shown through new quantum algorithms, sublinear in the input matrix's size, for principal component analysis, correspondence analysis, and latent semantic analysis. Results show that the run-time parameters that do not depend on the input's size are reasonable and that the error on the computed model is small, allowing for competitive classification performances.
  arXiv  Detail & Related papers  (2021-04-19T00:41:43Z)
• Deterministic correction of qubit loss [48.43720700248091]
  Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors. We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
  arXiv  Detail & Related papers  (2020-02-21T19:48:53Z)

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.