Related papers: A Probabilistic Imaginary Time Evolution Algorithm…
We time-evolve a translationally invariant quantum state on the Quantinuum H1-1 trapped-ion quantum processor, studying the dynamical quantum phase transition of the transverse field Ising model. This physics requires a delicate…
The computational complexity of simulating quantum many-body systems generally scales exponentially with the number of particles. This enormous computational cost prohibits first principles simulations of many important problems throughout…
The Fokker-Planck equation models rare events across sciences, but its high-dimensional nature challenges classical computers. Quantum algorithms for such non-unitary dynamics often suffer from exponential {decay in} success probability. We…
We use digital quantum computing to simulate the creation of particles in a dynamic spacetime. We consider a system consisting of a minimally coupled massive quantum scalar field in a spacetime undergoing homogeneous and isotropic…
Variational compression can significantly lower implementation overheads for encoding the time evolution of Hamiltonians into quantum circuits. However, they usually lack global convergence guarantees and well-established scaling behavior.…
We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. Assuming access to a block-encoding of $H'=(H-E)/\lambda$ for some $E \in \mathbb R$, the goal is to implement an…
Non-Hermitian quantum systems exhibit unique properties and hold significant promise for diverse applications, yet their dynamical simulation poses a particular challenge due to intrinsic openness and non-unitary evolution. Here, we…
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers and holds immense promise for advancing the fields of physical and computer sciences, with applications spanning…
We present an efficient method to prepare states of a many-body system on quantum hardware, first isolating individual quantum numbers and then using time evolution to isolate the energy. Our method in its simplest form requires only one…
Hamiltonian diagonalization is at the heart of understanding physical properties and practical applications of quantum systems. It is highly desired to design quantum algorithms that can speedup Hamiltonian diagonalization, especially those…
The simulation of quantum systems is a task for which quantum computers are believed to give an exponential speedup as compared to classical ones. While ground states of one-dimensional systems can be efficiently approximated using Matrix…
Analog quantum simulation is emerging as a powerful tool for uncovering classically unreachable physics such as many-body real-time dynamics. A complete quantification of uncertainties is necessary in order to make precise predictions using…
The capacity for solving eigenstates with a quantum computer is key for ultimately simulating physical systems. Here we propose inverse iteration quantum eigensolvers, which exploit the power of quantum computing for the classical inverse…
We develop circuit implementations for digital-level quantum Hamiltonian dynamics simulation algorithms suitable for implementation on a reconfigurable quantum computer, such as trapped ions. Our focus is on the co-design of a problem, its…
The simulation of time evolution of large quantum systems is a classically challenging and in general intractable task, making it a promising application for quantum computation. A Trotter-Suzuki approximation yields an implementation…
Nonlinear spectroscopy is a cornerstone of quantum science, providing unique access to multi-point correlations, quantum coherence, and couplings that are invisible to linear methods. However, classical simulation of these phenomena is…
We use local adiabatic evolution to experimentally create and determine the ground state spin ordering of a fully-connected Ising model with up to 14 spins. Local adiabatic evolution -- in which the system evolution rate is a function of…
In this work we present a detailed analysis of variational quantum phase estimation (VQPE), a method based on real-time evolution for ground and excited state estimation on near-term hardware. We derive the theoretical ground on which the…
The quantum imaginary time evolution (QITE) algorithm is a direct implementation of the classical imaginary time evolution algorithm on quantum computer. We implement the QITE algorithm for the case of nuclear Hartree-Fock equations in a…
We apply a hybrid evolutionary algorithm to minimize the depth of circuits in quantum computing. More specifically, we evaluate two different variants of the algorithm. In the first approach, we combine the evolutionary algorithm with an…