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

Measurement-dependent reduction of open dynamics in the quantum phase estimation algorithm: the visible subspace and the damped Fejér kernel

Marina O. Gordeichuk, Oleg M. Kiselev

math-phmath.NAquant-phSubmitted Oct 26, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

For the quantum phase estimation (QPE) algorithm we study the minimal space of observables that is sufficient to predict the entire output distribution under open dynamics of the counting register. Building on the general Krylov theory of reduction, we compute the structure of this space explicitly for the full Fourier measurement. The outcome probabilities are determined by cyclic sums of the state matrix. If the adjoint generator is diagonal on the matrix units, the spectral classes inside the residue classes of the index difference modulo the register dimension $M$ give a constructive basis, an exact dimension formula, and attainable bounds: the dimension of the visible space lies between $M$ and $M^2-M+1$. The class includes independent qubit dephasing, and an analytically solvable reference model of Gorini--Kossakowski--Lindblad--Sudarshan (GKLS) type yields a damped Fejér kernel; two random-unitary channels with the same Ramsey contrast show that higher harmonics are distinguishable in the QPE distribution. For approximate reduction we use a finite-time Gramian and an a posteriori residual estimate, with a quadratic error order for a reducing unperturbed subspace and a compatible initial state. Numerical calculations check the consistency of the representations and the behaviour of the error under non-Toeplitz perturbations.

AI Summary

The paper asks which counting-register observables suffice to predict the full quantum phase estimation (QPE) output distribution under open dynamics before the inverse quantum Fourier transform. It specializes known observable-Krylov reduction to the Fourier measurement, seeking an exact linear model valid for every initial state and all times. The visible space is $\mathcal K=\operatorname{span}\{G^rE_k\}$, where $G$ is the adjoint generator. QPE probabilities are discrete Fourier transforms of cyclic sums of density-matrix entries. When $G$ is diagonal on matrix units, grouping eigenvalues within each residue class $j-\ell\bmod M$ gives an explicit basis and the exact dimension $\dim\mathcal K=\sum_r|\Lambda_r|$, with attainable bounds $M\leq\dim\mathcal K\leq M^2-M+1$. The proof uses Fourier decomposition and Vandermonde interpolation. A solvable GKLS dephasing model yields a damped Fejér kernel and dimensions $M$, $2M-2$, or $2M-1$, depending on damping and detuning. Two random-unitary channels with identical first-harmonic Ramsey response have different QPE distributions. For approximate reduction, a finite-time Gramian supplies optimal trajectory-projection subspaces. Duhamel estimates give probability-error bounds controlled by the invariance residual; errors are quadratic in perturbation strength when the unperturbed subspace is reducing and the initial state is compatible. Numerical checks reproduce the analytic model through $M=64$ and test non-Toeplitz perturbations at $M=8,16,32$. The dimension formulas concern universal linear observable models, not necessarily physically admissible reduced quantum dynamics. Closed-form results require matrix-unit diagonality; the numerical studies are deterministic consistency checks, and the uniform residual bounds can be substantially looser than state-specific errors.

Little sign of AI-generated textIncrementalStrong assumptions

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
21 pages, 1 figure

Related papers

Fourier spectra and benchmarking of phase-estimation variational quantum classifiers

Victor Sineglazov, Petro Chynnyk

Introduction: A variational quantum classifier realises a function whose Fourier spectrum is fixed by the circuit and whose coefficients must be found by an optimiser. We study a readout borrowed from quantum phase estimation (QPE): a data-dependent operator acts on a target register through controlled powers, and the class label is read from an estimation register of m qubits after an inverse quantum Fourier transform (QFT). Materials and methods: We derive the exact readout distribution—a Fejér-weighted expansion in the moments of the operator—and characterise its Fourier spectrum for two single-qubit blocks: H ⋅ P h ⋅ R Y (family A) and a universal U 2 block (family B). All analytical statements are verified against a state-vector simulator, including attainment of the predicted spectrum. Three ablation controls alter one component each at an unchanged parameter count: the encoding QFT is removed, the exponential ladder of controlled powers is replaced by single powers, and the inverse QFT is replaced by independent Hadamard tests. The benchmark comprises 7680 training runs of 24 circuits on three tasks, with one generated dataset or one cross-validation fold as the unit of inference (twenty per sample size), exact signed-rank tests, and the corrected resampled t -test for the overlapping folds. Results: The support of every readout probability lies in parity-locked lattice cubes of maximal harmonic order 2 m + 1 . The maximal order is attained at every register size, in every feature and every outcome, except for family A with one target qubit, where the two highest orders cancel identically; the full support is attained at every register size used here ( t ≤ 4 , m ≤ 3 ), and the band is tapered towards its edge. Removing the encoding QFT costs family B 0.144 and 0.082 in test accuracy on the two-feature tasks, and replacing the power ladder by single powers costs 0.086 – 0.225 wherever m ≥ 2 ; replacing the inverse QFT by Hadamard tests has no detectable effect. The architecture leads the independently parameterised reference circuits only on the three-class task ( + 0.119 , p < 0.0001 ), where a parameter-tied re-uploading circuit with 12 rather than 20 parameters is not resolved from it ( + 0.023 , 95% confidence interval (CI)

Academia quantum.•Oct 29, 2026•0 citations

Standard Quantum Phase Estimation Detects All Eigenvalues via Randomized Initial States

Yuki Izumi, Hitoshi Kawahara

Standard quantum phase estimation (QPE) has often been regarded as unsuitable for simultaneous detection of all eigenvalues, because it requires initial states with sufficient overlap with the target eigenstates. In this paper, we show that this limitation is not inherent to the QPE circuit itself. The output distribution of standard QPE can be written as a superposition of Fejér kernels weighted by the squared overlaps with the eigenmodes. We prove that, if the initial state is independently drawn at each shot from a 1-design (in particular, by random selection of computational basis states), these mode weights are equalized in expectation, yielding a state-averaged QPE distribution that exhibits peaks at every eigenphase location. In this sense, all eigenvalues become accessible without any modification of the standard QPE circuit; repeated eigenvalues appear through the aggregated weight of their eigenspaces. For distinct eigenphases satisfying a separation condition, we further establish a rigorous peak-detection theory and derive a sufficient shot-count estimate for detecting all peaks. We validate the theory through numerical experiments on a finite element method (FEM) matrix with 1,008 degrees of freedom arising from computer-aided engineering (CAE).

quant-pharXiv:2604.00475•Apr 2, 2026•0 citations

Effects of Trotter Error, Digitization Error, and Initial State Overlap on Tapered Quantum Phase Estimation for Minimum Eigenvalue Computation

Elijah Pelofske, Stephan Eidenbenz

We numerically implement full quantum circuits of optimal tapered Quantum Phase Estimation (in the form of an implementable approximate bandwidth-limited DPSS taper) for the purpose of minimum eigenvalue computation, where the Hamiltonian time-evolution unitary is implemented using standard Trotterization, and the taper state is constructed using an optimized bandwidth-limited taper. We illustrate, on representative quantum Hamiltonians, with tractable exact classical numerical quantum circuit simulations, how tapered QPE performs with respect to optimal phase sampling rate, absolute error, Shannon entropy of the optimal phase distribution, when the tQPE algorithm parameters are changed. Those algorithm parameters are Trotter error, finite sampling, imperfect initial states, total evolution time, and digitization error (number of phase qubits). The reported numerical experiments include up to $\ell=10$ phase qubits of precision with $m=3$ additional phase-register error suppression qubits, on a $4$-qubit Heisenberg quantum magnet model Hamiltonian, using up to 12th-order Trotterization. We numerically show i) the steady-state optimal phase sampling rate is determined by the initial state overlap with the ground-state, ii) with respect to phase sampling probability, or overall eigenvalue sampling error rate, there is no strong evolution time dependence for tQPE unless there is high Trotter error, iii) the approximated time-evolution unitaries in tQPE, like in standard QPE, can result in substantial ringing, which leads to non-physical eigenvalue estimates.

quant-pharXiv:2609.06249•Sep 8, 2026•0 citations

Deterministic Quantum Phase Estimation with Linear Circuit Complexity in a Photonic System

M. Midhuna, Ajay Jayachandran, Kanad Sengupta +2 more

Quantum algorithms solve certain computational problems faster than the best known classical algorithms. Many algorithms, including Shor's for factoring, Grover's for unstructured search, and the HHL for solving linear systems, rely on quantum phase estimation (QPE) as a fundamental subroutine. The QPE protocol proceeds through the initialization of a control register in a uniform superposition, controlled unitary evolution encoding the eigenphase, and a final inverse quantum Fourier transform followed by measurement to extract the phase. Here, we address a special class of unitary operators that frequently appear in quantum Fourier transform-based protocols, cyclic group representations, and periodically evolving quantum systems. We introduce a QPE algorithm that successfully reduces the circuit complexity from $\mathcal{O}(n^2)$ to $\mathcal{O}(n)$ for a special class of unitary operators and implement it on a four-qubit photonic system. The four-qubit system is realised using a photon pair, with two qubits encoded in its polarization degree of freedom and the remaining two in its path modes. In contrast to previous photonic implementations of QPE based on dual-rail encoding and KLM protocol, where controlled operations are inherently probabilistic and thus reduce the overall success probability of phase estimation, our scheme is fully deterministic. Moreover, it is scalable to higher-dimensional unitaries, provided the underlying structure of the unitaries is preserved.

quant-pharXiv:2607.13404•Jul 16, 2026•0 citations

Approximate Reduced Lindblad Dynamics via Algebraic and Adiabatic Methods

Tommaso Grigoletto, Alain Sarlette, Francesco Ticozzi +1 more

We present an algebraic framework for approximate model reduction of Markovian open quantum dynamics that guarantees complete positivity and trace preservation by construction. First, we show that projecting a Lindblad generator on its center manifold -- the space spanned by eigenoperators with purely imaginary eigenvalue -- yields an asymptotically exact reduced quantum dynamical semigroup whose dynamics is unitary, with exponentially decaying transient error controlled by the generator's spectral gap. Second, for analytic perturbations of a Lindblad generator with a tractable center manifold, we propose a perturbative reduction that keeps the reduced space fixed at the unperturbed center manifold. The resulting generator is shown to remain a valid Lindbladian; explicit finite-time error bounds that quantify leakage from the unperturbed center sector are provided. We further clarify the connection to adiabatic elimination methods, by both showing how the algebraic reduction can be directly related to a first-order adiabatic-elimination and by providing sufficient conditions under which the latter method can be applied while preserving complete positivity. We showcase the usefulness of our techniques in dissipative many-body quantum systems exhibiting non-stationary long-time dynamics.

quant-pharXiv:2603.11982•Quantum Science and Technology•Mar 13, 2026•0 citations

Real-Time Krylov Theory for Quantum Computing Algorithms

Yizhi Shen, Katherine Klymko, James Sud +3 more

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.

arXiv:2208.01063•Quantum•Jul 25, 2023•33 citations
For the quantum phase estimation (QPE) algorithm we study the minimal space of observables that is sufficient to predict the entire output distribution under open dynamics of the counting register. Building on the general Krylov theory of reduction, we compute the structure of this space explicitly for the full Fourier measurement. The outcome probabilities are determined by cyclic sums of the state matrix. If the adjoint generator is diagonal on the matrix units, the spectral classes inside the residue classes of the index difference modulo the register dimension MMM give a constructive basis, an exact dimension formula, and attainable bounds: the dimension of the visible space lies between MMM and M2−M+1M^2-M+1M2−M+1. The class includes independent qubit dephasing, and an analytically solvable reference model of Gorini--Kossakowski--Lindblad--Sudarshan (GKLS) type yields a damped Fejér kernel; two random-unitary channels with the same Ramsey contrast show that higher harmonics are distinguishable in the QPE distribution. For approximate reduction we use a finite-time Gramian and an a posteriori residual estimate, with a quadratic error order for a reducing unperturbed subspace and a compatible initial state. Numerical calculations check the consistency of the representations and the behaviour of the error under non-Toeplitz perturbations.
The paper asks which counting-register observables suffice to predict the full quantum phase estimation (QPE) output distribution under open dynamics before the inverse quantum Fourier transform. It specializes known observable-Krylov reduction to the Fourier measurement, seeking an exact linear model valid for every initial state and all times.
The visible space is K=span⁡{GrEk}\mathcal K=\operatorname{span}\{G^rE_k\}K=span{GrEk​}, where GGG is the adjoint generator. QPE probabilities are discrete Fourier transforms of cyclic sums of density-matrix entries. When GGG is diagonal on matrix units, grouping eigenvalues within each residue class j−ℓ mod Mj-\ell\bmod Mj−ℓmodM gives an explicit basis and the exact dimension dim⁡K=∑r∣Λr∣\dim\mathcal K=\sum_r|\Lambda_r|dimK=∑r​∣Λr​∣, with attainable bounds M≤dim⁡K≤M2−M+1M\leq\dim\mathcal K\leq M^2-M+1M≤dimK≤M2−M+1. The proof uses Fourier decomposition and Vandermonde interpolation. A solvable GKLS dephasing model yields a damped Fejér kernel and dimensions MMM, 2M−22M-22M−2, or 2M−12M-12M−1, depending on damping and detuning. Two random-unitary channels with identical first-harmonic Ramsey response have different QPE distributions.
For approximate reduction, a finite-time Gramian supplies optimal trajectory-projection subspaces. Duhamel estimates give probability-error bounds controlled by the invariance residual; errors are quadratic in perturbation strength when the unperturbed subspace is reducing and the initial state is compatible. Numerical checks reproduce the analytic model through M=64M=64M=64 and test non-Toeplitz perturbations at M=8,16,32M=8,16,32M=8,16,32.
The dimension formulas concern universal linear observable models, not necessarily physically admissible reduced quantum dynamics. Closed-form results require matrix-unit diagonality; the numerical studies are deterministic consistency checks, and the uniform residual bounds can be substantially looser than state-specific errors.
Introduction: A variational quantum classifier realises a function whose Fourier spectrum is fixed by the circuit and whose coefficients must be found by an optimiser. We study a readout borrowed from quantum phase estimation (QPE): a data-dependent operator acts on a target register through controlled powers, and the class label is read from an estimation register of m qubits after an inverse quantum Fourier transform (QFT). Materials and methods: We derive the exact readout distribution—a Fejér-weighted expansion in the moments of the operator—and characterise its Fourier spectrum for two single-qubit blocks: H ⋅ P h ⋅ R Y (family A) and a universal U 2 block (family B). All analytical statements are verified against a state-vector simulator, including attainment of the predicted spectrum. Three ablation controls alter one component each at an unchanged parameter count: the encoding QFT is removed, the exponential ladder of controlled powers is replaced by single powers, and the inverse QFT is replaced by independent Hadamard tests. The benchmark comprises 7680 training runs of 24 circuits on three tasks, with one generated dataset or one cross-validation fold as the unit of inference (twenty per sample size), exact signed-rank tests, and the corrected resampled t -test for the overlapping folds. Results: The support of every readout probability lies in parity-locked lattice cubes of maximal harmonic order 2 m + 1 . The maximal order is attained at every register size, in every feature and every outcome, except for family A with one target qubit, where the two highest orders cancel identically; the full support is attained at every register size used here ( t ≤ 4 , m ≤ 3 ), and the band is tapered towards its edge. Removing the encoding QFT costs family B 0.144 and 0.082 in test accuracy on the two-feature tasks, and replacing the power ladder by single powers costs 0.086 – 0.225 wherever m ≥ 2 ; replacing the inverse QFT by Hadamard tests has no detectable effect. The architecture leads the independently parameterised reference circuits only on the three-class task ( + 0.119 , p < 0.0001 ), where a parameter-tied re-uploading circuit with 12 rather than 20 parameters is not resolved from it ( + 0.023 , 95% confidence interval (CI)
Standard quantum phase estimation (QPE) has often been regarded as unsuitable for simultaneous detection of all eigenvalues, because it requires initial states with sufficient overlap with the target eigenstates. In this paper, we show that this limitation is not inherent to the QPE circuit itself. The output distribution of standard QPE can be written as a superposition of Fejér kernels weighted by the squared overlaps with the eigenmodes. We prove that, if the initial state is independently drawn at each shot from a 1-design (in particular, by random selection of computational basis states), these mode weights are equalized in expectation, yielding a state-averaged QPE distribution that exhibits peaks at every eigenphase location. In this sense, all eigenvalues become accessible without any modification of the standard QPE circuit; repeated eigenvalues appear through the aggregated weight of their eigenspaces. For distinct eigenphases satisfying a separation condition, we further establish a rigorous peak-detection theory and derive a sufficient shot-count estimate for detecting all peaks. We validate the theory through numerical experiments on a finite element method (FEM) matrix with 1,008 degrees of freedom arising from computer-aided engineering (CAE).
We numerically implement full quantum circuits of optimal tapered Quantum Phase Estimation (in the form of an implementable approximate bandwidth-limited DPSS taper) for the purpose of minimum eigenvalue computation, where the Hamiltonian time-evolution unitary is implemented using standard Trotterization, and the taper state is constructed using an optimized bandwidth-limited taper. We illustrate, on representative quantum Hamiltonians, with tractable exact classical numerical quantum circuit simulations, how tapered QPE performs with respect to optimal phase sampling rate, absolute error, Shannon entropy of the optimal phase distribution, when the tQPE algorithm parameters are changed. Those algorithm parameters are Trotter error, finite sampling, imperfect initial states, total evolution time, and digitization error (number of phase qubits). The reported numerical experiments include up to ℓ=10\ell=10ℓ=10 phase qubits of precision with m=3m=3m=3 additional phase-register error suppression qubits, on a 444-qubit Heisenberg quantum magnet model Hamiltonian, using up to 12th-order Trotterization. We numerically show i) the steady-state optimal phase sampling rate is determined by the initial state overlap with the ground-state, ii) with respect to phase sampling probability, or overall eigenvalue sampling error rate, there is no strong evolution time dependence for tQPE unless there is high Trotter error, iii) the approximated time-evolution unitaries in tQPE, like in standard QPE, can result in substantial ringing, which leads to non-physical eigenvalue estimates.
Quantum algorithms solve certain computational problems faster than the best known classical algorithms. Many algorithms, including Shor's for factoring, Grover's for unstructured search, and the HHL for solving linear systems, rely on quantum phase estimation (QPE) as a fundamental subroutine. The QPE protocol proceeds through the initialization of a control register in a uniform superposition, controlled unitary evolution encoding the eigenphase, and a final inverse quantum Fourier transform followed by measurement to extract the phase. Here, we address a special class of unitary operators that frequently appear in quantum Fourier transform-based protocols, cyclic group representations, and periodically evolving quantum systems. We introduce a QPE algorithm that successfully reduces the circuit complexity from O(n2)\mathcal{O}(n^2)O(n2) to O(n)\mathcal{O}(n)O(n) for a special class of unitary operators and implement it on a four-qubit photonic system. The four-qubit system is realised using a photon pair, with two qubits encoded in its polarization degree of freedom and the remaining two in its path modes. In contrast to previous photonic implementations of QPE based on dual-rail encoding and KLM protocol, where controlled operations are inherently probabilistic and thus reduce the overall success probability of phase estimation, our scheme is fully deterministic. Moreover, it is scalable to higher-dimensional unitaries, provided the underlying structure of the unitaries is preserved.
We present an algebraic framework for approximate model reduction of Markovian open quantum dynamics that guarantees complete positivity and trace preservation by construction. First, we show that projecting a Lindblad generator on its center manifold -- the space spanned by eigenoperators with purely imaginary eigenvalue -- yields an asymptotically exact reduced quantum dynamical semigroup whose dynamics is unitary, with exponentially decaying transient error controlled by the generator's spectral gap. Second, for analytic perturbations of a Lindblad generator with a tractable center manifold, we propose a perturbative reduction that keeps the reduced space fixed at the unperturbed center manifold. The resulting generator is shown to remain a valid Lindbladian; explicit finite-time error bounds that quantify leakage from the unperturbed center sector are provided. We further clarify the connection to adiabatic elimination methods, by both showing how the algebraic reduction can be directly related to a first-order adiabatic-elimination and by providing sufficient conditions under which the latter method can be applied while preserving complete positivity. We showcase the usefulness of our techniques in dissipative many-body quantum systems exhibiting non-stationary long-time dynamics.
Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.