Non-unitary Trotter circuits for imaginary time evolution

• URL: http://arxiv.org/abs/2304.07917v3
• Date: Sun, 29 Oct 2023 22:22:23 GMT
• Title: Non-unitary Trotter circuits for imaginary time evolution
• Authors: Chiara Leadbeater, Nathan Fitzpatrick, David Mu\~noz Ramo and Alex J. W. Thom
• Abstract summary: We propose an imaginary time equivalent of the well-established Pauli gadget primitive for Trotter-decomposed real time evolution. The scheme was tested on the transverse Ising model and the fermionic Hubbard model and is demonstrated to converge to the ground state of the system.
• Score: 0.0
• License: http://creativecommons.org/publicdomain/zero/1.0/
• Abstract: We propose an imaginary time equivalent of the well-established Pauli gadget primitive for Trotter-decomposed real time evolution, using mid-circuit measurements on a single ancilla qubit. Imaginary time evolution (ITE) is widely used for obtaining the ground state of a system on classical hardware, computing thermal averages, and as a component of quantum algorithms that perform non-unitary evolution. Near-term implementations on quantum hardware rely on heuristics, compromising their accuracy. As a result, there is growing interest in the development of more natively quantum algorithms. Since it is not possible to implement a non-unitary gate deterministically, we resort to the implementation of probabilistic imaginary time evolution (PITE) algorithms, which rely on a unitary quantum circuit to simulate a block encoding of the ITE operator - that is, they rely on successful ancillary measurements to evolve the system non-unitarily. Compared with previous PITE proposals, the suggested block encoding in this paper results in shorter circuits and is simpler to implement, requiring only a slight modification of the Pauli gadget primitive. This scheme was tested on the transverse Ising model and the fermionic Hubbard model and is demonstrated to converge to the ground state of the system.

Related papers

• Quantum Imaginary-Time Evolution with Polynomial Resources in Time [34.930625575436835]
  We present a quantum algorithm that prepares normalized imaginary-time states using an adaptive normalization factor to maintain stable success probability over large imaginary times.<n>Our algorithm approximates the target state to small errors in inverse imaginary time using elementaryly many quantum gates and a single ancilla qubit.<n> Numerical experiments validate our theoretical results for evolution time up to 50, demonstrating the algorithm's effectiveness for long-time evolution.
  arXiv  Detail & Related papers  (2025-07-01T16:11:47Z)
• Double-bracket quantum algorithms for quantum imaginary-time evolution [0.0]
  We prove that our Double-Bracket Quantum Imaginary-Time Evolution (DB-QITE) algorithm inherits the cooling guarantees of imaginary-time evolution. DB-QITE provides a means to systematically improve the approximation of a ground-state using shallow circuits.
  arXiv  Detail & Related papers  (2024-12-05T19:00:09Z)
• Adiabatic quantum imaginary time evolution [0.0]
  We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time evolution does not require quantum state tomography during its runtime.
  arXiv  Detail & Related papers  (2023-08-07T04:27:30Z)
• 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)
• Probabilistic imaginary-time evolution by using forward and backward real-time evolution with a single ancilla: first-quantized eigensolver of quantum chemistry for ground states [0.0]
  Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. We propose a new approach of PITE which requires only a single ancillary qubit. We discuss the application of our approach to quantum chemistry by focusing on the scaling of computational cost.
  arXiv  Detail & Related papers  (2021-11-24T12:54:27Z)
• Fragmented imaginary-time evolution for early-stage quantum signal processors [0.0]
  Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. Our main contribution is a new generation of deterministic, high-precision QITE algorithms. We present two QITE-circuit sub-routines with excellent complexity scaling.
  arXiv  Detail & Related papers  (2021-10-25T18:02:24Z)
• Error-resilient Monte Carlo quantum simulation of imaginary time [5.625946422295428]
  We propose an algorithm for simulating the imaginary-time evolution and solving the ground-state problem. Compared with quantum phase estimation, the Trotter step number can be thousands of times smaller. Results show that Monte Carlo quantum simulation is promising even without a fully fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2021-09-16T08:51:24Z)
• 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)
• 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)
• Evaluating low-depth quantum algorithms for time evolution on fermion-boson systems [0.0]
  Simulating time evolution of quantum systems is one of the most promising applications of quantum computing. We propose the Jaynes-Cummings model and extensions to it as useful toy models to investigate time evolution algorithms on near-term quantum computers.
  arXiv  Detail & Related papers  (2021-06-07T22:03:17Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• 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)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.