Classical Algorithm for the Mean Value problem over Short-Time Hamiltonian Evolutions

• URL: http://arxiv.org/abs/2301.11420v1
• Date: Thu, 26 Jan 2023 21:19:19 GMT
• Title: Classical Algorithm for the Mean Value problem over Short-Time Hamiltonian Evolutions
• Authors: Reyhaneh Aghaei Saem, Ali Hamed Moosavian
• Abstract summary: This article presents an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant periods of time. We use Lieb-Robinson type bounds to limit the evolution of local operators within a lightcone. This allows us to divide the task of simulating a large quantum system into smaller systems that can be handled on normal classical computers.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant periods of time. The algorithm presented here computes the mean value of an observable over the output state of such short-time Hamiltonian evolutions. In proving the performance of this algorithm we use Lieb-Robinson type bounds to limit the evolution of local operators within a lightcone. This allows us to divide the task of simulating a large quantum system into smaller systems that can be handled on normal classical computers.

Related papers

• 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)
• Generating Approximate Ground States of Strongly Correlated Quantum Many-Body Systems Through Quantum Imaginary Time Evolution [0.0]
  We numerically study the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians. We show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers.
  arXiv  Detail & Related papers  (2024-09-02T15:20:41Z)
• Parallel-in-time quantum simulation via Page and Wootters quantum time [0.0]
  We present quantum algorithms for parallel-in-time simulations inspired by the Page and Wooters formalism. We show that our algorithms can compute temporal properties over $N$ different times of many-body systems. We rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning.
  arXiv  Detail & Related papers  (2023-08-24T17:32:41Z)
• A quantum advantage over classical for local max cut [48.02822142773719]
  Quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs. Results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical.
  arXiv  Detail & Related papers  (2023-04-17T16:42:05Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Simulating Markovian open quantum systems using higher-order series expansion [1.713291434132985]
  We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. Our algorithm is conceptually cleaner, and it only uses simple quantum primitives without compressed encoding.
  arXiv  Detail & Related papers  (2022-12-05T06:02:50Z)
• Classical simulation of short-time quantum dynamics [0.0]
  We present classical algorithms for approximating the dynamics of local observables and nonlocal quantities. We establish a novel quantum speed limit, a bound on dynamical phase transitions, and a concentration bound for product states evolved for short times.
  arXiv  Detail & Related papers  (2022-10-20T18:00:04Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation [7.620967781722716]
  We present a variational quantum algorithm for solving the Poisson equation. The proposed method defines the total potential energy of the Poisson equation as a Hamiltonian. Because the number of terms is independent of the size of the problem, this method requires relatively few quantum measurements.
  arXiv  Detail & Related papers  (2021-06-17T09:01:53Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Fast and differentiable simulation of driven quantum systems [58.720142291102135]
  We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods. We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
  arXiv  Detail & Related papers  (2020-12-16T21:43:38Z)

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.