Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model
- URL: http://arxiv.org/abs/2108.04258v2
- Date: Wed, 5 Jan 2022 17:45:09 GMT
- Title: Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model
- Authors: Alexander Miessen, Pauline J. Ollitrault, Ivano Tavernelli
- Abstract summary: 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.
- Score: 68.8204255655161
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum algorithms for quantum dynamics simulations are traditionally based
on implementing a Trotter-approximation of the time-evolution operator. This
approach typically relies on deep circuits and is therefore hampered by the
substantial limitations of available noisy and near-term quantum hardware. On
the other hand, variational quantum algorithms have become an indispensable
alternative, enabling small-scale simulations on present-day hardware. However,
despite the recent development of variational quantum algorithms for quantum
dynamics, a detailed assessment of their efficiency and scalability is yet to
be presented. To fill this gap, we applied a variational quantum algorithm
based on McLachlan's principle to simulate the dynamics of a spin-boson model
subject to varying levels of realistic hardware noise as well as in different
physical regimes, and discuss the algorithm's accuracy and scaling behavior as
a function of system size. We observe a good performance of the variational
approach used in combination with a general, physically motivated wavefunction
ansatz, and compare it to the conventional first-order Trotter-evolution.
Finally, based on this, we make scaling predictions for the simulation of a
classically intractable system. 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 for the solution of
time-dependent problems.
Related papers
- Efficient charge-preserving excited state preparation with variational quantum algorithms [33.03471460050495]
We introduce a charge-preserving VQD (CPVQD) algorithm, designed to incorporate symmetry and the corresponding conserved charge into the VQD framework.
Results show applications in high-energy physics, nuclear physics, and quantum chemistry.
arXiv Detail & Related papers (2024-10-18T10:30:14Z) - An Efficient Classical Algorithm for Simulating Short Time 2D Quantum Dynamics [2.891413712995642]
We introduce an efficient classical algorithm for simulating short-time dynamics in 2D quantum systems.
Our results reveal the inherent simplicity in the complexity of short-time 2D quantum dynamics.
This work advances our understanding of the boundary between classical and quantum computation.
arXiv Detail & Related papers (2024-09-06T09:59:12Z) - 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) - Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
arXiv Detail & Related papers (2024-07-04T21:11:05Z) - Benchmarking digital quantum simulations above hundreds of qubits using quantum critical dynamics [42.29248343585333]
We benchmark quantum hardware and error mitigation techniques on up to 133 qubits.
We show reliable control up to a two-qubit gate depth of 28, featuring a maximum of 1396 two-qubit gates.
Results are transferable to applications such as Hamiltonian simulation, variational algorithms, optimization, or quantum machine learning.
arXiv Detail & Related papers (2024-04-11T18:00:05Z) - Dynamical quantum phase transitions of the Schwinger model: real-time
dynamics on IBM Quantum [0.0]
We implement an algorithm to simulate the real-time dynamics of a few-qubit system that approximates the Schwinger model in the framework of lattice gauge theories.
Limitations in the simulation capabilities on IBM Quantum are imposed by noise affecting the application of single-qubit and two-qubit gates.
arXiv Detail & Related papers (2023-02-02T15:13:21Z) - Classical simulation of short-time quantum dynamics [0.0]
We present classical algorithms for approximating the dynamics of local observables and nonlocal quantities.
We establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.
arXiv Detail & Related papers (2022-10-20T18:00:04Z) - 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) - A Neural-Network Variational Quantum Algorithm for Many-Body Dynamics [15.435967947933404]
We propose a neural-network variational quantum algorithm to simulate the time evolution of quantum many-body systems.
The proposed algorithm can be efficiently implemented in near-term quantum computers with low measurement cost.
arXiv Detail & Related papers (2020-08-31T02:54:09Z)
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.