Fast-forwarding quantum evolution

• URL: http://arxiv.org/abs/2105.07304v2
• Date: Sat, 6 Nov 2021 18:33:14 GMT
• Title: Fast-forwarding quantum evolution
• Authors: Shouzhen Gu, Rolando D. Somma, Burak \c{S}ahino\u{g}lu
• Abstract summary: We show that 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.
• Score: 0.2621730497733946
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Quantum ergodicity and scrambling in quantum annealers [0.0]
  We show that the unitary evolution operator describing the complete dynamics of quantum annealers is typically highly quantum chaotic. We observe that the Heisenberg dynamics of a quantum annealer leads to extensive operator spreading, a hallmark of quantum information scrambling.
  arXiv  Detail & Related papers  (2024-11-19T16:34:35Z)
• Simulating Quantum Many-Body States with Neural-Network Exponential Ansatz [0.0]
  We develop a surrogate neural network solver that generates the exponential ansatz parameters using the Hamiltonian parameters as inputs. We illustrate the effectiveness of this approach by training neural networks of several quantum many-body systems.
  arXiv  Detail & Related papers  (2024-11-12T15:48:23Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Qubits on programmable geometries with a trapped-ion quantum processor [2.0295982805787776]
  We develop a class of high-dimensional Ising interactions using a linear one-dimensional (1D) ion chain with up to 8 qubits through stroboscopic sequences of commuting Hamiltonians. We extend this method to non-commuting circuits and demonstrate the quantum XY and Heisenberg models using Floquet periodic drives with tunable symmetries.
  arXiv  Detail & Related papers  (2023-08-20T07:01:57Z)
• Verifying quantum information scrambling dynamics in a fully controllable superconducting quantum simulator [0.0]
  We study the verified scrambling in a 1D spin chain by an analogue superconducting quantum simulator with the signs and values of individual driving and coupling terms fully controllable. Our work demonstrates the superconducting system as a powerful quantum simulator.
  arXiv  Detail & Related papers  (2021-12-21T13:41:47Z)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.