Classical simulations of noisy variational quantum circuits

• URL: http://arxiv.org/abs/2306.05400v1
• Date: Thu, 8 Jun 2023 17:52:30 GMT
• Title: Classical simulations of noisy variational quantum circuits
• Authors: Enrico Fontana, Manuel S. Rudolph, Ross Duncan, Ivan Rungger, Cristina C\^irstoiu
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Noise detrimentally 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 (low weight efficient simulation algorithm), for estimating expectation values of noisy parameterised quantum circuits. It combines previous results on spectral analysis of parameterised circuits with Pauli back-propagation and recent ideas for simulations of noisy random circuits. We show, under some conditions on the circuits and mild assumptions on the noise, that LOWESA gives an efficient, polynomial algorithm in the number of qubits (and depth), with approximation error that vanishes exponentially in the physical error rate and a controllable cut-off parameter. We also discuss the practical limitations of the method for circuit classes with correlated parameters and its scaling with decreasing error rates.

Related papers

• Boundaries for quantum advantage with single photons and loop-based time-bin interferometers [40.908112113947475]
  Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines. We propose a method to exploit this loop-based structure to more efficiently simulate such systems.
  arXiv  Detail & Related papers  (2024-11-25T19:13:20Z)
• A polynomial-time classical algorithm for noisy quantum circuits [1.2708457954150887]
  We provide a-time classical algorithm for noisy quantum circuits. Our approach is based upon the intuition that noise exponentially damps non-local correlations. For constant noise rates, any quantum circuit for which error mitigation is efficient on most input states, is also classically simulable on most input states.
  arXiv  Detail & Related papers  (2024-07-17T17:48:39Z)
• Optimized noise-assisted simulation of the Lindblad equation with time-dependent coefficients on a noisy quantum processor [0.6990493129893112]
  Noise can be an asset in digital quantum simulations of open systems on Noisy Intermediate-Scale Quantum (NISQ) devices. We introduce an optimized decoherence rate control scheme that can significantly reduce computational requirements by multiple orders of magnitude.
  arXiv  Detail & Related papers  (2024-02-12T12:48:03Z)
• Accurate and Honest Approximation of Correlated Qubit Noise [39.58317527488534]
  We propose an efficient systematic construction of approximate noise channels, where their accuracy can be enhanced by incorporating noise components with higher qubit-qubit correlation degree. We find that, for realistic noise strength typical for fixed-frequency superconducting qubits, correlated noise beyond two-qubit correlation can significantly affect the code simulation accuracy.
  arXiv  Detail & Related papers  (2023-11-15T19:00:34Z)
• Improved Digital Quantum Simulation by Non-Unitary Channels [0.5999777817331317]
  We study the performance of non-unitary simulation channels and consider the error structure of channels constructed from a weighted average of unitary circuits. We show that averaging over just a few simulation circuits can significantly reduce the Trotterization error for both single-step short-time and multi-step long-time simulations.
  arXiv  Detail & Related papers  (2023-07-24T18:00:02Z)
• 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)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm [0.0]
  Noise mitigation can be performed up to some error for which we derive upper bounds. Experiments on 15 (23) qubits using IBM's devices to test both the noise model and the error-mitigation scheme. We show that similar effects are expected for Haar-random quantum states and states generated by shallow-depth random circuits.
  arXiv  Detail & Related papers  (2021-01-07T02:19:58Z)
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis [0.0]
  We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models. We apply our methods to ansatz circuits that appear in the Variational Quantum Eigensolver.
  arXiv  Detail & Related papers  (2020-08-27T16:46:12Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.