Using Detector Likelihood for Benchmarking Quantum Error Correction

• URL: http://arxiv.org/abs/2408.02082v1
• Date: Sun, 4 Aug 2024 16:34:38 GMT
• Title: Using Detector Likelihood for Benchmarking Quantum Error Correction
• Authors: Ian Hesner, Bence Hetényi, James R. Wootton,
• Abstract summary: The behavior of real quantum hardware differs strongly from the simple error models typically used when simulating quantum error correction. We show that this can be done by means of the average detector likelihood, which quantifies the rate at which error detection events occur. This is then used to define an effective error rate at which simulations for a simple uniform noise model result in the same average detector likelihood, as well as a good prediction of the logical error rate.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The behavior of real quantum hardware differs strongly from the simple error models typically used when simulating quantum error correction. Error processes are far more complex than simple depolarizing noise applied to single gates, and error rates can vary greatly between different qubits, and at different points in the circuit. Nevertheless, it would be useful to distill all this complicated behavior down to a single parameter: an effective error rate for a simple uniform error model. Here we show that this can be done by means of the average detector likelihood, which quantifies the rate at which error detection events occur. We show that this parameter is predictive of the overall code performance for two variants of the surface code: Floquet codes and the 3-CX surface code. This is then used to define an effective error rate at which simulations for a simple uniform noise model result in the same average detector likelihood, as well as a good prediction of the logical error rate.

Related papers

• Subsystem surface and compass code sensitivities to non-identical infidelity distributions on heavy-hex lattice [0.0]
  We investigate how the logical error rate depends on parameters of the noise distribution for the subsystem surface code and the compass code. The average logical error rate depends on the average of the physical qubit infidelity distribution without sensitivity to higher moments. A decoder that is aware of location specific error rates modestly improves the logical error rate.
  arXiv  Detail & Related papers  (2024-02-13T04:05:50Z)
• Scalable evaluation of incoherent infidelity in quantum devices [0.0]
  We introduce the incoherent infidelity as a measure of incoherent errors. This method is applicable to generic quantum evolutions subjected to time-dependent Markovian noise. It provides an error quantifier for the target circuit, rather than an error averaged over many circuits or quantum gates.
  arXiv  Detail & Related papers  (2023-05-30T19:03:42Z)
• Lattice gauge theory and topological quantum error correction with quantum deviations in the state preparation and error detection [0.0]
  We focus on the topological surface code, and study the case when the code suffers from both noise and coherent noise on the multi-qubit entanglement gates. We conclude that this type of unavoidable coherent errors could have a fatal impact on the error correction performance.
  arXiv  Detail & Related papers  (2023-01-30T13:12:41Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• 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)
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code [42.394110572265376]
  We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors. In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
  arXiv  Detail & Related papers  (2021-12-07T13:58:44Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)
• 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)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)
• Optimal noise estimation from syndrome statistics of quantum codes [0.7264378254137809]
  Quantum error correction allows to actively correct errors occurring in a quantum computation when the noise is weak enough. Traditionally, this information is obtained by benchmarking the device before operation. We address the question of what can be learned from only the measurements done during decoding.
  arXiv  Detail & Related papers  (2020-10-05T18:00:26Z)

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.