Related papers: Quantum eigenvalue estimation via time series anal…
There is widespread interest in calculating the energy spectrum of a Hamiltonian, for example to analyze optical spectra and energy deposition by ions in materials. In this study, we propose a quantum algorithm that samples the set of…
Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers. Its main computational overhead derives from the Hamiltonian simulation…
We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $[E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by…
Quantum phase estimation provides a path to quantum computation of solutions to Hermitian eigenvalue problems $Hv = \lambda v$, such as those occurring in quantum chemistry. It is natural to ask whether the same technique can be applied to…
Quantum phase estimation plays a central role in quantum simulation as it enables the study of spectral properties of many-body quantum systems. Most variants of the phase estimation algorithm require the application of the global unitary…
We present a quantum algorithm to estimate parameters at the quantum metrology limit using deterministic quantum computation with one bit. When the interactions occurring in a quantum system are described by a Hamiltonian $H= \theta H_0$,…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
The preparation of Hamiltonian eigenstates is essential for many applications in quantum computing; the efficiency with which this can be done is of key interest. A canonical approach exploits the quantum phase estimation (QPE) algorithm.…
Estimating the overlap between an approximate wavefunction and a target eigenstate of the system Hamiltonian is essential for the efficiency of quantum phase estimation. In this work, we derive upper and lower bounds on this overlap using…
Approximating ground and a fixed number of excited state energies, or equivalently low order Hamiltonian eigenvalues, is an important but computationally hard problem. Typically, the cost of classical deterministic algorithms grows…
We propose a quantum algorithm for solving the following problem: given the Hamiltonian of a physical system and one of its eigenvalues, how to obtain the corresponding eigenstate? The algorithm is based on the resonance phenomena. For a…
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…
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…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
Eigenvalue estimation is a central problem for demonstrating quantum advantage, yet its implementation on digital quantum computers remains limited by circuit depth and operational overhead. We present an analog quantum phase estimation…
Accurate computation of multiple eigenvalues of quantum Hamiltonians is essential in quantum chemistry, materials science, and molecular spectroscopy. Estimating excited-state energies is challenging for classical algorithms due to…
The phase estimation algorithm is so named because it allows the estimation of the eigenvalues associated with an operator. However it has been proposed that the algorithm can also be used to generate eigenstates. Here we extend this…
We propose a new method for simulating certain type of time-dependent Hamiltonian $H(t) = \sum_{i=1}^m \gamma_i(t) H_i$ where $\gamma_i(t)$ (and its higher order derivatives) is bounded, computable function of time $t$, and each $H_i$ is…
The time evolution of a closed quantum system is connected to its Hamiltonian through Schroedinger's equation. The ability to estimate the Hamiltonian is critical to our understanding of quantum systems, and allows optimization of control.…
It has been shown that, starting from the state |0>, in the general case, an arbitrary quantum state |\psi> cannot be prepared with exponential precision in polynomial time. However, we show that for the important special case when |\psi>…