Related papers: Classical simulation of infinite-size quantum latt…
We consider quantum (unitary) continuous time evolution of spins on a lattice together with quantum evolution of the lattice itself. In physics such evolution was discussed in connection with quantum gravity. It is also related to what is…
Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work, we present a polynomially scaling hybrid…
Classical limits of quantum systems are shown to lead to different conceptions of spaces different from the classical one underlying the process of quantization of such systems. The accent is put in situations where traces of…
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…
This note shows how quantum entanglement may be simulated in classical computing. The simulated entanglement protocol is implemented using oblivious transfer in the simplest case and other many-to-one mappings in more general cases. For the…
We present a pedagogical introduction to a quantum computing algorithm for the simulation of classical fluids, based on the Carleman linearization of a second-quantized version of lattice kinetic theory. Prospects and limitations for the…
Quantum computing promises the possibility of studying the real-time dynamics of nonperturbative quantum field theories while avoiding the sign problem that obstructs conventional lattice approaches. Current and near-future quantum devices…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We survey the equations of continuous-time quantum walks on simple one-dimensional lattices, which include the finite and infinite lines and the finite cycle, and compare them with the classical continuous-time Markov chains. The focus of…
In these proceedings, we review recent advances in applying quantum computing to lattice field theory. Quantum computing offers the prospect to simulate lattice field theories in parameter regimes that are largely inaccessible with the…
Duality transformations are very important in both classical and quantum physics. They allow one to relate two seemingly different formulations of the same physical realm through clever mathematical manipulations, and offer numerous…
The classical approximation may be applied to a number of problems in non-equilibrium field theory. The principles and limits of classical real-time lattice simulations are presented, with particular emphasis on the definition of particle…
The quantum mechanical formalism for position and momentum of a particle in a one dimensional cyclic lattice is constructively developed. Some mathematical features characteristic of the finite dimensional Hilbert space are compared with…
Classical planar vertex models afford transfer matrices with real and positive entries, which makes this class of models suitable for quantum simulations. In this work, we support this statement by building explicit quantum circuits that…
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…
Quantum simulation provides quantum systems under study with analogous controllable quantum systems and has wide applications from condensed-matter physics to high energy physics and to cosmology. The quantum system of a homogeneous and…
We investigate a one dimensional quantum mechanical model, which is invariant under translations and dilations but does not respect the conventional conformal invariance. We describe the possibility of modifying the conventional conformal…
We study the evolution of an open quantum system using a Langevin unravelling of the density matrix evolution over matrix product states. As the strength of coupling to and temperature of the environment is increased, we find a transition…
In this paper we explore the practical use of the corner transfer matrix and its higher-dimensional generalization, the corner tensor, to develop tensor network algorithms for the classical simulation of quantum lattice systems of infinite…
Hybrid classical-quantum algorithms aim at variationally solving optimisation problems, using a feedback loop between a classical computer and a quantum co-processor, while benefitting from quantum resources. Here we present experiments…