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:2602.19556 · Physics Letters A

Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators

Jeongbin Jo

quant-phSubmitted Feb 23, 2026• Announced Feb 24, 2026• 1 citation• Revised May 20, 2026 (v2)
v1 · Feb 23, 2026v2 · May 20, 2026
arXivHTMLPDF

Abstract

The deterministic preparation of quantum many-body ground states is essential for advanced quantum simulation, yet optimal algorithms often require prohibitive hardware resources. Here, we propose a highly efficient, non-variational protocol for ground state preparation using a Power-Cosine quantum signal processing (QSP) filter. By eschewing complex block-encoding techniques, our method directly utilizes coherent time-evolution operators controlled by a single ancillary qubit. The integration of mid-circuit measurement and reset (MCMR) drastically minimizes spatial overhead, translating iterative non-unitary filtering into deep temporal coherence. We analytically demonstrate that this approach achieves exponential suppression of excited states with a circuit depth scaling of $\mathcal{O}(Δ^{-2}\log(1/ε))$, where $Δ$ denotes the spectral gap, prioritizing implementational simplicity over optimal asymptotic complexity. Numerical simulations on the 1D Heisenberg XYZ model validate the theoretical soundness and shot-noise resilience of our method. Furthermore, an advantage analysis reveals that our protocol exponentially outperforms standard Trotterized Adiabatic State Preparation (TASP) at equivalent circuit depths. This single-ancilla framework provides a highly practical and deterministic pathway for many-body ground state preparation on Early Fault-Tolerant (EFT) quantum architectures.

Journal reference
Physics Letters A (2026)
DOI
10.1016/j.physleta.2026.131813
Comments
Accepted for publication in Physics Letters A

Related papers

Ensemble-Based Quantum Signal Processing for Error Mitigation

Suying Liu, Yulong Dong, Dong An +1 more

Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source. We introduce a noise-resilient framework for Quantum Signal Processing (QSP) that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements. Our approach uses ensembles of noisy QSP circuits combined with measurement-level averaging to suppress random phase errors in Z rotations. Building on this framework, we develop robust QSP algorithms for implementing polynomial functions of Hermitian matrices and for estimating observables, with applications to Hamiltonian simulation, quantum linear systems, and ground-state preparation. We analyze the trade-off between approximation error and hardware noise, which is essential for practical implementation under the stringent depth and coherence constraints of current quantum hardware. Our results establish a practical pathway for integrating error mitigation seamlessly into algorithmic design, advancing the development of robust quantum computing, and enabling the discovery of scientific applications with near- and mid-term quantum devices.

quant-pharXiv:2601.20073•Jan 29, 2026•0 citations

Ground-State Preparation and Energy Estimation on Early Fault-Tolerant Quantum Computers via Quantum Eigenvalue Transformation of Unitary Matrices

Yulong Dong, Lin Lin, Yu Tong

Under suitable assumptions, the algorithms in [Lin, Tong, Quantum 2020] can estimate the ground state energy and prepare the ground state of a quantum Hamiltonian with near-optimal query complexities. However, this is based on a block encoding input model of the Hamiltonian, whose implementation is known to require a large resource overhead. We develop a tool called quantum eigenvalue transformation of unitary matrices with real polynomials (QET-U), which uses a controlled Hamiltonian evolution as the input model, a single ancilla qubit and no multi-qubit control operations, and is thus suitable for early fault-tolerant quantum devices. This leads to a simple quantum algorithm that outperforms all previous algorithms with a comparable circuit structure for estimating the ground state energy. For a class of quantum spin Hamiltonians, we propose a new method that exploits certain anti-commutation relations and further removes the need of implementing the controlled Hamiltonian evolution. Coupled with Trotter based approximation of the Hamiltonian evolution, the resulting algorithm can be very suitable for early fault-tolerant quantum devices. We demonstrate the performance of the algorithm using IBM Qiskit for the transverse field Ising model. If we are further allowed to use multi-qubit Toffoli gates, we can then implement amplitude amplification and a new binary amplitude estimation algorithm, which increases the circuit depth but decreases the total query complexity. The resulting algorithm saturates the near-optimal complexity for ground state preparation and energy estimating using a constant number of ancilla qubits (no more than 3).

arXiv:2204.05955•PRX Quantum•Oct 12, 2022•193 citations

Imaginary time evolution and ground state preparation using unitary multi-copy protocols

Tal Schwartzman, Torsten V. Zache, Hannes Pichler +1 more

Efficient low-energy state preparation is a key objective in quantum computation and quantum simulation. Quantum imaginary-time evolution replaces real-time dynamics with imaginary-time dynamics, exponentially suppressing higher-energy eigenstates. We introduce deterministic unitary protocols that approximate imaginary-time evolution for ground state preparation. The protocols require multiple copies of the system, real-time evolution under the system Hamiltonian, and controlled-SWAP operations (or more general SWAP-generated unitaries). Our analysis focuses on two concrete circuit families: a tree architecture with provable polynomial-in-depth convergence but rapidly growing width, and a compact "hedge" architecture that achieves comparable accuracy with only polynomial width in a heuristic construction supported by numerics. Numerical evidence indicates that mid-circuit post-selection can accelerate convergence with practical success probabilities. Separately, we demonstrate that circuit volume can be traded for the shot complexity of post-circuit observable estimation in the ground state preparation setting. Finally, we outline concrete platform-specific implementations in which multi-copy registers and SWAP-mediated couplings are natural, illustrating how these hybrid analog-digital circuits can complement existing state-preparation methods in the near term.

quant-pharXiv:2603.11208•PRX Quantum•Mar 13, 2026•2 citations

A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth

Ioannis Kolotouros, Raul Garcia-Patron

Imaginary-time evolution (ITE) is a widely used technique for preparing the ground state of a target Hamiltonian. Building on the recently proposed framework of Double-Bracket quantum ITE (DB-QITE), we introduce a probabilistic variant (PDBQITE) that achieves an exponential reduction in circuit depth. Our algorithm requires only a single ancilla qubit and a quantum circuit that consists of one controlled real-time evolution and one mid-circuit measurement per iteration. The trade-off is an exponential decay of the total success probability with the number of iterations, for which we derive an analytical lower bound that is independent of system size. Our numerical simulations show that the per-step success probability remains close to unity, making it realistic to execute many iterations, thus providing a substantial improvement over prior constructions. We show that PDBQITE outperforms the near-term probabilistic algorithm PITE for ground-state preparation of molecular Hamiltonians, and that a hybrid QAOA-PDBQITE scheme achieves higher approximation ratios than QAOA at the same circuit depth on random regular graphs for the MaxCut problem.

quant-pharXiv:2609.37095•Sep 30, 2026•1 citation

Efficient quantum state preparation on Quantinuum hardware

Archie Butterworth, Josh Green, Yusen Wu +2 more

Preparation and verification of specific quantum states is an important capability for quantum devices to realise advantages over classical computations and algorithms. In this work, we have demonstrated an end-to-end framework that combines resource-efficient quantum state preparation with rapid, robust fidelity verification on near-term quantum hardware. By experimentally preparing and validating a structured complex quantum state encoding a digitized acoustic signal on the Quantinuum H2-1 trapped-ion platform, we achieved a high hardware fidelity of $F_{\mathrm{hw}} = 0.929$. Crucially, this milestone was realized without relying on idealized assumptions or deep fault-tolerant overhead, but rather through resource-minimal circuits optimized for NISQ-era and early fault-tolerant devices. Furthermore, we addressed a key limitation in current quantum state certification. While validation methods like shadow overlap work well for random states, their sample complexity can become prohibitively high for the structured states used in practical algorithms. We mitigate this by introducing a pre-measurement basis-change technique that reduces the verification parameter, $τ$, by over 10 orders of magnitude for structured targets. This approach tightens the theoretical certification guarantees of the shadow overlap method and integrates tensor-network preparation and shadow validation into a unified workflow. These results shift the paradigm of how structured classical data can be mapped to and verified on quantum hardware under realistic noise and measurement budgets. By compressing a robust verification procedure to just 1,000 measurement shots, this framework offers an immediate, scalable benchmarking standard.

quant-pharXiv:2609.08414•Sep 9, 2026•0 citations

Quantum Power Iteration Unified Using Generalized Quantum Signal Processing

Viktor E. Khinevich, Yasunori Lee, Nobuyuki Yoshioka +1 more

We propose a unifying framework for the state preparation using quantum power method algorithms based on generalized quantum signal processing (GQSP). We apply GQSP to realize quantum analogs of classical power iteration, power Lanczos, inverse iteration, and folded spectrum methods, all within a single coherent framework. GQSP allows efficient realization of methods that require complex polynomials, while avoiding the limitations of approaches based on linear combinations of time-evolution operators. Our constructions, including a Trotter-decomposition-free quantum inverse iteration, achieve near-optimal query scaling, together with reduced qubit requirements. The same formalism yields a quantum folded spectrum method for excited state preparation that avoids explicitly forming powers of the Hamiltonian or performing variational optimization. We provide a theoretical analysis of success probabilities and resource scaling, and we validate the methods numerically using molecular Hamiltonians. The results show that quantum power Lanczos lowers the computational cost and provides robust convergence compared to naive quantum power iteration. Our findings reveal that GQSP-based implementations of power methods combine scalability, flexibility, and robust convergence, paving the way for practical initial state preparations on fault-tolerant quantum devices.

arXiv:2507.11142•Jul 15, 2025•4 citations
The deterministic preparation of quantum many-body ground states is essential for advanced quantum simulation, yet optimal algorithms often require prohibitive hardware resources. Here, we propose a highly efficient, non-variational protocol for ground state preparation using a Power-Cosine quantum signal processing (QSP) filter. By eschewing complex block-encoding techniques, our method directly utilizes coherent time-evolution operators controlled by a single ancillary qubit. The integration of mid-circuit measurement and reset (MCMR) drastically minimizes spatial overhead, translating iterative non-unitary filtering into deep temporal coherence. We analytically demonstrate that this approach achieves exponential suppression of excited states with a circuit depth scaling of O(Δ−2log⁡(1/ε))\mathcal{O}(Δ^{-2}\log(1/ε))O(Δ−2log(1/ε)), where ΔΔΔ denotes the spectral gap, prioritizing implementational simplicity over optimal asymptotic complexity. Numerical simulations on the 1D Heisenberg XYZ model validate the theoretical soundness and shot-noise resilience of our method. Furthermore, an advantage analysis reveals that our protocol exponentially outperforms standard Trotterized Adiabatic State Preparation (TASP) at equivalent circuit depths. This single-ancilla framework provides a highly practical and deterministic pathway for many-body ground state preparation on Early Fault-Tolerant (EFT) quantum architectures.
Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source. We introduce a noise-resilient framework for Quantum Signal Processing (QSP) that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements. Our approach uses ensembles of noisy QSP circuits combined with measurement-level averaging to suppress random phase errors in Z rotations. Building on this framework, we develop robust QSP algorithms for implementing polynomial functions of Hermitian matrices and for estimating observables, with applications to Hamiltonian simulation, quantum linear systems, and ground-state preparation. We analyze the trade-off between approximation error and hardware noise, which is essential for practical implementation under the stringent depth and coherence constraints of current quantum hardware. Our results establish a practical pathway for integrating error mitigation seamlessly into algorithmic design, advancing the development of robust quantum computing, and enabling the discovery of scientific applications with near- and mid-term quantum devices.
Under suitable assumptions, the algorithms in [Lin, Tong, Quantum 2020] can estimate the ground state energy and prepare the ground state of a quantum Hamiltonian with near-optimal query complexities. However, this is based on a block encoding input model of the Hamiltonian, whose implementation is known to require a large resource overhead. We develop a tool called quantum eigenvalue transformation of unitary matrices with real polynomials (QET-U), which uses a controlled Hamiltonian evolution as the input model, a single ancilla qubit and no multi-qubit control operations, and is thus suitable for early fault-tolerant quantum devices. This leads to a simple quantum algorithm that outperforms all previous algorithms with a comparable circuit structure for estimating the ground state energy. For a class of quantum spin Hamiltonians, we propose a new method that exploits certain anti-commutation relations and further removes the need of implementing the controlled Hamiltonian evolution. Coupled with Trotter based approximation of the Hamiltonian evolution, the resulting algorithm can be very suitable for early fault-tolerant quantum devices. We demonstrate the performance of the algorithm using IBM Qiskit for the transverse field Ising model. If we are further allowed to use multi-qubit Toffoli gates, we can then implement amplitude amplification and a new binary amplitude estimation algorithm, which increases the circuit depth but decreases the total query complexity. The resulting algorithm saturates the near-optimal complexity for ground state preparation and energy estimating using a constant number of ancilla qubits (no more than 3).
Efficient low-energy state preparation is a key objective in quantum computation and quantum simulation. Quantum imaginary-time evolution replaces real-time dynamics with imaginary-time dynamics, exponentially suppressing higher-energy eigenstates. We introduce deterministic unitary protocols that approximate imaginary-time evolution for ground state preparation. The protocols require multiple copies of the system, real-time evolution under the system Hamiltonian, and controlled-SWAP operations (or more general SWAP-generated unitaries). Our analysis focuses on two concrete circuit families: a tree architecture with provable polynomial-in-depth convergence but rapidly growing width, and a compact "hedge" architecture that achieves comparable accuracy with only polynomial width in a heuristic construction supported by numerics. Numerical evidence indicates that mid-circuit post-selection can accelerate convergence with practical success probabilities. Separately, we demonstrate that circuit volume can be traded for the shot complexity of post-circuit observable estimation in the ground state preparation setting. Finally, we outline concrete platform-specific implementations in which multi-copy registers and SWAP-mediated couplings are natural, illustrating how these hybrid analog-digital circuits can complement existing state-preparation methods in the near term.
Imaginary-time evolution (ITE) is a widely used technique for preparing the ground state of a target Hamiltonian. Building on the recently proposed framework of Double-Bracket quantum ITE (DB-QITE), we introduce a probabilistic variant (PDBQITE) that achieves an exponential reduction in circuit depth. Our algorithm requires only a single ancilla qubit and a quantum circuit that consists of one controlled real-time evolution and one mid-circuit measurement per iteration. The trade-off is an exponential decay of the total success probability with the number of iterations, for which we derive an analytical lower bound that is independent of system size. Our numerical simulations show that the per-step success probability remains close to unity, making it realistic to execute many iterations, thus providing a substantial improvement over prior constructions. We show that PDBQITE outperforms the near-term probabilistic algorithm PITE for ground-state preparation of molecular Hamiltonians, and that a hybrid QAOA-PDBQITE scheme achieves higher approximation ratios than QAOA at the same circuit depth on random regular graphs for the MaxCut problem.
Preparation and verification of specific quantum states is an important capability for quantum devices to realise advantages over classical computations and algorithms. In this work, we have demonstrated an end-to-end framework that combines resource-efficient quantum state preparation with rapid, robust fidelity verification on near-term quantum hardware. By experimentally preparing and validating a structured complex quantum state encoding a digitized acoustic signal on the Quantinuum H2-1 trapped-ion platform, we achieved a high hardware fidelity of Fhw=0.929F_{\mathrm{hw}} = 0.929Fhw​=0.929. Crucially, this milestone was realized without relying on idealized assumptions or deep fault-tolerant overhead, but rather through resource-minimal circuits optimized for NISQ-era and early fault-tolerant devices. Furthermore, we addressed a key limitation in current quantum state certification. While validation methods like shadow overlap work well for random states, their sample complexity can become prohibitively high for the structured states used in practical algorithms. We mitigate this by introducing a pre-measurement basis-change technique that reduces the verification parameter, τττ, by over 10 orders of magnitude for structured targets. This approach tightens the theoretical certification guarantees of the shadow overlap method and integrates tensor-network preparation and shadow validation into a unified workflow. These results shift the paradigm of how structured classical data can be mapped to and verified on quantum hardware under realistic noise and measurement budgets. By compressing a robust verification procedure to just 1,000 measurement shots, this framework offers an immediate, scalable benchmarking standard.
We propose a unifying framework for the state preparation using quantum power method algorithms based on generalized quantum signal processing (GQSP). We apply GQSP to realize quantum analogs of classical power iteration, power Lanczos, inverse iteration, and folded spectrum methods, all within a single coherent framework. GQSP allows efficient realization of methods that require complex polynomials, while avoiding the limitations of approaches based on linear combinations of time-evolution operators. Our constructions, including a Trotter-decomposition-free quantum inverse iteration, achieve near-optimal query scaling, together with reduced qubit requirements. The same formalism yields a quantum folded spectrum method for excited state preparation that avoids explicitly forming powers of the Hamiltonian or performing variational optimization. We provide a theoretical analysis of success probabilities and resource scaling, and we validate the methods numerically using molecular Hamiltonians. The results show that quantum power Lanczos lowers the computational cost and provides robust convergence compared to naive quantum power iteration. Our findings reveal that GQSP-based implementations of power methods combine scalability, flexibility, and robust convergence, paving the way for practical initial state preparations on fault-tolerant quantum devices.