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:2309.16790

Low-depth Gaussian State Energy Estimation

Gumaro Rendon, Johnson, Peter D.

Published Sep 28, 2023• 6 citations
arXivHTMLPDF

Abstract

Recent progress in quantum computing is paving the way for the realization of early fault-tolerant quantum computers. To maximize the utility of these devices, it is important to develop quantum algorithms that match their capabilities and limitations. Motivated by this, recent work has developed low-depth quantum algorithms for ground state energy estimation (GSEE), an important subroutine in quantum chemistry and materials. We detail a new GSEE algorithm which, like recent work, uses a number of operations scaling as $O(1/Δ)$ as opposed to the typical $O(1/ε)$, at the cost of an increase in the number of circuit repetitions from $O(1)$ to $O(1/ε^2)$. The relevant features of this algorithm come about from using a Gaussian window, which exponentially reduces contamination from excited states over the simplest GSEE algorithm based on the Quantum Fourier Transform (QFT). We adapt this algorithm to interpolate between the low-depth and full-depth regime by replacing $Δ$ with anything between $Δ$ and $ε$. At the cost of increasing the number of ancilla qubits from $1$ to $O(\logΔ)$, our method reduces the upper bound on the number of circuit repetitions by a factor of four compared to previous methods.

DOI
10.48550/arxiv.2309.16790

Related papers

Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision

Guoming Wang, Daniel Stilck França, Ruizhe Zhang +2 more

A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will require some degree of fault tolerance. While hardware is improving towards this milestone, optimizing quantum algorithms also brings it closer to the present. Existing methods for ground state energy estimation are costly in that they require a number of gates per circuit that grows exponentially with the desired number of bits in precision. We reduce this cost exponentially, by developing a ground state energy estimation algorithm for which this cost grows linearly in the number of bits of precision. Relative to recent resource estimates of ground state energy estimation for the industrially-relevant molecules of ethylene-carbonate and PF 6 − , the estimated gate count and circuit depth is reduced by a factor of 43 and 78, respectively. Furthermore, the algorithm can use additional circuit depth to reduce the total runtime. These features make our algorithm a promising candidate for realizing quantum advantage in the era of early fault-tolerant quantum computing.

arXiv:2209.06811•Quantum•Nov 6, 2023•78 citations

Even Shorter Quantum Circuit for Phase Estimation on Early Fault-Tolerant Quantum Computers with Applications to Ground-State Energy Estimation

Zhiyan Ding, Lin Lin

We develop a phase-estimation method with a distinct feature: its maximal run time (which determines the circuit depth) is δ/ , where is the target precision, and the preconstant δ can be arbitrarily close to 0 as the initial state approaches the target eigenstate.The total cost of the algorithm satisfies the Heisenberg-limited scaling O( -1 ).As a result, our algorithm may significantly reduce the circuit depth for performing phase-estimation tasks on early fault-tolerant quantum computers.The key technique is a simple subroutine called quantum complex exponential least squares (QCELS).Our algorithm can be readily applied to reduce the circuit depth for estimating the ground-state energy of a quantum Hamiltonian, when the overlap between the initial state and the ground state is large.If this initial overlap is small, we can combine our method with the Fourier-filtering method developed in [Lin and Tong, PRX Quantum 3, 010318, 2022], and the resulting algorithm provably reduces the circuit depth in the presence of a large relative overlap compared to .The relative-overlap condition is similar to a spectral-gap assumption but it is aware of the information in the initial state and is therefore applicable to certain Hamiltonians with small spectral gaps.We observe that the circuit depth can be reduced by around 2 orders of magnitude in numerical experiments under various settings.

arXiv:2211.11973•PRX Quantum•May 26, 2023•102 citations

Efficient ground-state-energy estimation and certification on early fault-tolerant quantum computers

Guoming Wang, Daniel Stilck França, Gumaro Rendon +1 more

A major thrust in quantum algorithm development over the past decade has been the search for the quantum algorithms that will deliver practical quantum advantage first. Today's quantum computers---and even early fault-tolerant quantum computers---are limited in the number of operations they can implement per circuit. We introduce quantum algorithms for ground-state-energy estimation (GSEE) that accommodate this design constraint. The first algorithm estimates ground-state energies, offering a quadratic improvement on the ground-state overlap parameter compared to other methods in this regime. The second algorithm certifies that the estimated ground-state energy is within a specified error tolerance of the true ground-state energy, addressing the issue of gap estimation that beleaguers several ground-state preparation and energy estimation algorithms. We note, however, that the scaling of this certification technique is currently less favorable than that of the GSEE algorithm. To develop the certification algorithm, we propose an alternative use of quantum computers to facilitate rejection sampling. After a classical computer generates initial samples, the quantum computer is used to accept or reject these samples, resulting in a set of accepted samples that approximate draws from a target distribution. Although we apply this technique specifically for ground-state-energy certification, it may find broader applications. Our paper pushes the boundaries of what operation-limited quantum computers can achieve, bringing the prospect of quantum advantage closer to realization.

arXiv:2304.09827•Physical Review A•Jan 17, 2025•27 citations

Heisenberg-Limited Ground-State Energy Estimation for Early Fault-Tolerant Quantum Computers

Lin Lin, Yu Tong

Under suitable assumptions, the quantum-phase-estimation (QPE) algorithm is able to achieve Heisenberg-limited precision scaling in estimating the ground-state energy.However, QPE requires a large number of ancilla qubits and a large circuit depth, as well as the ability to perform inverse quantum Fourier transform, making it expensive to implement on an early fault-tolerant quantum computer.We propose an alternative method to estimate the ground-state energy of a Hamiltonian with Heisenberglimited precision scaling, which employs a simple quantum circuit with one ancilla qubit, and a classical postprocessing procedure.Besides the ground-state energy, our algorithm also produces an approximate cumulative distribution function of the spectral measure, which can be used to compute other spectral properties of the Hamiltonian.

arXiv:2102.11340•PRX Quantum•Feb 2, 2022•215 citations

Accelerated Variational Quantum Eigensolver

Daochen Wang, Oscar Higgott, STEPHEN D. BRIERLEY

The problem of finding the ground state energy of a Hamiltonian using a quantum computer is currently solved using either the quantum phase estimation (QPE) or variational quantum eigensolver (VQE) algorithms. For precision $\ensuremath{\epsilon}$, QPE requires $O(1)$ repetitions of circuits with depth $O(1/\ensuremath{\epsilon})$, whereas each expectation estimation subroutine within VQE requires $O(1/{\ensuremath{\epsilon}}^{2})$ samples from circuits with depth $O(1)$. We propose a generalized VQE algorithm that interpolates between these two regimes via a free parameter $\ensuremath{\alpha}\ensuremath{\in}[0,1]$, which can exploit quantum coherence over a circuit depth of $O(1/{\ensuremath{\epsilon}}^{\ensuremath{\alpha}})$ to reduce the number of samples to $O(1/{\ensuremath{\epsilon}}^{2(1\ensuremath{-}\ensuremath{\alpha})})$. Along the way, we give a new routine for expectation estimation under limited quantum resources that is of independent interest.

arXiv:1802.00171•Physical Review Letters•Apr 12, 2019•268 citations

Evaluating the efficiency of ground-state-preparation algorithms

Aikaterini Gratsea, Chong Sun, Peter D. Johnson

In recent years, substantial research effort has been devoted to quantum algorithms for ground-state-energy estimation (GSEE) in chemistry and materials. Given the many heuristic and nonheuristic methods being developed, it is challenging to assess what combination of these methods will ultimately be used in practice. One important metric for assessing utility is the runtime, which depends on the ground-state preparation (GSP) for most GSEE algorithms. Towards assessing the utility of various combinations of GSEE and GSP methods, we asked under which conditions a GSP method should be accepted over a reference method, such as the Hartree-Fock method. We introduce a criterion for accepting or rejecting a GSP method for the purposes of GSEE. We consider different GSP methods ranging from heuristics to algorithms with provable performance guarantees and perform numerical simulations to benchmark their performance on different chemical systems, starting from small molecules like the hydrogen molecule to larger systems like jellium. In the future, this approach may be used to abandon certain variational quantum eigensolver (VQE) ansatzes and other heuristics. Yet our findings do not provide evidence against using VQE and more expensive heuristic methods, like the low-depth booster. This work sets a foundation from which to further explore the requirements to achieve quantum advantage in quantum chemistry.

arXiv:2212.09492•Physical Review A•Apr 29, 2024•10 citations
Recent progress in quantum computing is paving the way for the realization of early fault-tolerant quantum computers. To maximize the utility of these devices, it is important to develop quantum algorithms that match their capabilities and limitations. Motivated by this, recent work has developed low-depth quantum algorithms for ground state energy estimation (GSEE), an important subroutine in quantum chemistry and materials. We detail a new GSEE algorithm which, like recent work, uses a number of operations scaling as O(1/Δ)O(1/Δ)O(1/Δ) as opposed to the typical O(1/ε)O(1/ε)O(1/ε), at the cost of an increase in the number of circuit repetitions from O(1)O(1)O(1) to O(1/ε2)O(1/ε^2)O(1/ε2). The relevant features of this algorithm come about from using a Gaussian window, which exponentially reduces contamination from excited states over the simplest GSEE algorithm based on the Quantum Fourier Transform (QFT). We adapt this algorithm to interpolate between the low-depth and full-depth regime by replacing ΔΔΔ with anything between ΔΔΔ and εεε. At the cost of increasing the number of ancilla qubits from 111 to O(log⁡Δ)O(\logΔ)O(logΔ), our method reduces the upper bound on the number of circuit repetitions by a factor of four compared to previous methods.
A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will require some degree of fault tolerance. While hardware is improving towards this milestone, optimizing quantum algorithms also brings it closer to the present. Existing methods for ground state energy estimation are costly in that they require a number of gates per circuit that grows exponentially with the desired number of bits in precision. We reduce this cost exponentially, by developing a ground state energy estimation algorithm for which this cost grows linearly in the number of bits of precision. Relative to recent resource estimates of ground state energy estimation for the industrially-relevant molecules of ethylene-carbonate and PF 6 − , the estimated gate count and circuit depth is reduced by a factor of 43 and 78, respectively. Furthermore, the algorithm can use additional circuit depth to reduce the total runtime. These features make our algorithm a promising candidate for realizing quantum advantage in the era of early fault-tolerant quantum computing.
We develop a phase-estimation method with a distinct feature: its maximal run time (which determines the circuit depth) is δ/ , where is the target precision, and the preconstant δ can be arbitrarily close to 0 as the initial state approaches the target eigenstate.The total cost of the algorithm satisfies the Heisenberg-limited scaling O( -1 ).As a result, our algorithm may significantly reduce the circuit depth for performing phase-estimation tasks on early fault-tolerant quantum computers.The key technique is a simple subroutine called quantum complex exponential least squares (QCELS).Our algorithm can be readily applied to reduce the circuit depth for estimating the ground-state energy of a quantum Hamiltonian, when the overlap between the initial state and the ground state is large.If this initial overlap is small, we can combine our method with the Fourier-filtering method developed in [Lin and Tong, PRX Quantum 3, 010318, 2022], and the resulting algorithm provably reduces the circuit depth in the presence of a large relative overlap compared to .The relative-overlap condition is similar to a spectral-gap assumption but it is aware of the information in the initial state and is therefore applicable to certain Hamiltonians with small spectral gaps.We observe that the circuit depth can be reduced by around 2 orders of magnitude in numerical experiments under various settings.
A major thrust in quantum algorithm development over the past decade has been the search for the quantum algorithms that will deliver practical quantum advantage first. Today's quantum computers---and even early fault-tolerant quantum computers---are limited in the number of operations they can implement per circuit. We introduce quantum algorithms for ground-state-energy estimation (GSEE) that accommodate this design constraint. The first algorithm estimates ground-state energies, offering a quadratic improvement on the ground-state overlap parameter compared to other methods in this regime. The second algorithm certifies that the estimated ground-state energy is within a specified error tolerance of the true ground-state energy, addressing the issue of gap estimation that beleaguers several ground-state preparation and energy estimation algorithms. We note, however, that the scaling of this certification technique is currently less favorable than that of the GSEE algorithm. To develop the certification algorithm, we propose an alternative use of quantum computers to facilitate rejection sampling. After a classical computer generates initial samples, the quantum computer is used to accept or reject these samples, resulting in a set of accepted samples that approximate draws from a target distribution. Although we apply this technique specifically for ground-state-energy certification, it may find broader applications. Our paper pushes the boundaries of what operation-limited quantum computers can achieve, bringing the prospect of quantum advantage closer to realization.
Under suitable assumptions, the quantum-phase-estimation (QPE) algorithm is able to achieve Heisenberg-limited precision scaling in estimating the ground-state energy.However, QPE requires a large number of ancilla qubits and a large circuit depth, as well as the ability to perform inverse quantum Fourier transform, making it expensive to implement on an early fault-tolerant quantum computer.We propose an alternative method to estimate the ground-state energy of a Hamiltonian with Heisenberglimited precision scaling, which employs a simple quantum circuit with one ancilla qubit, and a classical postprocessing procedure.Besides the ground-state energy, our algorithm also produces an approximate cumulative distribution function of the spectral measure, which can be used to compute other spectral properties of the Hamiltonian.
The problem of finding the ground state energy of a Hamiltonian using a quantum computer is currently solved using either the quantum phase estimation (QPE) or variational quantum eigensolver (VQE) algorithms. For precision $\ensuremath{\epsilon}$, QPE requires O(1)O(1)O(1) repetitions of circuits with depth $O(1/\ensuremath{\epsilon})$, whereas each expectation estimation subroutine within VQE requires $O(1/{\ensuremath{\epsilon}}^{2})$ samples from circuits with depth O(1)O(1)O(1). We propose a generalized VQE algorithm that interpolates between these two regimes via a free parameter $\ensuremath{\alpha}\ensuremath{\in}[0,1]$, which can exploit quantum coherence over a circuit depth of $O(1/{\ensuremath{\epsilon}}^{\ensuremath{\alpha}})$ to reduce the number of samples to $O(1/{\ensuremath{\epsilon}}^{2(1\ensuremath{-}\ensuremath{\alpha})})$. Along the way, we give a new routine for expectation estimation under limited quantum resources that is of independent interest.
In recent years, substantial research effort has been devoted to quantum algorithms for ground-state-energy estimation (GSEE) in chemistry and materials. Given the many heuristic and nonheuristic methods being developed, it is challenging to assess what combination of these methods will ultimately be used in practice. One important metric for assessing utility is the runtime, which depends on the ground-state preparation (GSP) for most GSEE algorithms. Towards assessing the utility of various combinations of GSEE and GSP methods, we asked under which conditions a GSP method should be accepted over a reference method, such as the Hartree-Fock method. We introduce a criterion for accepting or rejecting a GSP method for the purposes of GSEE. We consider different GSP methods ranging from heuristics to algorithms with provable performance guarantees and perform numerical simulations to benchmark their performance on different chemical systems, starting from small molecules like the hydrogen molecule to larger systems like jellium. In the future, this approach may be used to abandon certain variational quantum eigensolver (VQE) ansatzes and other heuristics. Yet our findings do not provide evidence against using VQE and more expensive heuristic methods, like the low-depth booster. This work sets a foundation from which to further explore the requirements to achieve quantum advantage in quantum chemistry.