Real- and imaginary-time evolution with compressed quantum circuits
- URL: http://arxiv.org/abs/2008.10322v2
- Date: Fri, 11 Sep 2020 13:46:35 GMT
- Title: Real- and imaginary-time evolution with compressed quantum circuits
- Authors: Sheng-Hsuan Lin, Rohit Dilip, Andrew G. Green, Adam Smith, and Frank
Pollmann
- Abstract summary: 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.
- Score: 0.5089078998562184
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The current generation of noisy intermediate scale quantum computers
introduces new opportunities to study quantum many-body systems. In this paper,
we show that quantum circuits can provide a dramatically more efficient
representation than current classical numerics of the quantum states generated
under non-equilibrium quantum dynamics. For quantum circuits, we perform both
real- and imaginary-time evolution using an optimization algorithm that is
feasible on near-term quantum computers. We benchmark the algorithms by finding
the ground state and simulating a global quench of the transverse field Ising
model with a longitudinal field on a classical computer. Furthermore, we
implement (classically optimized) gates on a quantum processing unit and
demonstrate that our algorithm effectively captures real time evolution.
Related papers
- Simulation of open quantum systems on universal quantum computers [15.876768787615179]
We present an innovative and scalable method to simulate open quantum systems using quantum computers.
We define an adjoint density matrix as a counterpart of the true density matrix, which reduces to a mixed-unitary quantum channel.
accurate long-time simulation can also be achieved as the adjoint density matrix and the true dissipated one converges to the same state.
arXiv Detail & Related papers (2024-05-31T09:07:27Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Combining Matrix Product States and Noisy Quantum Computers for Quantum
Simulation [0.0]
Matrix Product States (MPS) and Operators (MPO) have been proven to be a powerful tool to study quantum many-body systems.
We show that using classical knowledge in the form of tensor networks provides a way to better use limited quantum resources.
arXiv Detail & Related papers (2023-05-30T17:21:52Z) - 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) - Low-rank tensor decompositions of quantum circuits [14.531461873576449]
We show how MPOs can be used to express certain quantum states, quantum gates, and entire quantum circuits as low-rank tensors.
This enables the analysis and simulation of complex quantum circuits on classical computers.
arXiv Detail & Related papers (2022-05-19T22:09:15Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - 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) - Exploiting dynamic quantum circuits in a quantum algorithm with
superconducting qubits [0.207811670193148]
We build dynamic quantum circuits on a superconducting-based quantum system.
We exploit one of the most fundamental quantum algorithms, quantum phase estimation, in its adaptive version.
We demonstrate that the version of real-time quantum computing with dynamic circuits can offer a substantial and tangible advantage.
arXiv Detail & Related papers (2021-02-02T18:51:23Z) - Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor.
We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
arXiv Detail & Related papers (2021-01-21T22:18:49Z)
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.