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:1605.02747 · Physical Review A

Efficient state initialization by a quantum spectral filtering algorithm

François Fillion‐Gourdeau, Steve G. MacLean, Raymond Laflamme

Published Apr 21, 2017• 5 citations
arXivHTMLPDF

Abstract

An algorithm that initializes a quantum register to a state with a specified energy range is given, corresponding to a quantum implementation of the celebrated Feit-Fleck method. This is performed by introducing a nondeterministic quantum implementation of a standard spectral filtering procedure combined with an apodization technique, allowing for accurate state initialization. It is shown that the implementation requires only two ancilla qubits. A lower bound for the total probability of success of this algorithm is derived, showing that this scheme can be realized using a finite, relatively low number of trials. Assuming the time evolution can be performed efficiently and using a trial state polynomially close to the desired states, it is demonstrated that the number of operations required scales polynomially with the number of qubits. Tradeoffs between accuracy and performance are demonstrated in a simple example: the harmonic oscillator. This algorithm would be useful for the initialization phase of the simulation of quantum systems on digital quantum computers.

DOI
10.1103/physreva.95.042331

Related papers

Ground States via Spectral Combing on a Quantum Computer

David B. Kaplan, Natalie Klco, Alessandro Roggero

A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of Spectral Combing involves entangling an arbitrary initial wave function with a set of auxiliary qubits governed by a time dependent Hamiltonian, resonantly transferring energy out of the initial state through a plethora of avoided level crossings into the auxiliary system. The number of avoided level crossings grows exponentially with the number of qubits required to represent the Hamiltonian, so that the efficiency of the algorithm does not rely on any particular energy gap being large. We give an explicit construction of the quantum gates required for the realization of this procedure and explore the results of classical simulations of the algorithm on a small quantum computer with up to 8 qubits. We show that for certain systems and comparable results, Spectral Combing requires fewer quantum gates to realize than the Quantum Adiabatic Algorithm.

arXiv:1709.08250•Sep 24, 2017•43 citations

Projection algorithm for state preparation on quantum computers

Ionel Stetcu, Alessandro Baroni, Joseph Carlson

We present an efficient method to prepare states of a many-body system on quantum hardware, first isolating individual quantum numbers and then using time evolution to isolate the energy. Our method in its simplest form requires only one additional auxiliary qubit. The total time evolved for an accurate solution is proportional to the ratio of the spectrum range of the trial state to the gap to the lowest excited state, a substantial improvement over other projection algorithms, and the accuracy increases exponentially with the time evolved. Isolating the quantum numbers is efficient because of the known eigenvalues, and increases the gap thus shortening the propagation time required. The success rate of the algorithm, or the probability of producing the desired state, is a simple function of measurement times and phases and is dominated by the square overlap of the original state to the desired state. We present examples from the nuclear shell model and the Heisenberg model. We compare this algorithm to previous algorithms for short evolution times and discuss potential further improvements.

arXiv:2211.10545•Physical Review C•Sep 29, 2023•32 citations

Filtered quantum phase estimation

Gwonhak Lee, Min-Sung Kang, Jungsoo Hong +2 more

Abstract Accurate state preparation is a critical bottleneck in many quantum algorithms, particularly those for ground-state energy estimation. Even in fault-tolerant quantum computing, preparing a quantum state with sufficient overlap with the desired eigenstate remains a major challenge. To address this, we develop a unified cost-aware framework for filtered-state preparation that enhances the overlap of a given input state through spectral filtering. The framework covers polynomial and trigonometric realizations of filters and makes explicit the trade-off among overlap amplification, preparation success probability, and filter-implementation cost. As representative examples, we analyze Gaussian filters and introduce a modified Krylov-subspace-based filter that improves the success-probability/overlap trade-off relevant to filtered state preparation. Within this framework, we study a filtered variant of quantum phase estimation (FQPE) that mitigates the unfavorable dependence on the initial overlap present in standard quantum phase estimation. Numerical experiments on Fermi–Hubbard models show that FQPE reduces the total runtime by more than two orders of magnitude in the high-precision regime, with overlap amplification exceeding a factor of one hundred.

arXiv:2510.04294•Quantum Science and Technology•Sep 2, 2026•6 citations

Quantum-phase-estimation-based filtering: Performance analysis and application to low-energy spectral calculations

Rei Sakuma, Kaito Wada, Shu Kanno +5 more

Filtering is an important technique in quantum computing used for isolating or enhancing some specific states of quantum many-body systems. In this paper, we analyze the performance of filters based on the quantum phase estimation (QPE) algorithm, in which filtering removes states associated with bitstrings in the ancilla register above a given threshold. We show that when the conventional rectangular window function is used for the QPE input state, the resulting filter function exhibits an oscillating behavior known as the Gibbs phenomenon. We also show that in the case of the sine and Kaiser windows, this phenomenon is suppressed. Furthermore, we perform numerical simulations to compare the number of necessary queries to the Hamiltonian time evolution operation of for the QPE-based filtering algorithm and the quantum eigenvalue transformation of unitary matrices with real polynomials (QETU). We find that the number of queries required for Kaiser window-based filtering is comparable to that for QETU with optimized phase angles. As an application of the QPE-based filter, we also study a two-step algorithm for low-energy spectral simulations, composed of a coarse grid for filtering and a fine grid for obtaining final high-resolution spectra. As a benchmark of the proposed scheme for realistic continuous spectra, we present the density-of-states (DOS) calculation of antiferromagnetic type-II MnO in a one-particle approximation.

arXiv:2507.01361•Physical Review A•Dec 11, 2025•7 citations

Qudit Implementation of the Rodeo Algorithm for Quantum Spectral Filtering

Julio Cesar Siqueira Rocha, Rodrigo Alves Dias

Qudits, the multi-level generalization of qubits, provide a natural extension of the binary paradigm in quantum computation and offer new opportunities to enhance algorithmic performance. Beyond their direct applicability to the simulation of multi-level quantum systems, higher-dimensional ancillae can improve sampling efficiency in quantum algorithms by enabling the simultaneous implementation of multiple control operations, thereby reducing circuit complexity. In this work, we pursue three main objectives. First, we present a formulation of the Rodeo algorithm employing a general $d$-level ancilla qudit. Second, we introduce the concept of the \emph{Rodeo kernel}, defined as a two-frequency interferometer, which acts as a spectral filter in the energy domain. Finally, we propose a microcanonical protocol for the Rodeo algorithm. This protocol enables the estimation of entropic quantities through a single energy sweep and admits a natural interpretation as a Gaussian convolution of the density of states. To support the theoretical analysis, we perform numerical evaluations of the corresponding quantum circuit using ancilla qudits of dimensions three, four, and five. The simulations are performed for the one-dimensional Ising model, considering both spin-$\sfrac{1}{2}$ and spin-$1$ particles. The ancilla qutrit implementation exhibits an $18\%$ reduction in fluctuations compared to the qubit implementation. Our results show that qudits provide a framework for spectral analysis and thermodynamic characterization of multi-level quantum systems.

quant-pharXiv:2603.16049•Mar 18, 2026•2 citations

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

Lin Lin, Yu Tong

We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal O ~ ( d κ log ⁡ ( 1 / ϵ ) ) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.

arXiv:1910.14596•Quantum•Nov 11, 2020•159 citations
An algorithm that initializes a quantum register to a state with a specified energy range is given, corresponding to a quantum implementation of the celebrated Feit-Fleck method. This is performed by introducing a nondeterministic quantum implementation of a standard spectral filtering procedure combined with an apodization technique, allowing for accurate state initialization. It is shown that the implementation requires only two ancilla qubits. A lower bound for the total probability of success of this algorithm is derived, showing that this scheme can be realized using a finite, relatively low number of trials. Assuming the time evolution can be performed efficiently and using a trial state polynomially close to the desired states, it is demonstrated that the number of operations required scales polynomially with the number of qubits. Tradeoffs between accuracy and performance are demonstrated in a simple example: the harmonic oscillator. This algorithm would be useful for the initialization phase of the simulation of quantum systems on digital quantum computers.
A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of Spectral Combing involves entangling an arbitrary initial wave function with a set of auxiliary qubits governed by a time dependent Hamiltonian, resonantly transferring energy out of the initial state through a plethora of avoided level crossings into the auxiliary system. The number of avoided level crossings grows exponentially with the number of qubits required to represent the Hamiltonian, so that the efficiency of the algorithm does not rely on any particular energy gap being large. We give an explicit construction of the quantum gates required for the realization of this procedure and explore the results of classical simulations of the algorithm on a small quantum computer with up to 8 qubits. We show that for certain systems and comparable results, Spectral Combing requires fewer quantum gates to realize than the Quantum Adiabatic Algorithm.
We present an efficient method to prepare states of a many-body system on quantum hardware, first isolating individual quantum numbers and then using time evolution to isolate the energy. Our method in its simplest form requires only one additional auxiliary qubit. The total time evolved for an accurate solution is proportional to the ratio of the spectrum range of the trial state to the gap to the lowest excited state, a substantial improvement over other projection algorithms, and the accuracy increases exponentially with the time evolved. Isolating the quantum numbers is efficient because of the known eigenvalues, and increases the gap thus shortening the propagation time required. The success rate of the algorithm, or the probability of producing the desired state, is a simple function of measurement times and phases and is dominated by the square overlap of the original state to the desired state. We present examples from the nuclear shell model and the Heisenberg model. We compare this algorithm to previous algorithms for short evolution times and discuss potential further improvements.
Abstract Accurate state preparation is a critical bottleneck in many quantum algorithms, particularly those for ground-state energy estimation. Even in fault-tolerant quantum computing, preparing a quantum state with sufficient overlap with the desired eigenstate remains a major challenge. To address this, we develop a unified cost-aware framework for filtered-state preparation that enhances the overlap of a given input state through spectral filtering. The framework covers polynomial and trigonometric realizations of filters and makes explicit the trade-off among overlap amplification, preparation success probability, and filter-implementation cost. As representative examples, we analyze Gaussian filters and introduce a modified Krylov-subspace-based filter that improves the success-probability/overlap trade-off relevant to filtered state preparation. Within this framework, we study a filtered variant of quantum phase estimation (FQPE) that mitigates the unfavorable dependence on the initial overlap present in standard quantum phase estimation. Numerical experiments on Fermi–Hubbard models show that FQPE reduces the total runtime by more than two orders of magnitude in the high-precision regime, with overlap amplification exceeding a factor of one hundred.
Filtering is an important technique in quantum computing used for isolating or enhancing some specific states of quantum many-body systems. In this paper, we analyze the performance of filters based on the quantum phase estimation (QPE) algorithm, in which filtering removes states associated with bitstrings in the ancilla register above a given threshold. We show that when the conventional rectangular window function is used for the QPE input state, the resulting filter function exhibits an oscillating behavior known as the Gibbs phenomenon. We also show that in the case of the sine and Kaiser windows, this phenomenon is suppressed. Furthermore, we perform numerical simulations to compare the number of necessary queries to the Hamiltonian time evolution operation of for the QPE-based filtering algorithm and the quantum eigenvalue transformation of unitary matrices with real polynomials (QETU). We find that the number of queries required for Kaiser window-based filtering is comparable to that for QETU with optimized phase angles. As an application of the QPE-based filter, we also study a two-step algorithm for low-energy spectral simulations, composed of a coarse grid for filtering and a fine grid for obtaining final high-resolution spectra. As a benchmark of the proposed scheme for realistic continuous spectra, we present the density-of-states (DOS) calculation of antiferromagnetic type-II MnO in a one-particle approximation.
Qudits, the multi-level generalization of qubits, provide a natural extension of the binary paradigm in quantum computation and offer new opportunities to enhance algorithmic performance. Beyond their direct applicability to the simulation of multi-level quantum systems, higher-dimensional ancillae can improve sampling efficiency in quantum algorithms by enabling the simultaneous implementation of multiple control operations, thereby reducing circuit complexity. In this work, we pursue three main objectives. First, we present a formulation of the Rodeo algorithm employing a general ddd-level ancilla qudit. Second, we introduce the concept of the \emph{Rodeo kernel}, defined as a two-frequency interferometer, which acts as a spectral filter in the energy domain. Finally, we propose a microcanonical protocol for the Rodeo algorithm. This protocol enables the estimation of entropic quantities through a single energy sweep and admits a natural interpretation as a Gaussian convolution of the density of states. To support the theoretical analysis, we perform numerical evaluations of the corresponding quantum circuit using ancilla qudits of dimensions three, four, and five. The simulations are performed for the one-dimensional Ising model, considering both spin-$\sfrac{1}{2}$ and spin-111 particles. The ancilla qutrit implementation exhibits an 18%18\%18% reduction in fluctuations compared to the qubit implementation. Our results show that qudits provide a framework for spectral analysis and thermodynamic characterization of multi-level quantum systems.
We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal O ~ ( d κ log ⁡ ( 1 / ϵ ) ) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.