Imaginary time evolution of a quantum system through analytic continuation from real-time quantum simulation

• URL: http://arxiv.org/abs/2608.19943v2
• Date: Fri, 21 Aug 2026 17:52:48 GMT
• Title: Imaginary time evolution of a quantum system through analytic continuation from real-time quantum simulation
• Abstract summary: We present an algorithm to obtain ITE of a generic quantum Hamiltonian by performing analytic continuation of measured real-time correlation functions.<n>We present simulations and demonstrations on IBM quantum hardware of 1D Fokker-Planck equations for classical diffusion process and imaginary-time evolution of integrated correlation functions in 1D quantum mechanical scattering.
• Score: 9.057428395961264
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Though quantum computing naturally offers an advantage for simulations of real-time quantum systems, implementing Imaginary-Time Evolution (ITE) is comparatively more difficult. Nevertheless, quantum implementations of ITE are useful both in cases where classical implementations have associated sign problems, and also as an exact method of preparing eigenstates on quantum computers. In this work we present an algorithm to obtain ITE of a generic quantum Hamiltonian by performing analytic continuation of measured real-time correlation functions. We present simulations and demonstrations on IBM quantum hardware of 1D Fokker-Planck equations for classical diffusion process and imaginary-time evolution of integrated correlation functions in 1D quantum mechanical scattering as examples to demonstrate the effectiveness of the method.

Related papers

• Quantum Imaginary Time Evolution on an Infinite 1D Chain [0.0]
  We introduce a quantum-circuit algorithm for performing imaginary-time evolution on infinite one-dimensional lattice systems.<n>We derive the ITE algorithm using the time-dependent variational principle and employ the quantum Lanczos algorithm to improve the ground-state energy estimate.
  arXiv  Detail & Related papers  (2026-08-31T07:20:47Z)
• Learnable yet not simulable: a quantum resource theory of learning models [57.695822250391906]
  It remains unclear which quantum resource governs the classical learnability of quantum circuits.<n>We study the expectation-value functions of families of tunable quantum circuits.<n>These results establish a quantitative resource-theoretic framework for delineating the boundary between classical simulation and learning.
  arXiv  Detail & Related papers  (2026-08-03T14:48:03Z)
• Scattering phase shift in quantum mechanics on quantum computers: non-Hermitian systems and imaginary-time simulations [9.057428395961264]
  We demonstrate two solutions to the problem of non-unitary quantum evolution.<n>One is to simulate Hermitian systems in imaginary time, the other is to simulate non-Hermitian systems in real time.<n>The results bode well for using non-Hermitian and imaginary-time simulations to circumvent oscillations inherent in real-time simulation of other quantum systems.
  arXiv  Detail & Related papers  (2026-03-31T18:31:53Z)
• Quantum Simulation of Dynamical Transition Rates in Open Quantum Systems [0.0]
  We present a quantum-simulation framework that enables efficient estimation of transition rates in open quantum systems.<n>We validate our method on a spin-1/2 decoherence model using an IBM quantum processor.
  arXiv  Detail & Related papers  (2024-12-23T02:53:05Z)
• Classical Algorithms for Hamiltonian Dynamics Mean Value and Guided Local Hamiltonian Problem [9.550310003133555]
  We introduce an efficient classical algorithm for simulating the short-time dynamics of arbitrary local quantum systems.<n>We also present a tailored quantum algorithm that efficiently solves the guided local Hamiltonian (GLH) problem to constant additive error.
  arXiv  Detail & Related papers  (2024-09-06T09:59:12Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Simulation of open quantum systems on universal quantum computers [15.876768787615179]
  We present an innovative and scalable method to simulate open quantum systems using quantum computers.<n>We define an adjoint density matrix as a counterpart of the true density matrix, which reduces to a mixed-unitary quantum channel.<n>Some long-time properties like steady states and the thermal equilibrium can also be investigated as the adjoint density matrix.
  arXiv  Detail & Related papers  (2024-05-31T09:07:27Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• 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)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• 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)
• A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex [0.0]
  We develop a quantum algorithm to simulate any dynamical process represented by either the operator sum representation or the Lindblad master equation. We demonstrate the quantum algorithm by simulating the dynamics of the Fenna-Matthews-Olson complex on the IBM QASM quantum simulator.
  arXiv  Detail & Related papers  (2021-01-13T19:00:02Z)
• Real- and imaginary-time evolution with compressed quantum circuits [0.5089078998562184]
  We show that quantum circuits can provide a dramatically more efficient representation than current classical numerics. For quantum circuits, we perform both real- and imaginary-time evolution using an optimization algorithm that is feasible on near-term quantum computers.
  arXiv  Detail & Related papers  (2020-08-24T11:16:43Z)

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.