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

Hamiltonian operator approximation for energy measurement and ground state preparation

TA Bespalova (21925472), Oleksandr Kyriienko

Published Aug 1, 2025• 35 citations
OpenAlex

Abstract

The Hamiltonian operator plays a central role in quantum theory being a generator of unitary quantum dynamics. Its expectation value describes the energy of a quantum system. Typically being a non-unitary operator, the action of the Hamiltonian is either encoded using complex ancilla-based circuits, or implemented effectively as a sum of Pauli string terms. Here, we show how to approximate the Hamiltonian operator as a sum propagators using a differential representation. The proposed approach, named Hamiltonian operator approximation (HOA), is highly suitable for analog quantum simulators, where one has direct access to simulation of quantum dynamics, but measuring separate circuits is not possible. We describe how to use this strategy in the hybrid quantum-classical workflow, and perform energy measurements. Benchmarking the measurement scheme, we discuss the relevance of the discretization step size, stencil order, number of measurements, and noise. We also use HOA to prepare ground states of complex material science models with direct iteration and quantum filter diagonalization, finding the lowest energy for the 12-qubit Hamiltonian of hydrogen chain H$_6$ with $10^{-5}$ Hartree precision using $11$ time-evolved reference states. We find that for Heisenberg model of increasing system size of twelve and more spins our approach outperforms variational methods, both in terms of the gate depth and the number of measurements.

Related papers

Hamiltonian Operator Approximation for Energy Measurement and Ground-State Preparation

Tatiana A. Bespalova, Oleksandr Kyriienko

A strategy is devised to approximate the Hamiltonian operator in ways that benefit analog quantum simulators, potentially outperforming variational methods in terms of gate depth and a total number of measurements.

arXiv:2009.03351•PRX Quantum•Aug 2, 2021•28 citations

State Specific Measurement Protocols for the Variational Quantum Eigensolver

Davide Bincoletto, Jakob S. Kottmann

A central roadblock in the realization of variational quantum eigensolvers on quantum hardware is the high overhead associated with measurement repetitions, which hampers the computation of complex problems, such as the simulation of mid- and large-sized molecules. In this work, we propose a novel measurement protocol which relies on computing an approximation of the Hamiltonian expectation value. The method involves measuring cheap grouped operators directly and estimating the residual elements through iterative measurements of new grouped operators in different bases, with the process being truncated at a certain stage. The measured elements comprehend the operators defined by the Hard-Core Bosonic approximation, which encode electron-pair annihilation and creation operators. These can be easily decomposed into three self-commuting groups which can be measured simultaneously. Applied to molecular systems, the method achieves a reduction of 30% to 80% in the number of measurement and gates depth in the measuring circuits compared to state-of-the-art methods. This provides a scalable and cheap measurement protocol, advancing the application of variational approaches for simulating physical systems.

arXiv:2504.03019•Apr 3, 2025•0 citations

Quantum inverse iteration algorithm for programmable quantum simulators

Oleksandr Kyriienko

Abstract We propose a quantum inverse iteration algorithm, which can be used to estimate ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the Hamiltonian inverse to an initial state prepares the approximate ground state. To apply the inverse Hamiltonian operation, we write it as a sum of unitary evolution operators using the Fourier approximation approach. This allows to reformulate the protocol as separate measurements for the overlap of initial and propagated wavefunction. The algorithm thus crucially depends on the ability to run Hamiltonian dynamics with an available quantum device, and can be used for analog quantum simulators. We benchmark the performance using paradigmatic examples of quantum chemistry, corresponding to molecular hydrogen and beryllium hydride. Finally, we show its use for studying the ground state properties of relevant material science models, which can be simulated with existing devices, considering an example of the Bose-Hubbard atomic simulator.

arXiv:1901.09988•npj Quantum Information•Jan 17, 2020•56 citations

Quantum inverse iteration algorithm for programmable quantum simulators

Oleksandr Kyriienko

We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the Hamiltonian inverse to an initial state prepares an approximate groundstate. To apply the inverse Hamiltonian operation, we write it as a sum of unitary evolution operators using the Fourier approximation approach. This allows to reformulate the protocol as separate measurements for the overlap of initial and propagated wavefunction. The algorithm thus crucially depends on the ability to run Hamiltonian dynamics with an available quantum device. We benchmark the performance using paradigmatic examples of quantum chemistry, corresponding to molecular hydrogen and beryllium hydride. Finally, we show its use for studying the ground state properties of relevant material science models which can be simulated with existing devices, considering an example of the Bose-Hubbard atomic simulator.

•Aug 1, 2025•23 citations

Hamiltonian Encoding for Quantum Approximate Time Evolution of Kinetic Energy Operator

Mostafizur Rahaman Laskar, Kalyan Dasgputa, Amit Kumar Dutta +1 more

The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers and holds immense promise for advancing the fields of physical and computer sciences, with applications spanning quantum simulation and machine learning. However, the construction of large-scale quantum computers poses significant challenges, prompting the need for innovative and resource-efficient strategies. Traditional methods like phase estimation or variational algorithms come with certain limitations such as the use of classical optimization or complex quantum circuitry. One successful method is the Trotterization technique used for quantum simulation, specifically in atomic structure problems with a gate complexity of approximately O(n^2) for an n-qubit realization. In this work, we have proposed a new encoding method, namely quantum approximate time evolution (QATE) for the quantum implementation of the kinetic energy operator as a diagonal unitary operator considering the first quantization level. The theoretical foundations of our approach are discussed, and experimental results are obtained on an IBM quantum machine. Our proposed method offers gate complexity in sub-quadratic polynomial with qubit size $n$ which is an improvement over previous work. Further, the fidelity improvement for the time evolution of the Gaussian wave packet has also been demonstrated.

arXiv:2310.03319•Oct 5, 2023•1 citation

Quantum Algorithm for Spectral Measurement with a Lower Gate Count

David Poulin, Alexei Kitaev, Damian S. Steiger +2 more

We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground state of some Hamiltonian, it is not necessary to implement the time-evolution operator: any unitary operator which is a function of the Hamiltonian will do. We propose one such unitary operator which can be implemented exactly, circumventing any Taylor or Trotter approximation errors. The second technique is tailored to lattice models, and is targeted at reducing the use of generic single-qubit rotations, which are very expensive to produce by standard fault tolerant techniques. In particular, the number of generic single-qubit rotations used by our method scales with the number of parameters in the Hamiltonian, which contrasts with a growth proportional to the lattice size required by other techniques.

arXiv:1711.11025•Physical Review Letters•Jul 5, 2018•108 citations
The Hamiltonian operator plays a central role in quantum theory being a generator of unitary quantum dynamics. Its expectation value describes the energy of a quantum system. Typically being a non-unitary operator, the action of the Hamiltonian is either encoded using complex ancilla-based circuits, or implemented effectively as a sum of Pauli string terms. Here, we show how to approximate the Hamiltonian operator as a sum propagators using a differential representation. The proposed approach, named Hamiltonian operator approximation (HOA), is highly suitable for analog quantum simulators, where one has direct access to simulation of quantum dynamics, but measuring separate circuits is not possible. We describe how to use this strategy in the hybrid quantum-classical workflow, and perform energy measurements. Benchmarking the measurement scheme, we discuss the relevance of the discretization step size, stencil order, number of measurements, and noise. We also use HOA to prepare ground states of complex material science models with direct iteration and quantum filter diagonalization, finding the lowest energy for the 12-qubit Hamiltonian of hydrogen chain H6_66​ with 10−510^{-5}10−5 Hartree precision using 111111 time-evolved reference states. We find that for Heisenberg model of increasing system size of twelve and more spins our approach outperforms variational methods, both in terms of the gate depth and the number of measurements.
A central roadblock in the realization of variational quantum eigensolvers on quantum hardware is the high overhead associated with measurement repetitions, which hampers the computation of complex problems, such as the simulation of mid- and large-sized molecules. In this work, we propose a novel measurement protocol which relies on computing an approximation of the Hamiltonian expectation value. The method involves measuring cheap grouped operators directly and estimating the residual elements through iterative measurements of new grouped operators in different bases, with the process being truncated at a certain stage. The measured elements comprehend the operators defined by the Hard-Core Bosonic approximation, which encode electron-pair annihilation and creation operators. These can be easily decomposed into three self-commuting groups which can be measured simultaneously. Applied to molecular systems, the method achieves a reduction of 30% to 80% in the number of measurement and gates depth in the measuring circuits compared to state-of-the-art methods. This provides a scalable and cheap measurement protocol, advancing the application of variational approaches for simulating physical systems.
Abstract We propose a quantum inverse iteration algorithm, which can be used to estimate ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the Hamiltonian inverse to an initial state prepares the approximate ground state. To apply the inverse Hamiltonian operation, we write it as a sum of unitary evolution operators using the Fourier approximation approach. This allows to reformulate the protocol as separate measurements for the overlap of initial and propagated wavefunction. The algorithm thus crucially depends on the ability to run Hamiltonian dynamics with an available quantum device, and can be used for analog quantum simulators. We benchmark the performance using paradigmatic examples of quantum chemistry, corresponding to molecular hydrogen and beryllium hydride. Finally, we show its use for studying the ground state properties of relevant material science models, which can be simulated with existing devices, considering an example of the Bose-Hubbard atomic simulator.
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the Hamiltonian inverse to an initial state prepares an approximate groundstate. To apply the inverse Hamiltonian operation, we write it as a sum of unitary evolution operators using the Fourier approximation approach. This allows to reformulate the protocol as separate measurements for the overlap of initial and propagated wavefunction. The algorithm thus crucially depends on the ability to run Hamiltonian dynamics with an available quantum device. We benchmark the performance using paradigmatic examples of quantum chemistry, corresponding to molecular hydrogen and beryllium hydride. Finally, we show its use for studying the ground state properties of relevant material science models which can be simulated with existing devices, considering an example of the Bose-Hubbard atomic simulator.
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers and holds immense promise for advancing the fields of physical and computer sciences, with applications spanning quantum simulation and machine learning. However, the construction of large-scale quantum computers poses significant challenges, prompting the need for innovative and resource-efficient strategies. Traditional methods like phase estimation or variational algorithms come with certain limitations such as the use of classical optimization or complex quantum circuitry. One successful method is the Trotterization technique used for quantum simulation, specifically in atomic structure problems with a gate complexity of approximately O(n^2) for an n-qubit realization. In this work, we have proposed a new encoding method, namely quantum approximate time evolution (QATE) for the quantum implementation of the kinetic energy operator as a diagonal unitary operator considering the first quantization level. The theoretical foundations of our approach are discussed, and experimental results are obtained on an IBM quantum machine. Our proposed method offers gate complexity in sub-quadratic polynomial with qubit size nnn which is an improvement over previous work. Further, the fidelity improvement for the time evolution of the Gaussian wave packet has also been demonstrated.
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground state of some Hamiltonian, it is not necessary to implement the time-evolution operator: any unitary operator which is a function of the Hamiltonian will do. We propose one such unitary operator which can be implemented exactly, circumventing any Taylor or Trotter approximation errors. The second technique is tailored to lattice models, and is targeted at reducing the use of generic single-qubit rotations, which are very expensive to produce by standard fault tolerant techniques. In particular, the number of generic single-qubit rotations used by our method scales with the number of parameters in the Hamiltonian, which contrasts with a growth proportional to the lattice size required by other techniques.