Related papers: State-Based Quantum Simulation of Imaginary-Time E…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
The imaginary-time evolution of quantum states is integral to various fields, ranging from natural sciences to classical optimization or machine learning. Since simulating quantum imaginary-time evolution generally requires storing an…
There is increasing interest in quantum algorithms that are based on the imaginary-time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy post-processing…
Imaginary-time evolution is fundamental for analyzing quantum many-body systems, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size…
Imaginary time evolution is a powerful tool for studying quantum systems. While it is possible to simulate with a classical computer, the time and memory requirements generally scale exponentially with the system size. Conversely, quantum…
Many computationally hard problems can be encoded in quantum Hamiltonians. The solution to these problems is given by the ground states of these Hamiltonians. A state-of-the-art algorithm for finding the ground state of a Hamiltonian is the…
Imaginary time evolution is a powerful tool applied in quantum physics, while existing classical algorithms for simulating imaginary time evolution suffer high computational complexity as the quantum systems become larger and more complex.…
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…
We delve into the use of photonic quantum computing to simulate quantum mechanics and extend its application towards quantum field theory. We develop and prove a method that leverages this form of Continuous-Variable Quantum Computing…
Excited states of many-body quantum systems play a key role in a wide range of physical and chemical phenomena. Unlike ground states, for which many efficient variational techniques exist, there are few ways to systematically construct…
Quantum computers have been widely speculated to offer significant advantages in obtaining the ground state of difficult Hamiltonian in chemistry and physics. In this work, we first propose a Lyapunov control-inspired strategy to accelerate…
Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for…
We introduce a constructive method for mapping non-unitary dynamics to a weighted set of unitary operations. We utilize this construction to derive a new correspondence between real and imaginary time, which we term Imaginary Time Quantum…
We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time…
The accurate computation of Hamiltonian ground, excited, and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation to machine learning. Given the challenges posed…
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…
Quantum Imaginary-Time Evolution (QITE) is a powerful method for preparing ground states on quantum hardware. However, executing QITE has costly measurement budgets for general Hamiltonians. Both fidelity and computational cost are strongly…
Imaginary-time evolution, an important technique in tensor network and quantum Monte Carlo algorithms on classical computers, has recently been adapted to quantum computing. In this study, we focus on probabilistic imaginary-time evolution…
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are…
Ground-state quantum computers mimic quantum mechanical time evolution within the amplitudes of a time-independent quantum state. We explore the principles that constrain this mimicking. A no-cloning argument is found to impose strong…