Accelerated search for global extrema in structured quantum signals

Abstract

Extreme values of a physical system are rare by definition, yet they can govern some of its most consequential and anomalous behavior. Their sparsity makes them particularly costly to identify in large data sets. Quantum computation offers a potential way to reduce this cost. The challenge is that quantum amplitudes cannot simply be read, copied, compared, or marked using conventional search oracles. Here we introduce an algorithm for searching amplitude-encoded quantum signals that exploits their underlying structure. Through a nonlinear amplitude transformation, the algorithm identifies and certifies a global extremum while exponentially reducing the effective search space for structured signals. We establish a polylogarithmic query complexity in the data size N, together with global completeness, efficient classical verification, and a measurable criterion for quantifying exploitable structure. We demonstrate the framework using computational turbulence data. Applied to line cuts of velocity gradients from a 1024³ simulation containing more than one billion grid points, the algorithm consistently isolates the extreme tail and reduces the median search space to O(log N). The clustered structure characteristic of turbulence further accelerates the search. These results establish a direct connection between physical structure and quantum advantage in extreme-value search. For accessibility, the main text emphasizes the central ideas and results, while the theoretical derivations are provided in the Appendices.

Structured Extrema Errors in Classical Surrogates for Viscous Burgers: A Physics-Consistent Interpretation
Youssef Oubari
arXiv7 Sep 2026PreprintCC BY 4.0Full textFluid dynamicsarXiv
Dark-field Search for Quantum Vacuum Signals in the Low-Energy Regime
Aimé Matheron, Michal Šmíd, Felix Karbstein +52
arXiv29 Oct 2026PreprintCC BY 4.0Full textHigh-energy & particle physics Optics & photonicsarXiv
GPU-accelerated Bayesian inference for diffracted gravitational wave signals
Zihao Lin, Jef Heynen, Mick Wright +3
arXiv19 Oct 2026PreprintCC BY-NC-SA 4.0Full textGravitation & general relativityarXiv
In search for signals of the DD̅ bound state X(3700) from study of the B⁺ → D⁺ D^- K⁺, B⁰ → D⁺ D^- K⁰ and Λ_b → D⁺ D^- Λ reactions
Xiu-Lei Ren, Hai-Peng Li, Wei-Hong Liang +2
arXiv5 Sep 2026PreprintCC BY 4.0Full textHigh-energy & particle physicsarXiv
Unifying stochastic and deterministic signals: a practical search for the intermittent binary black-hole background
Tore Boybeyi, Vuk Mandic, Joseph Romano
arXiv28 Oct 2026PreprintarXiv licenceFull textCosmology High-energy astrophysicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{bharadwaj2026accelerated,
  title = {{Accelerated search for global extrema in structured quantum signals}},
  author = {Sachin S. Bharadwaj and Katepalli R. Sreenivasan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.04024},
  eprint = {2610.04024},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.04024},
}

RIS

TY  - UNPB
TI  - Accelerated search for global extrema in structured quantum signals
AU  - Sachin S. Bharadwaj
AU  - Katepalli R. Sreenivasan
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.04024
UR  - https://arxiv.org/abs/2610.04024
AB  - Extreme values of a physical system are rare by definition, yet they can govern some of its most consequential and anomalous behavior. Their sparsity makes them particularly costly to identify in large data sets. Quantum computation offers a potential way to reduce this cost. The challenge is that quantum amplitudes cannot simply be read, copied, compared, or marked using conventional search oracles. Here we introduce an algorithm for searching amplitude-encoded quantum signals that exploits their underlying structure. Through a nonlinear amplitude transformation, the algorithm identifies and certifies a global extremum while exponentially reducing the effective search space for structured signals. We establish a polylogarithmic query complexity in the data size N, together with global completeness, efficient classical verification, and a measurable criterion for quantifying exploitable structure. We demonstrate the framework using computational turbulence data. Applied to line cuts of velocity gradients from a 1024^3 simulation containing more than one billion grid points, the algorithm consistently isolates the extreme tail and reduces the median search space to O(log N). The clustered structure characteristic of turbulence further accelerates the search. These results establish a direct connection between physical structure and quantum advantage in extreme-value search. For accessibility, the main text emphasizes the central ideas and results, while the theoretical derivations are provided in the Appendices.
ER  -

Abstract

Related

Cite