Response-Threshold Framework for First-Peak Preservation in Noisy Grover Search

Grover search is executed only after integer iterations, so noise can alter the stopping decision even when a continuous first peak remains visible. We develop a response-threshold framework separating continuous peak motion, stroboscopic geometry, and the discrete sampled-success argmax. For a Drude-Lorentz environment, linearized HEOM supplies an a priori timing coefficient and sampled-probability differentials. The first-order layer is used as a conservative screen: well-separated points retain the nominal step, whereas near-threshold points escalate to finite-$λ$ evaluation. Across 260 unique HEOM points drawn from five overlapping validation sets, it detects all 15 observed stopping changes with zero regret on the changed subset; its residual errors are 45 one-step-early calls on otherwise stable points; the 245-point stable subset has mean regret $4.42\times10^{-3}$. An empirically validated two-stage workflow escalates every observed change while avoiding 160 of 260 unique full-HEOM propagations. Same-bath NZ2 reduces early calls. A heterogeneous three-qubit circuit exhibits three stopping-transition scales, each replicated across eight marked targets, and finite-shot recovery is 96.18% overall, with failures localized to a near-degenerate boundary at $s=1.5$. A depth-refined transfer test supports the predicted local quadratic timing-to-loss relation.

Authors

Institutions

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20339
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Response-Threshold Framework for First-Peak Preservation in Noisy Grover Search

Chetan Arora, Charith Jayasekara, Nisal De Silva, Ge Zhong
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

Response-Threshold Framework for First-Peak Preservation in Noisy Grover Search

Chetan Arora, Charith Jayasekara, Nisal De Silva, Ge Zhong
preprint en

Abstract

Grover search is executed only after integer iterations, so noise can alter the stopping decision even when a continuous first peak remains visible. We develop a response-threshold framework separating continuous peak motion, stroboscopic geometry, and the discrete sampled-success argmax. For a Drude-Lorentz environment, linearized HEOM supplies an a priori timing coefficient and sampled-probability differentials. The first-order layer is used as a conservative screen: well-separated points retain the nominal step, whereas near-threshold points escalate to finite-$λ$ evaluation. Across 260 unique HEOM points drawn from five overlapping validation sets, it detects all 15 observed stopping changes with zero regret on the changed subset; its residual errors are 45 one-step-early calls on otherwise stable points; the 245-point stable subset has mean regret $4.42\times10^{-3}$. An empirically validated two-stage workflow escalates every observed change while avoiding 160 of 260 unique full-HEOM propagations. Same-bath NZ2 reduces early calls. A heterogeneous three-qubit circuit exhibits three stopping-transition scales, each replicated across eight marked targets, and finite-shot recovery is 96.18% overall, with failures localized to a near-degenerate boundary at $s=1.5$. A depth-refined transfer test supports the predicted local quadratic timing-to-loss relation.

arXiv (Cornell University)
Monash University (AU)
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.

Laika access coming soon