Related papers: Measurement-Based Time Evolution for Quantum Simul…
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…
We develop several algorithms for performing quantum phase estimation based on basic measurements and classical post-processing. We present a pedagogical review of quantum phase estimation and simulate the algorithm to numerically determine…
We present an efficient method for estimating the eigenvalues of a Hamiltonian $H$ from the expectation values of the evolution operator for various times. For a given quantum state $\rho$, our method outputs a list of eigenvalue estimates…
Hybrid quantum-classical optimization algorithms represent one of the most promising application for near-term quantum computers. In these algorithms the goal is to optimize an observable quantity with respect to some classical parameters,…
Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing…
In this work we demonstrate the use of adapted classical phase retrieval algorithms to perform control-free quantum phase estimation. We eliminate the costly controlled time evolution and Hadamard test commonly required to access the…
Quantum simulations of many-body systems are among the most promising applications of quantum computers. In particular, models based on strongly-correlated fermions are central to our understanding of quantum chemistry and materials…
Accurately determining ground-state properties of quantum many-body systems remains one of the major challenges of quantum simulation. In this work, we present a protocol for estimating the ground-state energy using only global time…
Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting…
The use of quantum computing to solve a problem in quantum mechanics is illustrated, step by step, by calculating energies and transition amplitudes in a nonrelativistic quark model. The quantum computations feature the use of variational…
Simulating the properties of many-body fermionic systems is an outstanding computational challenge relevant to material science, quantum chemistry, and particle physics. Although qubit-based quantum computers can potentially tackle this…
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…
In this paper, we present a proof-of-concept quantum algorithm for simulating time-dependent Hamiltonian evolution by reducing the problem to simulating a time-independent Hamiltonian in a larger space using a discrete clock Hamiltonian…
The real- and imaginary-time evolution of quantum states are powerful tools in physics, chemistry, and beyond, to investigate quantum dynamics, prepare ground states or calculate thermodynamic observables. On near-term devices, variational…
Variational quantum circuits have arisen as an important method in quantum computing. A crucial step of it is parameter optimization, which is typically tackled through gradient-descent techniques. We advantageously explore instead the use…
The rapid development of reliable Quantum Processing Units (QPU) opens up novel computational opportunities for machine learning. Here, we introduce a procedure for measuring the similarity between graph-structured data, based on the…
We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that…
Simulating the dynamics and the non-equilibrium steady state of an open quantum system are hard computational tasks on conventional computers. For the simulation of the time evolution, several efficient quantum algorithms have recently been…
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…
Fermionic quantum processors are a promising platform for quantum simulation of correlated fermionic matter. In this work, we study a hardware-efficient protocol for measuring complex expectation values of the time-evolution operator,…