Related papers: Solving coupled Non-linear Schr\"{o}dinger Equatio…
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…
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 reveal the power of Grover's algorithm from thermodynamic and geometric perspectives by showing that it is a product formula approximation of imaginary-time evolution (ITE), a Riemannian gradient flow on the special unitary group. This…
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.…
Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. As a kind of it, the probabilistic ITE (PITE) takes advantage of measurements to implement the nonunitary…
Starting from a time-dependent Schr\"odinger equation, stationary states of 3D central potentials are obtained. An imaginary-time evolution technique coupled with the minimization of energy expectation value, subject to the orthogonality…
Several methods exist for finding ground (as well as excited) states of nonlinear waves equations. In this paper we first introduce two modifications of the so-called accelerated imaginary-time evolution method (AITEM). In our first…
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…
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 present a code for solving the single-particle, time-independent Schr\"odinger equation in two dimensions. Our program utilizes the imaginary time propagation (ITP) algorithm, and it includes the most recent developments in the ITP…
We examine the recently proposed imaginary-time formulation for strongly correlated steady-state nonequilibrium for its range of validity and discuss significant improvements in the analytic continuation of the Matsubara voltage as well as…
A new numerical treatment in the Crank-Nicholson method with the imaginary time evolution operator is presented in order to solve the Schr\"{o}dinger equation. The original time evolution technique is extended to a new operator that…
We introduce a method to solve the MaxCut problem efficiently based on quantum imaginary time evolution (QITE). We employ a linear Ansatz for unitary updates and an initial state involving no entanglement, as well as an…
We propose a general algebraic analytic scheme for the spectral transform of solutions of nonlinear evolution equations. This allows us to give the general integrable evolution corresponding to an arbitrary time and space dependence of the…
Various methods have been developed for the quantum computation of the ground and excited states of physical and chemical systems, but many of them require either large numbers of ancilla qubits or high-dimensional optimization. The quantum…
This article deals with the numerical integration in time of nonlinear Schr\"odinger equations. The main application is the numerical simulation of rotating Bose-Einstein condensates. The authors perform a change of unknown so that the…
A novel class of high-order linearly implicit energy-preserving integrating factor Runge-Kutta methods are proposed for the nonlinear Schr\"odinger equation. Based on the idea of the scalar auxiliary variable approach, the original equation…
Developing scalable quantum algorithms to study finite-temperature physics of quantum many-body systems has attracted considerable interest due to recent advancements in quantum hardware. However, such algorithms in their present form…
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…
A fast implementation of the quantum imaginary time evolution (QITE) algorithm called Fast QITE is proposed. The algorithmic cost of QITE typically scales exponentially with the number of particles it nontrivially acts on in each Trotter…