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

• URL: http://arxiv.org/abs/2405.03032v2
• Date: Tue, 14 Jan 2025 05:43:14 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 develop a framework to estimate the computational accuracy of near-term noisy, intermediate scale quantum computing devices.<n>Results indicate that current quantum computers can achieve error rates that yield useful outcomes for chemical applications.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computing offers a potential for algorithmic speedups for applications, such as large-scale simulations in chemistry and physics. However, these speedups must yield results that are sufficiently accurate to predict realistic outcomes of experiments precisely. Delivering on the promise of high accuracy and precision requires methods to evaluate the computational accuracy of the quantum computing devices. We develop a framework to estimate the computational accuracy of near-term noisy, intermediate scale quantum (NISQ) computing devices using a quantum chemistry application. Application benchmarks that run on NISQ devices require techniques for mitigating errors to improve accuracy and precision. We use device agnostic error-mitigation schemes, quantum error detection and readout error detection, with post-selection to mitigate the dominant sources of noise. We evaluate the framework by simulating the ground state of molecular hydrogen with the variational quantum eigensolver (VQE) algorithm, estimating the energy and calculating the precision of the estimate using numerical simulations with realistic noise models. We first quantify the improvement in the logical error rate and state fidelity of the VQE application when encoded with the [[4,2,2]] quantum error detection code. When additionally encoded with readout error detection, we show that compared to the unencoded simulation, the encoded simulation yields a more accurate estimate by more than 1 mHa (0.027 eV) with comparable precision and higher state fidelity. Additionally, unlike the best estimate from the unencoded simulations, the results from the encoded simulation fall within the chemical accuracy threshold of 1.6 mHa of the exact energy. The estimated accuracy and precision indicate that current quantum computers can achieve error rates that yield useful outcomes for chemical applications.

Related papers

• Asymptotic Error Bounds and Fractional-Bit Design for Fixed-Point Grover's Quantum Algorithm Emulation [2.812395851874055]
  We analyze truncation error propagation in fixed-point QC emulation, focusing on Grover's quantum search algorithm. We quantify the overall error by scaling as $ell$ distance between ideal and emulated probability distributions. We provide a closed-form formula to determine the minimal fractional-bit precision required to achieve a specified error threshold.
  arXiv  Detail & Related papers  (2025-04-02T07:33:36Z)
• Experimental demonstration of Robust Amplitude Estimation on near-term quantum devices for chemistry applications [36.136619420474766]
  This study explores hardware implementation of Robust Amplitude Estimation (RAE) on IBM quantum devices. We demonstrate its application in quantum chemistry for one- and two-qubit Hamiltonian systems.
  arXiv  Detail & Related papers  (2024-10-01T13:42:01Z)
• 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)
• MITS: A Quantum Sorcerer Stone For Designing Surface Codes [2.348041867134616]
  We present MITS, a tool designed to reverse-engineer the well-known simulator STIM for designing QEC codes. MITS accepts the specific noise model of a quantum computer and a target logical error rate as input and outputs the optimal surface code rounds and code distances.
  arXiv  Detail & Related papers  (2024-02-16T19:17:53Z)
• 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)
• On-Chip Hardware-Aware Quantization for Mixed Precision Neural Networks [52.97107229149988]
  We propose an On-Chip Hardware-Aware Quantization framework, performing hardware-aware mixed-precision quantization on deployed edge devices. For efficiency metrics, we built an On-Chip Quantization Aware pipeline, which allows the quantization process to perceive the actual hardware efficiency of the quantization operator. For accuracy metrics, we propose Mask-Guided Quantization Estimation technology to effectively estimate the accuracy impact of operators in the on-chip scenario.
  arXiv  Detail & Related papers  (2023-09-05T04:39:34Z)
• 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)
• Statistical phase estimation and error mitigation on a superconducting quantum processor [2.624902795082451]
  We practically implement statistical phase estimation on Rigetti's superconducting processors. We incorporate error mitigation strategies including zero-noise extrapolation and readout error mitigation with bit-flip averaging. Our work demonstrates that statistical phase estimation has a natural resilience to noise, particularly after mitigating coherent errors.
  arXiv  Detail & Related papers  (2023-04-11T10:40:22Z)
• 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)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• 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)
• 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)
• The Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry [0.0]
  We study how various types of errors affect the variational quantum eigensolver (VQE) We find that the optimal way of running the hybrid classical-quantum optimization is to allow some noise in intermediate energy evaluations.
  arXiv  Detail & Related papers  (2021-11-09T06:24:52Z)
• 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)
• Realistic simulation of quantum computation using unitary and measurement channels [1.406995367117218]
  We introduce a new simulation approach that relies on approximating the density matrix evolution by a sum of unitary and measurement channels. This model shows an improvement of at least one order of magnitude in terms of accuracy compared to the best known approaches.
  arXiv  Detail & Related papers  (2020-05-13T14:29:18Z)

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.