Related papers: Imaginary Time Propagation on a Quantum Chip
Many promising quantum applications depend on the efficient quantum simulation of an exponentially large sparse Hamiltonian, a task known as sparse Hamiltonian simulation, which is fundamentally important in quantum computation. Although…
We show that the time evolution of the wave function of a quantum mechanical many particle system can be implemented very efficiently on a quantum computer. The computational cost of such a simulation is comparable to the cost of a…
We extend the Pauli Propagation framework to simulate imaginary-time evolution. By deriving explicit update rules for the propagation of Pauli operators under imaginary-time evolution generated by Pauli strings, we introduce an…
Quantum confinement is studied by numerically solving time-dependent Schr\"odinger equation. An imaginary-time evolution technique is employed in conjunction with the minimization of an expectation value, to reach the global minimum.…
We propose a novel method to sequentially optimize arbitrary single-qubit gates in parameterized quantum circuits for simulating real and imaginary time evolution. The method utilizes full degrees of freedom of single-qubit gates and…
In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here we present quantum algorithms for…
Resolving quantum many-body problems represents one of the greatest challenges in physics and physical chemistry, due to the prohibitively large computational resources that would be required by using classical computers. A solution has…
Quantum phase estimation (QPE) plays a pivotal role in many quantum algorithms, offering provable speedups in applications such as Shor's factoring algorithm. While fault-tolerant quantum algorithms for combinatorial and Hamiltonian…
We show that current noisy quantum computers are ideal platforms for the simulation of quantum many-body dynamics in generic open systems. We demonstrate this using the IBM Quantum Computer as an experimental platform for confirming the…
The eigenvalue-function pair of the 3D Schr\"odinger equation can be efficiently computed by use of high order, imaginary time propagators. Due to the diffusion character of the kinetic energy operator in imaginary time, algorithms…
We propose a variational quantum algorithm to study the real time dynamics of quantum systems as a ground-state problem. The method is based on the original proposal of Feynman and Kitaev to encode time into a register of auxiliary qubits.…
We identify quantum imaginary time evolution as a Riemannian gradient flow on the unitary group. We develop an upper bound for the error between the two evolutions that can be controlled through the step size of the Riemannian gradient…
We develop a new analytical method for solving real time evolution problems of quantum many-body systems. Our approach is a direct generalization of the well-known canonical perturbation theory for classical systems. Similar to canonical…
We show that quantum nondemolition (QND) measurements can be used to realize measurement-based imaginary time evolution. In our proposed scheme, repeated weak QND measurements are used to estimate the energy of a given Hamiltonian. Based on…
The variational quantum imaginary time evolution (VarQITE) algorithm is a near-term method to prepare the ground state and Gibbs state of Hamiltonians. Finding an appropriate parameterization of the quantum circuit is crucial to the success…
This effort examines the intersection of the emerging field of quantum computing and the more established field of evolutionary computation. The goal is to understand what benefits quantum computing might offer to computational intelligence…
The rapid development in hardware for quantum computing and simulation has led to much interest in problems where these devices can exceed the capabilities of existing classical computers and known methods. Approaching this for problems…
This paper describes a novel approach to emulate a universal quantum computer with a wholly classical system, one that uses a signal of bounded duration and amplitude to represent an arbitrary quantum state. The signal may be of any…
Approximate combinatorial optimization is a promising use case for quantum computers. The quantum optimization algorithms often employ a fixed ansatz that evolves an unbiased initial state towards states with better values of the optimand,…
Simulating differential equations on classical computers becomes an intractable problem if the grid size is extremely large. Quantum computers are believed to achieve a possibly exponential speedup in the matrix operation. In this paper, we…