Corpus ID: 235254469

Trotter product formulae for $*$-automorphisms of quantum lattice systems

@inproceedings{Bachmann2021TrotterPF,
  title={Trotter product formulae for \$*\$-automorphisms of quantum lattice systems},
  author={Sven Bachmann and Markus Lange},
  year={2021}
}
We consider the dynamics t 7→ τt of an infinite quantum lattice system that is generated by a local interaction. If the interaction decomposes into a finite number of terms that are themselves local interactions, we show that τt can be efficiently approximated by a product of n automorphisms, each of them being an alternating product generated by the individual terms. For any integer m, we construct a product formula (in the spirit of Trotter) such that the approximation error scales as n−m. We… Expand
1 Citations

Figures from this paper

Classification of gapped ground state phases in quantum spin systems
Recently, classification problems of gapped ground state phases attract a lot of attention in quantum statistical mechanics. We explain about our operator algebraic approach to these problems.

References

SHOWING 1-10 OF 30 REFERENCES
Local factorisation of the dynamics of quantum spin systems
Motivated by the study of area laws for the entanglement entropy of gapped ground states of quantum spin systems and their stability, we prove that the unitary cocycle generated by a localExpand
A Product Formula Related to Quantum Zeno Dynamics
Abstract.We prove a product formula which involves the unitary group generated by a semibounded self-adjoint operator and an orthogonal projection P on a separable Hilbert space $\mathcal{H},$ withExpand
Quasi-locality bounds for quantum lattice systems. I. Lieb-Robinson bounds, quasi-local maps, and spectral flow automorphisms
Lieb-Robinson bounds show that the speed of propagation of information under the Heisenberg dynamics in a wide class of nonrelativistic quantum lattice systems is essentially bounded. We review worksExpand
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H.Expand
Index Theory of One Dimensional Quantum Walks and Cellular Automata
If a one-dimensional quantum lattice system is subject to one step of a reversible discrete-time dynamics, it is intuitive that as much “quantum information” as moves into any given block of cellsExpand
Adiabatic currents for interacting fermions on a lattice
We prove an adiabatic theorem for general densities of observables that are sums of local terms in finite systems of interacting fermions, without periodicity assumptions on the Hamiltonian and withExpand
A converse to Lieb-Robinson bounds in one dimension using index theory
Unitary dynamics with a strict causal cone (or "light cone") have been studied extensively, under the name of quantum cellular automata (QCAs). In particular, QCAs in one dimension have beenExpand
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
TLDR
This paper studies the problem of simulating the time evolution of a lattice Hamiltonian, and proves a matching lower bound on the gate count of such a simulation, showing that any quantum algorithm that can simulate a piecewise constant bounded local Hamiltonian in one dimension to constant error requires (nT) gates in the worst case. Expand
Simulating Quantum Dynamics On A Quantum Computer
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constantExpand
The finite group velocity of quantum spin systems
AbstractIt is shown that if Φ is a finite range interaction of a quantum spin system,τtΦ the associated group of time translations, τx the group of space translations, andA, B local observables, thenExpand
...
1
2
3
...