Logical Error Rates for a [[4,2,2]]-Encoded Variational Quantum Eigensolver Ansatz

• URL: http://arxiv.org/abs/2405.03032v1
• Date: Sun, 5 May 2024 19:02:58 GMT
• Title: Logical Error Rates for a [[4,2,2]]-Encoded Variational Quantum Eigensolver Ansatz
• Authors: Meenambika Gowrishankar, Daniel Claudino, Jerimiah Wright, Travis Humble,
• Abstract summary: We quantify how the quantum error detection code improves the logical error rate, accuracy, and precision of an encoded variational quantum eigensolver application. We find that the most aggressive post-selection strategies improve the accuracy and precision of the encoded estimates even at the cost of increasing loss of samples.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Application benchmarks that run on noisy, intermediate-scale quantum (NISQ) computing devices require techniques for mitigating errors to improve accuracy and precision. Quantum error detection codes offer a framework by which to encode quantum computations and identify when errors occur. However, the subsequent logical error rate depends on the encoded application circuit as well as the underlying noise. Here, we quantify how the [[4,2,2]] quantum error detection code improves the logical error rate, accuracy, and precision of an encoded variational quantum eigensolver (VQE) application. We benchmark the performance of the encoded VQE for estimating the energy of the hydrogen molecule with a chemical accuracy of 1.6 mHa while managing the trade-off between probability of success of various post-selection methods. Using numerical simulation of the noisy mixed state preparation, we find that the most aggressive post-selection strategies improve the accuracy and precision of the encoded estimates even at the cost of increasing loss of samples.

Related papers

• Mitigating errors in logical qubits [1.6385815610837167]
  We develop new methods to quantify logical failure rates with exclusive decoders. We identify a regime at low error rates where the exclusion rate decays with code distance. Our work highlights the importance of post-selection as a powerful tool in quantum error correction.
  arXiv  Detail & Related papers  (2024-05-06T18:04:41Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Quantum error correction with an Ising machine under circuit-level noise [0.4977217779934656]
  We develop a decoder for circuit-level noise that solves the error estimation problems as Ising-type optimization problems. We confirm that the threshold theorem in the surface code under the circuitlevel noise is reproduced with an error threshold of approximately 0.4%.
  arXiv  Detail & Related papers  (2023-08-01T08:21:22Z)
• Compilation of a simple chemistry application to quantum error correction primitives [44.99833362998488]
  We estimate the resources required to fault-tolerantly perform quantum phase estimation on a minimal chemical example. We find that implementing even a simple chemistry circuit requires 1,000 qubits and 2,300 quantum error correction rounds.
  arXiv  Detail & Related papers  (2023-07-06T18:00:10Z)
• Virtual quantum error detection [0.17999333451993949]
  We propose a protocol called virtual quantum error detection (VQED) VQED virtually allows for evaluating computation results corresponding to post-selected quantum states obtained through quantum error detection. For some simple error models, the results obtained using VQED are robust against the noise that occurred during the operation of VQED.
  arXiv  Detail & Related papers  (2023-02-06T08:52:50Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• 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)
• 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)
• Sampling Overhead Analysis of Quantum Error Mitigation: Uncoded vs. Coded Systems [69.33243249411113]
  We show that Pauli errors incur the lowest sampling overhead among a large class of realistic quantum channels. We conceive a scheme amalgamating QEM with quantum channel coding, and analyse its sampling overhead reduction compared to pure QEM.
  arXiv  Detail & Related papers  (2020-12-15T15:51:27Z)
• Quantum key distribution over quantum repeaters with encoding: Using Error Detection as an Effective Post-Selection Tool [0.9176056742068812]
  We show that it is often more efficient to use the error detection, rather than the error correction, capability of the underlying code to sift out cases where an error has been detected. We implement our technique for three-qubit repetition codes by modelling different sources of error in crucial components of the system.
  arXiv  Detail & Related papers  (2020-07-13T13:37:50Z)

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.