Related papers: Quantum algorithm for imaginary-time Green's funct…
We calculate the multipoint Green functions in 1+1 dimensional integrable quantum field theories. We use the crossing formula for general models and calculate the 3 and 4 point functions taking in to account only the lower nontrivial…
Simulation of quantum matters is a significant application of quantum computers. In contrast to the unitary operation which can be realized naturally on a quantum computer, the implementation of nonunitary operation, widely used in…
We introduce the Green's functions technique as an alternative theory to the quantum regression theorem formalism for calculating the two-time correlation functions in open quantum systems. In particular, we investigate the potential of…
Basing on the relation between the Coulomb Green function and the Green function of harmonic oscillator, the algebraic representation of the many-particle Coulomb Green function in the form of annihilation and creation operators is…
Time-dependent quantum mechanics provides an intuitive picture of particle propagation in external fields. Semiclassical methods link the classical trajectories of particles with their quantum mechanical propagation. Many analytical results…
Nuclear magnetic resonance techniques are used to realize a quantum algorithm experimentally. The algorithm allows a simple NMR quantum computer to determine global properties of an unknown function requiring fewer function ``calls'' than…
Within the imaginary-time theory for nonequilibrium in quantum dot systems the calculation of dynamical quantities like Green's functions is possible via a suitable quantum Monte-Carlo algorithm. The challenging task is to analytically…
We show that Green function methods can be straightforwardly applied to nonlinear equations appearing as the leading order of a short time expansion. Higher order corrections can be then computed giving a satisfactory agreement with…
Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant…
We study the expansion of single-particle and two-particle imaginary-time Matsubara Green's functions of quantum impurity models in the basis of Legendre orthogonal polynomials. We discuss various applications within the dynamical…
The real-time contour formalism for Green's functions provides time-dependent information of quantum many-body systems. In practice, the long-time simulation of systems with a wide range of energy scales is challenging due to both the…
Many applications of Green's functions (GFs) require their evaluation over intervals or at multiple points, motivating quantum algorithms that return an efficiently computable functional representation rather than mere point estimates. We…
Estimating the ground-state energy of Hamiltonians is a fundamental task for which it is believed that quantum computers can be helpful. Several approaches have been proposed toward this goal, including algorithms based on quantum phase…
Using quantum algorithms to simulate complex physical processes and correlations in quantum matter has been a major direction of quantum computing research, towards the promise of a quantum advantage over classical approaches. In this work…
In the past decade quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests…
Imaginary-time evolution is fundamental for analyzing quantum many-body systems, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size…
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…
In the effort to develop useful quantum computers simulating quantum machines with conventional computing resources is a key capability. Such simulations will always face limits preventing the emulation of quantum computers of substantial…
The accurate computation of Hamiltonian ground, excited, and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation to machine learning. Given the challenges posed…
We provide an example of a quantum system which solves a numerical problem more efficiently than a classical computer. The example uses the Aharonov-Bohm effect, and can be integrated into standard quantum mechanics courses. The aim is to…