Spectral theory of energy-selective quantum search with Ising Hamiltonian phase oracles

We develop an exact spectral-response theory for the Grover-type iterate \(W_T=D_ξ\exp(-\ii T H)\), in which the evolution generated by a diagonal Ising Hamiltonian is used directly as a continuous phase oracle. An energy-grouped recurrence and its generating-function solution show how the empirical characteristic function determines the position, width, height, and saturation time of an energy-selective resonance. For an annealed Gaussian density of states, a high-density-tail resonance containing \(M\) configurations is reached after \(Θ(\sqrt{2^n/M})\) oracle calls with success probability \(Θ(1)\), giving a quadratic query improvement over independent uniform sampling with classical energy evaluation. For correlated random Ising spectra, overlap-dependent covariances lead to a realization-dependent resonance shift with root-mean-square scale \(O(n^{-3})\), parametrically larger than the resonance width, and can also reduce the peak height. The shift is both an algorithmic detuning and a coherent probe of sample-specific spectral fluctuations whose ensemble statistics reflect the Ising overlap structure. Spectral symmetrization and iterative calibration can remove or compensate the resonance-center displacement for prescribed-energy targeting. We also clarify the relation to designed spectral filters and the precision and coherence requirements of this asymptotic primitive.

Authors

Publication Details

Journal
Physical Review A
Published
2026-10-15
DOI
https://doi.org/10.1103/tgsx-5nz4
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Spectral theory of energy-selective quantum search with Ising Hamiltonian phase oracles

W. V. Pogosov, Andrey S. Plyashechnik, A. V. Lebedev, A. A. Zhukov
Physical Review A
Quantum Computing Algorithms and Architecture
article

Spectral theory of energy-selective quantum search with Ising Hamiltonian phase oracles

W. V. Pogosov, Andrey S. Plyashechnik, A. V. Lebedev, A. A. Zhukov
article en

Abstract

We develop an exact spectral-response theory for the Grover-type iterate \(W_T=D_ξ\exp(-\ii T H)\), in which the evolution generated by a diagonal Ising Hamiltonian is used directly as a continuous phase oracle. An energy-grouped recurrence and its generating-function solution show how the empirical characteristic function determines the position, width, height, and saturation time of an energy-selective resonance. For an annealed Gaussian density of states, a high-density-tail resonance containing \(M\) configurations is reached after \(Θ(\sqrt{2^n/M})\) oracle calls with success probability \(Θ(1)\), giving a quadratic query improvement over independent uniform sampling with classical energy evaluation. For correlated random Ising spectra, overlap-dependent covariances lead to a realization-dependent resonance shift with root-mean-square scale \(O(n^{-3})\), parametrically larger than the resonance width, and can also reduce the peak height. The shift is both an algorithmic detuning and a coherent probe of sample-specific spectral fluctuations whose ensemble statistics reflect the Ising overlap structure. Spectral symmetrization and iterative calibration can remove or compensate the resonance-center displacement for prescribed-energy targeting. We also clarify the relation to designed spectral filters and the precision and coherence requirements of this asymptotic primitive.

Physical Review A
Openalex Percentile: Top 61%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.