Fast-forwarding quantum evolution

Abstract

We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states. Our definition accounts for any asymptotic complexity improvement of the general case and we use it to demonstrate fast-forwarding in several quantum systems. In particular, we show that some local spin systems whose Hamiltonians can be taken into block diagonal form using an efficient quantum circuit, such as those that are permutation-invariant, can be exponentially fast-forwarded. We also show that certain classes of positive semidefinite local spin systems, also known as frustration-free, can be polynomially fast-forwarded, provided the initial state is supported on a subspace of sufficiently low energies. Last, we show that all quadratic fermionic systems and number-conserving quadratic bosonic systems can be exponentially fast-forwarded in a model where quantum gates are exponentials of specific fermionic or bosonic operators, respectively. Our results extend the classes of physical Hamiltonians that were previously known to be fast-forwarded, while not necessarily requiring methods that diagonalize the Hamiltonians efficiently. We further develop a connection between fast-forwarding and precise energy measurements that also accounts for polynomial improvements.

26 + 5 pages, 14 figures, accepted in Quantum

References in corpus (6)

• Quantum algorithm for solving linear systems of equations
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Optimal Quantum Measurements of Expectation Values of Observables
• Quantum circuits for strongly correlated quantum systems
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Cited by in corpus (12)

• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• Provably accurate simulation of gauge theories and bosonic systems
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution
• Efficient classical algorithms for simulating symmetric quantum systems
• On the complexity of implementing Trotter steps
• Numerical Evidence for Exponential Speed-up of QAOA over Unstructured Search for Approximate Constrained Optimization
• Importance sampling for stochastic quantum simulations
• What the foundations of quantum computer science teach us about chemistry
• Quantum differential equation solvers: limitations and fast-forwarding
• Parallel Quantum Algorithm for Hamiltonian Simulation
• Faster spectral density calculation using energy moments