Quantum error mitigation by layerwise Richardson extrapolation

• URL: http://arxiv.org/abs/2402.04000v1
• Date: Mon, 5 Feb 2024 18:47:42 GMT
• Title: Quantum error mitigation by layerwise Richardson extrapolation
• Authors: Vincent Russo and Andrea Mari
• Abstract summary: We introduce emphlayerwise Richardson extrapolation (LRE), an error mitigation protocol for noisy quantum computers. The noise of different individual layers (or larger chunks of the circuit) is amplified and the associated expectation values are linearly combined to estimate the zero-noise limit. We provide numerical simulations demonstrating scenarios where LRE achieves superior performance compared to traditional (single-variable) Richardson extrapolation.
• Score: 0.7252027234425332
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A widely used method for mitigating errors in noisy quantum computers is Richardson extrapolation, a technique in which the overall effect of noise on the estimation of quantum expectation values is captured by a single parameter that, after being scaled to larger values, is eventually extrapolated to the zero-noise limit. We generalize this approach by introducing \emph{layerwise Richardson extrapolation (LRE)}, an error mitigation protocol in which the noise of different individual layers (or larger chunks of the circuit) is amplified and the associated expectation values are linearly combined to estimate the zero-noise limit. The coefficients of the linear combination are analytically obtained from the theory of multivariate Lagrange interpolation. LRE leverages the flexible configurational space of layerwise unitary folding, allowing for a more nuanced mitigation of errors by treating the noise level of each layer of the quantum circuit as an independent variable. We provide numerical simulations demonstrating scenarios where LRE achieves superior performance compared to traditional (single-variable) Richardson extrapolation.

Related papers

• Fault Tolerance Embedded in a Quantum-Gap-Estimation Algorithm with Trial-State Optimization [0.0]
  We show that the spectral peak of an exact target gap can be amplified beyond the noise threshold, thereby reducing gap-estimate error. Our results reveal the potential for accurate quantum simulations on near-term noisy quantum computers.
  arXiv  Detail & Related papers  (2024-05-16T17:57:15Z)
• Classical simulations of noisy variational quantum circuits [0.0]
  Noisely affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, LOWESA, for estimating expectation values of noisy parameterised quantum circuits.
  arXiv  Detail & Related papers  (2023-06-08T17:52:30Z)
• Synergetic quantum error mitigation by randomized compiling and zero-noise extrapolation for the variational quantum eigensolver [0.0]
  We propose a quantum error mitigation strategy for the variational quantum eigensolver (VQE) algorithm. We find, via numerical simulation, that very small amounts of coherent noise in VQE can cause substantially large errors. The proposed strategy is a combination of previously reported techniques, namely randomized compiling (RC) and zero-noise extrapolation (ZNE)
  arXiv  Detail & Related papers  (2022-12-21T17:13:47Z)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Optimizing Information-theoretical Generalization Bounds via Anisotropic Noise in SGLD [73.55632827932101]
  We optimize the information-theoretical generalization bound by manipulating the noise structure in SGLD. We prove that with constraint to guarantee low empirical risk, the optimal noise covariance is the square root of the expected gradient covariance.
  arXiv  Detail & Related papers  (2021-10-26T15:02:27Z)
• 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)
• Extending quantum probabilistic error cancellation by noise scaling [1.2891210250935146]
  We propose a general framework for quantum error mitigation that combines and generalizes two techniques: probabilistic error cancellation (PEC) and zero-noise extrapolation (ZNE) PEC represents ideal operations as linear combinations of noisy operations that are implementable on hardware. ZNE is used to better approximate the zero-noise limit.
  arXiv  Detail & Related papers  (2021-08-04T18:30:51Z)
• Simulating quench dynamics on a digital quantum computer with data-driven error mitigation [62.997667081978825]
  We present one of the first implementations of several Clifford data regression based methods which are used to mitigate the effect of noise in real quantum data. We find in general Clifford data regression based techniques are advantageous in comparison with zero-noise extrapolation. This is the largest systems investigated so far in a study of this type.
  arXiv  Detail & Related papers  (2021-03-23T16:56:14Z)
• 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)
• On the robustness of the hybrid qubit computational gates through simulated randomized benchmarking protocols [0.0]
  Noise characterization can be achieved by exploiting different techniques, such as randomization. A scalable and robust algorithm able to benchmark the full set of Clifford gates is called randomized benchmarking. In this study, we simulated randomized benchmarking protocols in a semiconducting all-electrical three-electron double-quantum dot qubit.
  arXiv  Detail & Related papers  (2020-11-03T09:35:39Z)

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.