arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

QC-PHAST搜索:用于有限池稀有区域发现的经典-量子查询基准

QC-PHAST Search: Classical--Quantum Query Benchmarks for Finite-Pool Rare-Regime Discovery

Harsh Milind Tirhekar, Chandrajit Bajaj

arXiv 2607.21995首次发表:更新:

发表机构

Department of Computer Science; College of Natural Sciences; The University of Texas at Austin; Oden Institute for Computational Engineering and Sciences(计算机科学系; 自然科学学院; 德克萨斯大学奥斯汀分校; 计算工程与科学奥登研究所)

机构由 AI 辅助整理,请以论文原文为准。

AI 中文总结

研究参数化动力系统稀有区域发现问题,引入QC-PHAST协议和框架,利用科学元数据等评估搜索方式,以量子行作参考,通过多种手段确定何时经典或资源感知搜索占优,给出可审计协议。

AI 中文摘要

参数化动力系统中的稀有区域发现是一个主动搜索问题:找到一个经过验证的参数,在该参数处跨越科学定义的定性阈值,即使可接受的候选参数很少、非凸或分散。我们引入了量子-经典相空间和稳定性阈值搜索(QC-PHAST),这是一种用于有限候选库的证据门控决策协议和查询计数框架。一个候选参数会引发一个动态对象、模拟器得出的临界分数以及经过验证的首次命中谓词。科学元数据和带电试点证据用于评估方程感知搜索、标量分数主动搜索、仅谓词搜索或仅查询模型比较是否可行。量子行是继承的格罗弗/博耶-布拉萨德-霍耶-塔普(BBHT)未知-M标记集查询参考;它不是一个新的量子搜索定理、具体电路或硬件加速声明。结果是一个区域图。直接边界构造、几何控制、在线模拟器循环和学习标签计数进一步确定何时经典结构、误报、校准成本或状态制备会消除查询模型的优势。因此,QC-PHAST是一个可审计的协议,用于决定有限池标记集参考何时具有信息性,以及何时经典或资源感知搜索应占主导地位。

英文摘要

Rare-regime discovery in parameterized dynamical systems is an active-search problem: find one verified parameter at which a scientifically defined qualitative threshold is crossed, even when acceptable candidates are rare, nonconvex, or fragmented. We introduce Quantum-Classical Phase-space and Stability-Threshold Search (QC-PHAST), an evidence-gated decision protocol and query-accounting framework for finite candidate libraries. A candidate induces a dynamical object, simulator-derived criticality score, and verified first-hit predicate. Scientific metadata and charged pilot evidence are used to assess whether equation-aware search, scalar-score active search, predicate-only search, or only a query-model comparison is admissible. The quantum row is the inherited Grover/Boyer--Brassard--Hoyer--Tapp (BBHT) unknown-$M$ marked-set query reference; it is not a new quantum-search theorem, materialized circuit, or hardware-speedup claim. The result is a regime map. Direct boundary constructions, geometry controls, online simulator loops, and learned-label accounting further identify when classical structure, false positives, calibration cost, or state preparation erases the query-model margin. QC-PHAST is therefore an auditable protocol for deciding when a finite-pool marked-set reference is informative and when classical or resource-aware search should dominate.

Comments70 pages, 16 figures, 36 tables

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑