Related papers: Locality and digital quantum simulation of power-l…
We provide a simulation algorithm that properly addresses light matter interaction between non-relativistic first-quantized charged particles and quantum electromagnetic fields. Unlike previous work, our Hamiltonian does not include an…
We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a Hamiltonian $H$. This is a central problem in physics with vast applications in many-body systems and…
We show that, assuming that quantum mechanics holds locally, the finite speed of information is the principle that limits all possible correlations between distant parties to be quantum mechanical as well. Local quantum mechanics means that…
Microscopic speed limits that constrain the motion of matter, energy, and information abound in physics, from the "ultimate" speed limit set by light to Lieb-Robinson speed limits in quantum spin systems. In addition to these…
The conflict between Quantum Mechanics (QM) and the intuitive concepts of Locality and Realism (LR) is manifest in the correlation between measurements performed in remote regions of a spatially spread entangled state. In this paper, it is…
We introduce "local uncertainty relations" in thermal many body systems. Using these relations, we derive basic bounds. These results include the demonstration of universal non-relativistic speed limits (regardless of interaction range),…
We derive a nonperturbative bound on the distance between evolutions of open quantum systems described by time-dependent generators. We show how this result can be employed to provide an explicit upper bound on the error of the…
We derive Margolus-Levitin and Mandelstamm-Tamm type bound on the quantum speed limit time for the creation and decay of quantum correlations by an amount in a quantum system evolving under the influence of its ambient environment. The…
We consider simulating an $n$-qubit Hamiltonian with nearest-neighbor interactions evolving for time $t$ on a quantum computer. We show that this simulation has gate complexity $(nt)^{1+o(1)}$ using product formulas, a straightforward…
We consider translation invariant gapped quantum spin systems satisfying the Lieb-Robinson bound and containing single-particle states in a ground state representation. Following the Haag-Ruelle approach from relativistic quantum field…
Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint…
One of the most fundamental problems in quantum many-body physics is the characterization of correlations among thermal states. Of particular relevance is the thermal area law, which justifies the tensor network approximations to thermal…
We investigate the fundamental time complexity, as constrained by Lieb-Robinson bounds, for preparing entangled states useful in quantum metrology. We relate the minimum time to the Quantum Fisher Information ($F_Q$) for a system of $N$…
In recent investigations, it has been found that conservation laws generally lead to precision limits on quantum computing. Lower bounds of the error probability have been obtained for various logic operations from the commutation relation…
Quantum theory sets a bound on the minimal time evolution between initial and target states. This bound is called as quantum speed limit time. It is used to quantify maximal speed of quantum evolution. The quantum evolution will be faster,…
The Fokker-Planck equation models rare events across sciences, but its high-dimensional nature challenges classical computers. Quantum algorithms for such non-unitary dynamics often suffer from exponential {decay in} success probability. We…
We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. Assuming access to a block-encoding of $H'=(H-E)/\lambda$ for some $E \in \mathbb R$, the goal is to implement an…
We generalize to multi-commutators the usual Lieb-Robinson bounds for commutators. In the spirit of constructive QFT, this is done so as to allow the use of combinatorics of minimally connected graphs (tree expansions) in order to estimate…
Quantum algorithms have been proposed to accelerate the simulation of the chaotic dynamical systems that are ubiquitous in the physics of plasmas. Quantum computers without error correction might even use noise to their advantage to…
Information shared between parties quantifies their correlation. The encoding of correlations across space and time characterises the structure, history, and interactions of systems. One of the most fundamental properties that emerges from…