Related papers: Optimisation of Thimble Simulations and Quantum Dy…
The fundamental question of how to best simulate quantum systems using conventional computational resources lies at the forefront of condensed matter and quantum computation. It impacts both our understanding of quantum materials and our…
We present the calculation of the Feynman path integral in real time for tunneling in quantum mechanics and field theory, including the first quantum corrections. For this purpose, we use the well-known fact that Euclidean saddle points in…
Conformal field theory, describing systems with scaling symmetry, plays a crucial role throughout physics. We describe a quantum algorithm to simulate the dynamics of conformal field theories, including the action of local conformal…
We conducted quantum simulations of strongly correlated systems using the quantum flow (QFlow) approach, which enables sampling large sub-spaces of the Hilbert space through coupled eigenvalue problems in reduced dimensionality active…
We extend the Worldline Monte Carlo approach to computationally simulating the Feynman path integral of non-relativistic multi-particle quantum-mechanical systems. We show how to generate an arbitrary number of worldlines distributed…
The numerically exact path integral Monte Carlo approach for the real-time evolution of dissipative quantum systems (PIMC), particularly suited for systems with discrete configuration space (tight-binding systems), is extended to treat…
The simulation of quantum dynamics on a digital quantum computer with parameterized circuits has widespread applications in fundamental and applied physics and chemistry. In this context, using the hybrid quantum-classical algorithm,…
Quantum computing has attracted significant interest in the optimization community because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing…
The reality and convexity of the effective potential in quantum field theories has been studied extensively in the context of Euclidean space-time. It has been shown that canonical and path-integral approaches may yield different results,…
Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial…
We describe quantum many--body systems in terms of projected entangled--pair states, which naturally extend matrix product states to two and more dimensions. We present an algorithm to determine correlation functions in an efficient way. We…
In recent years efficient algorithms have been developed for the numerical computation of relativistic single-particle path integrals in quantum field theory. Here, we adapt this "worldline Monte Carlo" approach to the standard problem of…
It is well known that quantum tunneling can be described by instantons in the imaginary-time path integral formalism. However, its description in the real-time path integral formalism has been elusive. Here we establish a statement that…
Geometry and dimensionality have played crucial roles in our understanding of the fundamental laws of nature, with examples ranging from curved space-time in general relativity to modern theories of quantum gravity. In quantum many-body…
Quantum annealing algorithms belong to the class of meta-heuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum processing units (QPUs) produced by D-Wave…
Quantifying multipartite entanglement in quantum many-body systems and hybrid quantum computing architectures is a fundamental yet challenging task. In recent years, thermodynamic quantities such as the maximum extractable work from an…
We demonstrate how quantum field theory problems can be embedded on quantum annealers. The general method we use is a discretisation of the field theory problem into a general Ising model, with the continuous field values being encoded into…
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…
Quantum signal processing provides an optimal procedure for simulating Hamiltonian evolution on a quantum computer using calls to a block encoding of the Hamiltonian. In many situations it is possible to control between forward and reverse…
We simulate the collective dynamics in spin lattices with long range interactions and collective decay in one, two and three dimensions. Starting from a dynamical mean-field approach derived by local factorization of the density operator we…