Scalable error mitigation for noisy quantum circuits produces competitive expectation values

• URL: http://arxiv.org/abs/2108.09197v1
• Date: Fri, 20 Aug 2021 14:32:16 GMT
• Title: Scalable error mitigation for noisy quantum circuits produces competitive expectation values
• Authors: Youngseok Kim, Christopher J. Wood, Theodore J. Yoder, Seth T. Merkel, Jay M. Gambetta, Kristan Temme, Abhinav Kandala
• Abstract summary: We show the utility of zero-noise extrapolation for relevant quantum circuits using up to 26 qubits, circuit depths of 60, and 1080 CNOT gates. We show that the efficacy of the error mitigation is greatly enhanced by additional error suppression techniques and native gate decomposition.
• Score: 1.51714450051254
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Noise in existing quantum processors only enables an approximation to ideal quantum computation. However, these approximations can be vastly improved by error mitigation, for the computation of expectation values, as shown by small-scale experimental demonstrations. However, the practical scaling of these methods to larger system sizes remains unknown. Here, we demonstrate the utility of zero-noise extrapolation for relevant quantum circuits using up to 26 qubits, circuit depths of 60, and 1080 CNOT gates. We study the scaling of the method for canonical examples of product states and entangling Clifford circuits of increasing size, and extend it to the quench dynamics of 2-D Ising spin lattices with varying couplings. We show that the efficacy of the error mitigation is greatly enhanced by additional error suppression techniques and native gate decomposition that reduce the circuit time. By combining these methods, we demonstrate an accuracy in the approximate quantum simulation of the quench dynamics that surpasses the classical approximations obtained from a state-of-the-art 2-D tensor network method. These results reveal a path to a relevant quantum advantage with noisy, digital, quantum processors.

Related papers

• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Practical limitations of quantum data propagation on noisy quantum processors [0.9362259192191963]
  We show that owing to the noisy nature of current quantum processors, such a quantum algorithm will require single- and two-qubit gates with very low error probability to produce reliable results. Specifically, we provide the upper bounds on how the relative error in variational parameters' propagation scales with the probability of noise in quantum hardware.
  arXiv  Detail & Related papers  (2023-06-22T17:12:52Z)
• Tensor-network-assisted variational quantum algorithm [3.5995214208007944]
  We present a framework for tensor-network-assisted variational quantum algorithms. We show that our approach consistently outperforms conventional methods using shallow quantum circuits.
  arXiv  Detail & Related papers  (2022-12-20T16:59:54Z)
• Pulse-efficient quantum machine learning [0.0]
  We investigate the impact of pulse-efficient circuits on quantum machine learning algorithms. We find that pulse-efficient transpilation vastly reduces average circuit durations. We conclude by applying pulse-efficient transpilation to the Hamiltonian Variational Ansatz and show that it delays the onset of noise-induced barren plateaus.
  arXiv  Detail & Related papers  (2022-11-02T18:00:01Z)
• Limitations of variational quantum algorithms: a quantum optimal transport approach [11.202435939275675]
  We obtain extremely tight bounds for standard NISQ proposals in both the noisy and noiseless regimes. The bounds limit the performance of both circuit model algorithms, such as QAOA, and also continuous-time algorithms, such as quantum annealing.
  arXiv  Detail & Related papers  (2022-04-07T13:58:44Z)
• 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)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• Scalable evaluation of quantum-circuit error loss using Clifford sampling [8.140947383885262]
  We use the quadratic error loss and the final-state fidelity loss to characterize quantum circuits. It is shown that these loss functions can be efficiently evaluated in a scalable way by sampling from Clifford-dominated circuits. Our results pave the way towards the optimization-based quantum device and algorithm design in the intermediate-scale quantum regime.
  arXiv  Detail & Related papers  (2020-07-20T11:51:36Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.