Imaginary Time Propagation on a Quantum Chip
- URL: http://arxiv.org/abs/2102.12260v4
- Date: Fri, 12 Nov 2021 13:18:05 GMT
- Title: Imaginary Time Propagation on a Quantum Chip
- Authors: Francesco Turro, Alessandro Roggero, Valentina Amitrano, Piero Luchi,
Kyle A. Wendt, Jonathan L DuBois, Sofia Quaglioni and Francesco Pederiva
- Abstract summary: 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.
- Score: 50.591267188664666
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Evolution in imaginary time is a prominent technique for finding the ground
state of quantum many-body systems, and the heart of a number of numerical
methods that have been used with great success in quantum chemistry, condensed
matter and nuclear physics. We propose an algorithm to implement imaginary time
propagation on a quantum computer. Our algorithm is devised in the context of
an efficient encoding into an optimized gate, drawing on the underlying
characteristics of the quantum device, of a unitary operation in an extended
Hilbert space. However, we proved that for simple problems it can be
successfully applied to standard digital quantum machines. This work paves the
way for porting quantum many-body methods based on imaginary-time propagation
to near-term quantum devices, enabling the future quantum simulation of the
ground states of a broad class of microscopic systems.
Related papers
- Dynamic Runtime Assertions in Quantum Ternary Systems [1.5410557873153832]
We investigate assertions in quantum ternary systems, which are more challenging than those in quantum binary systems.
We propose quantum ternary circuit designs to assert classical, entanglement, and superposition states.
arXiv Detail & Related papers (2023-12-23T17:46:51Z) - 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) - Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems.
Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
arXiv Detail & Related papers (2021-08-30T23:50:05Z) - 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) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - 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) - Reinforcement Learning for Digital Quantum Simulation [0.0]
We introduce a reinforcement learning algorithm to build optimized quantum circuits for digital quantum simulation.
We consistently obtain quantum circuits that reproduce physical observables with as little as three entangling gates for long times and large system sizes.
arXiv Detail & Related papers (2020-06-29T18:00: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.