Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2202.01539 · The Journal of Chemical Physics

Electronic energies from coupled fermionic “Zombie” states' imaginary time evolution

Oliver Bramley, Timothy J. H. Hele, Dmitrii V. Shalashilin

Published Apr 18, 2022• 3 citations
arXivHTMLPDF

Abstract

Zombie states are a recently introduced formalism to describe coupled coherent fermionic states that address the fermionic sign problem in a computationally tractable manner. Previously, it has been shown that Zombie states with fractional occupations of spin orbitals obeyed the correct fermionic creation and annihilation algebra and presented results for real-time evolution [D. V. Shalashilin, J. Chem. Phys. 148, 194109 (2018)]. In this work, we extend and build on this formalism by developing efficient algorithms for evaluating the Hamiltonian and other operators between Zombie states and address their normalization. We also show how imaginary time propagation can be used to find the ground state of a system. We also present a biasing method, for setting up a basis set of random Zombie states, that allows much smaller basis sizes to be used while still accurately describing the electronic structure Hamiltonian and its ground state and describe a technique of wave function "cleaning" that removes the contributions of configurations with the wrong number of electrons, improving the accuracy further. We also show how low-lying excited states can be calculated efficiently using a Gram-Schmidt orthogonalization procedure. The proposed algorithm of imaginary time propagation on biased random grids of Zombie states may present an alternative to the existing quantum Monte Carlo methods.

DOI
10.1063/5.0086058

Related papers

Alternative approach to quantum imaginary time evolution

Pejman Jouzdani, Calvin W. Johnson, Eduardo R. Mucciolo +1 more

There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of $n$, the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in $n$. Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. We illustrate our algorithm through numerical implementation on an IBM quantum simulator.

arXiv:2208.10535•Physical Review A•Dec 26, 2022•23 citations

Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer

Michael Kaicher, Simon B Jäger, Frank K. Wilhelm

Abstract We present explicit expressions for the central piece of a variational method developed by Shi et al (2018 Ann. Phys. 390 245) which extends variational wave functions that are efficiently computable on classical computers beyond mean-field to generalized Gaussian states. In particular, we derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and annihilation operators in a Grassmann variable-free representation. Using this result we find a closed expression for the energy functional and its gradient of a general fermionic quantum many-body Hamiltonian. We present a simple gradient-descent-based algorithm that can be used as an optimization subroutine in combination with imaginary time evolution, which by construction guarantees a monotonic decrease of the energy in each iteration step. Due to the simplicity of the quantum circuit implementing the variational state ansatz, the results of the algorithms discussed here and in Shi et al ’s work could serve as an improved, beyond mean-field initial state in quantum computation.

arXiv:2105.13047•Journal of Physics A Mathematical and Theoretical•Aug 19, 2021•3 citations

Grid-based diffusion Monte Carlo for fermions without the fixed-node approximation

Alexander A. Kunitsa, So Hirata

A diffusion Monte Carlo algorithm is introduced that can determine the correct nodal structure of the wave function of a few-fermion system and its ground-state energy without an uncontrolled bias. This is achieved by confining signed random walkers to the points of a uniform infinite spatial grid, allowing them to meet and annihilate one another to establish the nodal structure without the fixed-node approximation. An imaginary-time propagator is derived rigorously from a discretized Hamiltonian, governing a non-Gaussian, sign-flipping, branching, and mutually annihilating random walk of particles. The accuracy of the resulting stochastic representations of a fermion wave function is limited only by the grid and imaginary-time resolutions and can be improved in a controlled manner. The method is tested for a series of model problems including fermions in a harmonic trap as well as the He atom in its singlet or triplet ground state. For the latter case, the energies approach from above with increasing grid resolution and converge within 0.015E_{h} of the exact basis-set-limit value for the grid spacing of 0.08 a.u. with a statistical uncertainty of 10^{-5}E_{h} without an importance sampling or Jastrow factor.

arXiv:1811.03000•Physical review. E•Jan 27, 2020•12 citations

Generating approximate ground states of strongly correlated quantum many-body systems through quantum imaginary time evolution

Michael Kaicher, Florian Dommert, Christopher Wever +3 more

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.

arXiv:2409.01320•Journal of Physics Communications•Jun 23, 2025•0 citations

Auxiliary Field Monte-Carlo for Quantum Many-Body Systems

Gayle A. Sugiyama

An algorithm is developed for determining the exact ground state properties of quantum many-body systems which is equally applicable to bosons and fermions. The Schroedinger eigenvalue equation for the ground state energy is recast into the form of a many-dimensional integral through the use of the Hubbard-Stratonovitch representation of the imaginary time many- body evolution operator. The resulting functional integral is then evaluated stochastically. The algorithm is tested for an exactly soluble boson system and is then extended to include fermions and repulsive potentials. Importance sampling is crucial to the success of the method, particularly for more complex systems. Improved computational efficiency is attained by performing the calculations in momentum space.

•Jan 7, 2019•0 citations

Discovering Hamiltonian spectra with variational quantum imaginary time simulation

Suguru Endo, Tyson Jones, Sam McArdle +2 more

Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state energy of molecules on near-term quantum computers. However, calculating excited state energies has attracted comparatively less attention, and it is currently unclear what the optimal method is. We introduce a low depth, variational quantum algorithm to sequentially calculate the excited states of general Hamiltonians. Incorporating a recently proposed technique, we employ the low depth swap test to energetically penalise the ground state, and transform excited states into ground states of modified Hamiltonians. We use variational imaginary time evolution as a subroutine, which deterministically propagates towards the target eigenstate. We discuss how symmetry measurements can mitigate errors in the swap test step. We numerically test our algorithm on Hamiltonians which encode 3SAT optimisation problems of up to 18 qubits, and the electronic structure of the Lithium Hydride molecule. As our algorithm uses only low depth circuits and variational algorithms, it is suitable for use on near-term quantum hardware.

•Jun 14, 2018•1 citation
Zombie states are a recently introduced formalism to describe coupled coherent fermionic states that address the fermionic sign problem in a computationally tractable manner. Previously, it has been shown that Zombie states with fractional occupations of spin orbitals obeyed the correct fermionic creation and annihilation algebra and presented results for real-time evolution [D. V. Shalashilin, J. Chem. Phys. 148, 194109 (2018)]. In this work, we extend and build on this formalism by developing efficient algorithms for evaluating the Hamiltonian and other operators between Zombie states and address their normalization. We also show how imaginary time propagation can be used to find the ground state of a system. We also present a biasing method, for setting up a basis set of random Zombie states, that allows much smaller basis sizes to be used while still accurately describing the electronic structure Hamiltonian and its ground state and describe a technique of wave function "cleaning" that removes the contributions of configurations with the wrong number of electrons, improving the accuracy further. We also show how low-lying excited states can be calculated efficiently using a Gram-Schmidt orthogonalization procedure. The proposed algorithm of imaginary time propagation on biased random grids of Zombie states may present an alternative to the existing quantum Monte Carlo methods.
There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of nnn, the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in nnn. Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. We illustrate our algorithm through numerical implementation on an IBM quantum simulator.
Abstract We present explicit expressions for the central piece of a variational method developed by Shi et al (2018 Ann. Phys. 390 245) which extends variational wave functions that are efficiently computable on classical computers beyond mean-field to generalized Gaussian states. In particular, we derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and annihilation operators in a Grassmann variable-free representation. Using this result we find a closed expression for the energy functional and its gradient of a general fermionic quantum many-body Hamiltonian. We present a simple gradient-descent-based algorithm that can be used as an optimization subroutine in combination with imaginary time evolution, which by construction guarantees a monotonic decrease of the energy in each iteration step. Due to the simplicity of the quantum circuit implementing the variational state ansatz, the results of the algorithms discussed here and in Shi et al ’s work could serve as an improved, beyond mean-field initial state in quantum computation.
A diffusion Monte Carlo algorithm is introduced that can determine the correct nodal structure of the wave function of a few-fermion system and its ground-state energy without an uncontrolled bias. This is achieved by confining signed random walkers to the points of a uniform infinite spatial grid, allowing them to meet and annihilate one another to establish the nodal structure without the fixed-node approximation. An imaginary-time propagator is derived rigorously from a discretized Hamiltonian, governing a non-Gaussian, sign-flipping, branching, and mutually annihilating random walk of particles. The accuracy of the resulting stochastic representations of a fermion wave function is limited only by the grid and imaginary-time resolutions and can be improved in a controlled manner. The method is tested for a series of model problems including fermions in a harmonic trap as well as the He atom in its singlet or triplet ground state. For the latter case, the energies approach from above with increasing grid resolution and converge within 0.015E_{h} of the exact basis-set-limit value for the grid spacing of 0.08 a.u. with a statistical uncertainty of 10^{-5}E_{h} without an importance sampling or Jastrow factor.
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.
An algorithm is developed for determining the exact ground state properties of quantum many-body systems which is equally applicable to bosons and fermions. The Schroedinger eigenvalue equation for the ground state energy is recast into the form of a many-dimensional integral through the use of the Hubbard-Stratonovitch representation of the imaginary time many- body evolution operator. The resulting functional integral is then evaluated stochastically. The algorithm is tested for an exactly soluble boson system and is then extended to include fermions and repulsive potentials. Importance sampling is crucial to the success of the method, particularly for more complex systems. Improved computational efficiency is attained by performing the calculations in momentum space.
Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing algorithms to calculate the ground state energy of molecules on near-term quantum computers. However, calculating excited state energies has attracted comparatively less attention, and it is currently unclear what the optimal method is. We introduce a low depth, variational quantum algorithm to sequentially calculate the excited states of general Hamiltonians. Incorporating a recently proposed technique, we employ the low depth swap test to energetically penalise the ground state, and transform excited states into ground states of modified Hamiltonians. We use variational imaginary time evolution as a subroutine, which deterministically propagates towards the target eigenstate. We discuss how symmetry measurements can mitigate errors in the swap test step. We numerically test our algorithm on Hamiltonians which encode 3SAT optimisation problems of up to 18 qubits, and the electronic structure of the Lithium Hydride molecule. As our algorithm uses only low depth circuits and variational algorithms, it is suitable for use on near-term quantum hardware.