Generating Approximate Ground States of Strongly Correlated Quantum Many-Body Systems Through Quantum Imaginary Time Evolution

• URL: http://arxiv.org/abs/2409.01320v1
• Date: Mon, 2 Sep 2024 15:20:41 GMT
• Title: Generating Approximate Ground States of Strongly Correlated Quantum Many-Body Systems Through Quantum Imaginary Time Evolution
• Authors: Michael P. Kaicher, Florian Dommert, Christopher Wever, Maximilian Amsler, Michael Kühn,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a ground state is Imaginary Time Evolution (ITE). Recent work by [Motta, M., Sun, C., Tan, A.T.K. et al. (2020)] introduced an algorithm -- which we will refer to as Quantum Imaginary Time Evolution (QITE) -- that shows how ITE can be approximated by a sequence of unitary operators, making QITE potentially implementable on early fault-tolerant quantum computers. In this work, we provide a heuristic study of the capabilities of the QITE algorithm in approximating the ITE of lattice and molecular electronic structure Hamiltonians. We numerically study the performance of the QITE algorithm when provided with a good classical initial state for a large class of systems, some of which are of interest to industrial applications, and check if QITE is able to qualitatively replicate the ITE behavior and improve over a classical mean-field solution. The systems we consider in this work range from one- and two-dimensional lattice systems of various lattice geometries displaying short- and long-range interactions, to active spaces of molecular electronic structure Hamiltonians. In addition to the comparison of QITE and ITE, we explicitly show how imaginary time evolved fermionic Gaussian states can serve as initial states which can be efficiently computed on classical computers and efficiently implemented on quantum computers for generic spin Hamiltonians in arbitrary lattice geometries and dimensions, which can be of independent interest.

Related papers

• 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)
• Quantum simulation of excited states from parallel contracted quantum eigensolvers [5.915403570478968]
  We show that a ground-state contracted quantum eigensolver can be generalized to compute any number of quantum eigenstates simultaneously. We introduce two excited-state CQEs that perform the excited-state calculation while inheriting many of the remarkable features of the original ground-state version of the algorithm.
  arXiv  Detail & Related papers  (2023-11-08T23:52:31Z)
• 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)
• Classical Algorithm for the Mean Value problem over Short-Time Hamiltonian Evolutions [0.0]
  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.
  arXiv  Detail & Related papers  (2023-01-26T21:19:19Z)
• A Probabilistic Imaginary Time Evolution Algorithm Based on Non-unitary Quantum Circuit [13.1638355883302]
  We propose a probabilistic algorithm for implementing imaginary time evolution based on non-unitary quantum circuit. We demonstrate the feasibility of this method by solving the ground state energy of several quantum many-body systems.
  arXiv  Detail & Related papers  (2022-10-11T09:43:30Z)
• 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)
• Computing molecular excited states on a D-Wave quantum annealer [52.5289706853773]
  We demonstrate the use of a D-Wave quantum annealer for the calculation of excited electronic states of molecular systems. These simulations play an important role in a number of areas, such as photovoltaics, semiconductor technology and nanoscience.
  arXiv  Detail & Related papers  (2021-07-01T01:02:17Z)
• 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)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• A variational quantum algorithm for Hamiltonian diagonalization [5.207748672230163]
  We propose a variational algorithm for Hamiltonians diagonalization (VQHD) of quantum systems. The thermal states of the system encode the information of eigenvalues and eigenstates of the system Hamiltonian. Our VQHD algorithm sheds new light on the applications of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-08-22T15:20: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.