Algorithmic error mitigation for quantum eigenvalues estimation

• URL: http://arxiv.org/abs/2308.03879v2
• Date: Fri, 8 Mar 2024 08:50:22 GMT
• Title: Algorithmic error mitigation for quantum eigenvalues estimation
• Authors: Adam Siegel, Kosuke Mitarai and Keisuke Fujii
• Abstract summary: Even fault-tolerant computers will be subject to algorithmic errors when estimating eigenvalues. We propose an error mitigation strategy that enables a reduction of the algorithmic errors. Our results promise accurate eigenvalue estimation even in early fault-tolerant devices with limited number of qubits.
• Score: 0.9002260638342727
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: When estimating the eigenvalues of a given observable, even fault-tolerant quantum computers will be subject to errors, namely algorithmic errors. These stem from approximations in the algorithms implementing the unitary passed to phase estimation to extract the eigenvalues, e.g. Trotterisation or qubitisation. These errors can be tamed by increasing the circuit complexity, which may be unfeasible in early-stage fault-tolerant devices. Rather, we propose in this work an error mitigation strategy that enables a reduction of the algorithmic errors up to any order, at the cost of evaluating the eigenvalues of a set of observables implementable with limited resources. The number of required observables is estimated and is shown to only grow polynomially with the number of terms in the Hamiltonian, and in some cases, linearly with the desired order of error mitigation. Our results show error reduction of several orders of magnitude in physically relevant cases, thus promise accurate eigenvalue estimation even in early fault-tolerant devices with limited number of qubits.

Related papers

• Heisenberg-limited adaptive gradient estimation for multiple observables [0.39102514525861415]
  In quantum mechanics, measuring the expectation value of a general observable has an inherent statistical uncertainty. We provide an adaptive quantum algorithm for estimating the expectation values of $M$ general observables within root mean squared error. Our method paves a new way to precisely understand and predict various physical properties in complicated quantum systems using quantum computers.
  arXiv  Detail & Related papers  (2024-06-05T14:16:47Z)
• Relaxed Quantile Regression: Prediction Intervals for Asymmetric Noise [51.87307904567702]
  Quantile regression is a leading approach for obtaining such intervals via the empirical estimation of quantiles in the distribution of outputs. We propose Relaxed Quantile Regression (RQR), a direct alternative to quantile regression based interval construction that removes this arbitrary constraint. We demonstrate that this added flexibility results in intervals with an improvement in desirable qualities.
  arXiv  Detail & Related papers  (2024-06-05T13:36:38Z)
• Orthogonal Causal Calibration [55.28164682911196]
  We prove generic upper bounds on the calibration error of any causal parameter estimate $theta$ with respect to any loss $ell$. We use our bound to analyze the convergence of two sample splitting algorithms for causal calibration.
  arXiv  Detail & Related papers  (2024-06-04T03:35:25Z)
• Inverted-circuit zero-noise extrapolation for quantum gate error mitigation [0.0]
  We propose a simple method for estimating the strength of errors occurring in a quantum circuit. The method determines the error strength for a circuit by appending to it the inverted circuit and measuring the probability of the initial state. Our method proves to be particularly effective on current hardware, showcasing its suitability for near-term quantum computing applications.
  arXiv  Detail & Related papers  (2024-03-03T20:27:27Z)
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation [0.5729426778193399]
  We show how errors due to Trotterized time evolution can be mitigated through the use of algorithmic techniques. Our approach is to extrapolate to zero Trotter step size, akin to zero-noise extrapolation techniques for mitigating hardware errors.
  arXiv  Detail & Related papers  (2022-12-29T01:21:26Z)
• 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)
• Bias-Variance Tradeoffs in Single-Sample Binary Gradient Estimators [100.58924375509659]
  Straight-through (ST) estimator gained popularity due to its simplicity and efficiency. Several techniques were proposed to improve over ST while keeping the same low computational complexity. We conduct a theoretical analysis of Bias and Variance of these methods in order to understand tradeoffs and verify originally claimed properties.
  arXiv  Detail & Related papers  (2021-10-07T15:16:07Z)
• Information-Theoretic Generalization Bounds for Iterative Semi-Supervised Learning [81.1071978288003]
  In particular, we seek to understand the behaviour of the em generalization error of iterative SSL algorithms using information-theoretic principles. Our theoretical results suggest that when the class conditional variances are not too large, the upper bound on the generalization error decreases monotonically with the number of iterations, but quickly saturates.
  arXiv  Detail & Related papers  (2021-10-03T05:38:49Z)
• Experimental Bayesian estimation of quantum state preparation, measurement, and gate errors in multi-qubit devices [0.0]
  We self-consistently estimate up to seven parameters of each qubit's state preparation, readout, and gate errors. We demonstrate easily implemented approaches for mitigating different errors before a quantum experiment.
  arXiv  Detail & Related papers  (2021-08-24T12:45:53Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Error mitigation via verified phase estimation [0.25295633594332334]
  This paper presents a new error mitigation technique based on quantum phase estimation. We show that it can be adapted to function without the use of control qubits.
  arXiv  Detail & Related papers  (2020-10-06T07:44:10Z)

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.