Fast and converged classical simulations of evidence for the utility of
quantum computing before fault tolerance
- URL: http://arxiv.org/abs/2308.05077v3
- Date: Fri, 26 Jan 2024 21:15:43 GMT
- Title: Fast and converged classical simulations of evidence for the utility of
quantum computing before fault tolerance
- Authors: Tomislav Begu\v{s}i\'c, Johnnie Gray, Garnet Kin-Lic Chan
- Abstract summary: A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits exceeds the capabilities of exact classical simulation.
We show that several approximate classical methods, based on sparse Pauli dynamics and tensor network algorithms, can simulate these observables orders of magnitude faster than the quantum experiment.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: A recent quantum simulation of observables of the kicked Ising model on 127
qubits implemented circuits that exceed the capabilities of exact classical
simulation. We show that several approximate classical methods, based on sparse
Pauli dynamics and tensor network algorithms, can simulate these observables
orders of magnitude faster than the quantum experiment, and can also be
systematically converged beyond the experimental accuracy. Our most accurate
technique combines a mixed Schr\"{o}dinger and Heisenberg tensor network
representation with the Bethe free entropy relation of belief propagation to
compute expectation values with an effective wavefunction-operator sandwich
bond dimension >16,000,000, achieving an absolute accuracy, without
extrapolation, in the observables of <0.01, which is converged for many
practical purposes. We thereby identify inaccuracies in the experimental
extrapolations and suggest how future experiments can be implemented to
increase the classical hardness.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - A hybrid method for quantum dynamics simulation [2.6340447642310383]
We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition.
Our method predicts observables of a quantum state in the long time by using data from a set of short time measurements from a quantum computer.
arXiv Detail & Related papers (2023-07-27T23:43:13Z) - Efficient tensor network simulation of IBM's Eagle kicked Ising
experiment [0.0]
We report an accurate and efficient classical simulation of a kicked Ising quantum system on the heavy-hexagon lattice.
We adopt a tensor network approach that reflects the geometry of the lattice and is approximately contracted using belief propagation.
arXiv Detail & Related papers (2023-06-26T17:54:08Z) - 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) - Quantum emulation of the transient dynamics in the multistate
Landau-Zener model [50.591267188664666]
We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity.
Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
arXiv Detail & Related papers (2022-11-26T15:04:11Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Probing finite-temperature observables in quantum simulators of spin
systems with short-time dynamics [62.997667081978825]
We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality.
We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
arXiv Detail & Related papers (2022-06-03T18:00:02Z) - Tensor-network study of correlation-spreading dynamics in the
two-dimensional Bose-Hubbard model [0.0]
We demonstrate that a tensor-network method running on classical computers is useful for this purpose.
We specifically analyze real-time dynamics of the two-dimensional Bose-Hubbard model after a sudden quench.
By estimating the phase and group velocities from the single-particle and density-density correlation functions, we predict how these velocities vary in the moderate interaction region.
arXiv Detail & Related papers (2021-08-25T05:37:16Z) - 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) - Benchmarking a novel efficient numerical method for localized 1D
Fermi-Hubbard systems on a quantum simulator [0.0]
We show that a quantum simulator can be used to in-effect solve for the dynamics of a many-body system.
We use a neutral-atom Fermi-Hubbard quantum simulator with $L_textexpsimeq290$ lattice sites to benchmark its performance.
We derive a simple prediction of the behaviour of interacting Bloch oscillations for spin-imbalanced Fermi-Hubbard systems.
arXiv Detail & Related papers (2021-05-13T16:03:11Z)
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.