Hardware-efficient variational quantum algorithms for time evolution
- URL: http://arxiv.org/abs/2009.12361v5
- Date: Tue, 27 Jul 2021 12:10:50 GMT
- Title: Hardware-efficient variational quantum algorithms for time evolution
- Authors: Marcello Benedetti, Mattia Fiorentini, Michael Lubasch
- Abstract summary: We present alternatives to the time-dependent variational principle that are hardware-efficient and do not require matrix inversion.
In relation to imaginary time evolution, our approach significantly reduces the hardware requirements.
We numerically analyze the performance of our algorithms using quantum Hamiltonians with local interactions.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Parameterized quantum circuits are a promising technology for achieving a
quantum advantage. An important application is the variational simulation of
time evolution of quantum systems. To make the most of quantum hardware,
variational algorithms need to be as hardware-efficient as possible. Here we
present alternatives to the time-dependent variational principle that are
hardware-efficient and do not require matrix inversion. In relation to
imaginary time evolution, our approach significantly reduces the hardware
requirements. With regards to real time evolution, where high precision can be
important, we present algorithms of systematically increasing accuracy and
hardware requirements. We numerically analyze the performance of our algorithms
using quantum Hamiltonians with local interactions.
Related papers
- Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Enhancing variational quantum state diagonalization using reinforcement
learning techniques [1.583327010995414]
We tackle the problem of designing a very shallow quantum circuit, required in the quantum state diagonalization task.
We use a novel encoding method for the RL-state, a dense reward function, and an $epsilon$-greedy policy to achieve this.
We demonstrate that the circuits proposed by the reinforcement learning methods are shallower than the standard variational quantum state diagonalization algorithm.
arXiv Detail & Related papers (2023-06-19T17:59:04Z) - Stochastic Approximation of Variational Quantum Imaginary Time Evolution [0.716879432974126]
In quantum computers, the imaginary-time evolution of quantum states is integral to various fields.
Here, we suggest a approach to variational quantum imaginary-time evolution, which allows a significant reduction in runtimes.
We demonstrate the efficiency of our algorithm in simulations and show a hardware experiment performing the imaginary-time evolution of the transverse field Ising model on 27 qubits.
arXiv Detail & Related papers (2023-05-11T18:00:06Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Making Trotterization adaptive and energy-self-correcting for NISQ
devices and beyond [0.0]
Simulation of continuous time evolution requires time discretization on both classical and quantum computers.
We introduce a quantum algorithm to solve this problem, providing a controlled solution of the quantum many-body dynamics of local observables.
Our algorithm can be potentially useful on a more general level whenever time discretization is involved concerning, for instance, also numerical approaches based on time-evolving block decimation methods.
arXiv Detail & Related papers (2022-09-26T12:54:32Z) - 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) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - Real- and imaginary-time evolution with compressed quantum circuits [0.5089078998562184]
We show that quantum circuits can provide a dramatically more efficient representation than current classical numerics.
For quantum circuits, we perform both real- and imaginary-time evolution using an optimization algorithm that is feasible on near-term quantum computers.
arXiv Detail & Related papers (2020-08-24T11:16:43Z)
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.