Quantum Imaginary Time Evolution on an Infinite 1D Chain

• URL: http://arxiv.org/abs/2608.30363v1
• Date: Mon, 31 Aug 2026 07:20:47 GMT
• Title: Quantum Imaginary Time Evolution on an Infinite 1D Chain
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a quantum-circuit algorithm for performing imaginary-time evolution on infinite one-dimensional lattice systems. The method uses a parameterized quantum circuit to represent a uniform matrix product state ansatz. We derive the ITE algorithm using the time-dependent variational principle and employ the quantum Lanczos algorithm to improve the ground-state energy estimate. As a benchmark, we simulate the transverse-field Ising model using both classical simulators and IBM Quantum devices. Our analysis includes a statistical study of the distributions of the cost function and energy density obtained from quantum measurements, illustrating the effects of finite-sampling noise on convergence.

Related papers

• Imaginary time evolution of a quantum system through analytic continuation from real-time quantum simulation [9.057428395961264]
  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.
  arXiv  Detail & Related papers  (2026-08-20T12:03:10Z)
• Digital Quantum Simulation of the Holstein-Primakoff Transformation on Noisy Qubits [40.8066152850216]
  We study the digital quantum simulation of bosonic modes on a cloud-based superconducting quantum processor.<n>We examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters.
  arXiv  Detail & Related papers  (2026-02-19T20:14:04Z)
• Basis Adaptive Algorithm for Quantum Many-Body Systems on Quantum Computers [2.4713653282916126]
  A new basis adaptive algorithm is introduced to efficiently find the ground-state properties of quantum many-body systems.<n>We benchmark this approach on the spin-1/2 XXZ chain up to 24 qubits using the IBM Heron processor.
  arXiv  Detail & Related papers  (2025-12-14T16:34:19Z)
• Quantum-assisted tracer dispersion in turbulent shear flow [0.0]
  We present a quantum-assisted generative algorithm for synthetic tracks of Lagrangian tracer particles in a turbulent shear flow.<n>The generation of the joint shear probability density function is also tested on a real quantum device, the 20-qubit IQM Resonance quantum computing platform for cases of up to 10 qubits.
  arXiv  Detail & Related papers  (2025-06-17T14:43:54Z)
• Scalable Quantum Algorithm for Meson Scattering in a Lattice Gauge Theory [0.0]
  We study meson scattering in a (1+1)-dimensional Z2 lattice gauge theory with staggered fermions.<n>We develop a quantum subspace expansion technique to construct high-fidelity meson creation operators.<n>We design an efficient quantum circuit for meson wave packet preparation using Givens rotations, significantly reducing the circuit depth compared to existing methods.
  arXiv  Detail & Related papers  (2025-05-27T14:19:53Z)
• Estimation of Quantum Fisher Information via Stein's Identity in Variational Quantum Algorithms [0.0]
  The Quantum Fisher Information Matrix (QFIM) plays a crucial role in quantum optimization algorithms.<n> computing the full QFIM incurs a quadratic computational cost of O(d2) with respect to the number of parameters d.<n>We propose an alternative estimation framework based on Stein's identity that also achieves constant computational complexity.
  arXiv  Detail & Related papers  (2025-02-24T15:10:36Z)
• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Time Evolution of Uniform Sequential Circuits [0.16385815610837165]
  We present a hybrid quantum-classical scaling algorithm for time evolving a one-dimensional uniform system in the thermodynamic limit. We show numerically that this anatzs requires a number of parameters in the simulation time for a given accuracy. All steps of the hybrid optimization are designed with near-term digital quantum computers in mind.
  arXiv  Detail & Related papers  (2022-10-07T18:00:01Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• 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)
• 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)
• 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)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)

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.