Related papers: The Dynamics of 1D Quantum Spin Systems Can Be App…
We develop a non-perturbative approach to simulating scattering on classical and quantum computers, in which the initial and final states contain a fixed number of composite particles. The construction is designed to mimic a particle…
We study the evolution of one-dimensional quantum lattice systems when the ground state is perturbed by altering one site in the middle of the chain. For a large class of models, we observe a similar pattern of entanglement growth during…
Quantum computing has attracted considerable attention in recent years because it promises speed-ups that conventional supercomputers cannot offer, at least for some applications. Though existing quantum computers are, in most cases, still…
We present a numerical method to simulate the time evolution, according to a Hamiltonian made of local interactions, of quantum spin chains and systems alike. The efficiency of the scheme depends on the amount of the entanglement involved…
We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the…
We determine approximate numerical integrals of motion of 2D symmetric Hamiltonian systems. We detail for a few gravitational potentials the conditions under which quasi-integrals are obtained as polynomial series. We show that each of…
We utilize generalized unitarity and recursion relations combined with effective field theory(EFT) techniques to compute spin dependent interaction terms for inspiralling binary systems in the post newtonian(PN) approximation. Using these…
The study of real-time evolution of lattice quantum field theories using classical computers is known to scale exponentially with the number of lattice sites. Due to a fundamentally different computational strategy, quantum computers hold…
Classical information loading is an essential task for many processing quantum algorithms, constituting a cornerstone in the field of quantum machine learning. In particular, the embedding techniques based on Hamiltonian simulation…
The spectrum of excited states observed in the finite volume of lattice QCD is governed by the discrete symmetries of the cubic group. This finite group permits the mixing of orbital angular momentum quanta in the finite volume. As…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…
Efficiently estimating energy expectation values of quantum lattice systems on quantum computers is a crucial subroutine for various quantum algorithms, which can lead to significant overhead due to the high measurement shot numbers…
The Schwinger model, which describes lattice quantum electrodynamics in $1+1$ space-time dimensions, provides a valuable framework to investigate fundamental aspects of quantum field theory, and a stepping stone towards non-Abelian gauge…
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of…
We analyze some crucial questions regarding the practical feasibility of quantum simulation for lattice gauge models. Our analysis focuses on two models suitable for the quantum simulation of the Schwinger Hamiltonian, or QED in 1+1…
We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce two new methods to achieve this, the first method involving…
We consider the variation of von Neumann entropy of subsystem reduced states of general many- body lattice spin systems due to local quantum quenches. We obtain Lieb-Robinson-like bounds that are independent of the subsystem volume. The…
We show that adiabatic evolution of a low-dimensional lattice of quantum spins with a spectral gap can be simulated efficiently. In particular, we show that as long as the spectral gap \Delta E between the ground state and the first excited…
We present a suite of "holographic" quantum algorithms for efficient ground-state preparation and dynamical evolution of correlated spin-systems, which require far-fewer qubits than the number of spins being simulated. The algorithms…
Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is…