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

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

Harsh Milind Tirhekar, Chandrajit Bajaj

quant-phcs.ETcs.LGSubmitted Jul 24, 2026• Announced Jul 27, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Comments
70 pages, 16 figures, 36 tables

Related papers

The Quantum Pi Benchmark: Definitions, Evidence Rules, and a Non-Total Capability Grid for Quantum Hardware

B. Katz

The Quantum Pi Benchmark (QPB) is a family of verification, search, counting, frequency-estimation, and collision tasks over the digits of Pi. It is designed as an architecture-neutral specification of mathematically fixed instances, classical comparators, resource boundaries, and admissible claims. The specification fixes zero-based indexing, binary and hexadecimal digit conventions, dense and sparse candidate domains, and task-specific payloads for target-bearing and collision problems. It separates three independent properties that benchmark descriptions can conflate: digit access (lookup or direct), oracle-construction provenance (P0–P4), and controller blindness (B0 or B1). A non-total capability grid retains codes R0–R12 as stable claim labels while stating their named dependencies; a higher-numbered code does not automatically inherit every lower-numbered capability. The evidence protocol requires pre-execution validation, routed-resource accounting, preservation of raw outcomes, outcome-independent eligibility, visible conditioning, uncertainty estimates, protocol separation, and formal record freezing. Collision scaling is stated as a heuristic candidate-domain model: birthday behavior gives D_h = Θ(16^(h/2)), while element distinctness gives O(D_h^(2/3)) coherent queries only under declared access and memory assumptions. These query bounds do not establish the earliest repeat, a quantum frontier, or end-to-end advantage. Frontier status depends on a current classical post-hoc resource audit; advantage requires a predeclared matched cost comparison that includes preparation, oracle construction, error correction, sampling, readout, and verification. The resulting framework classifies future Pi-derived experiments without importing device-specific performance into the foundational definition.

•Aug 28, 2026•0 citations

An Adaptive Quantum Search Framework under Unknown Solution-density: Minimizing Expected Queries to the First Solution

Wiwat Asawalertsak, Rajchawit Sarochawikasit

Grover's algorithm provides a mathematically optimal quadratic speedup for unstructured search, yet its standard formulation relies on a critical prerequisite: prior knowledge of the target solution count to determine the number of algorithm iterations. Although numerous strategies have been developed to identify or bypass this parameter, comparing them directly is nontrivial. This study investigates and computationally optimizes 3 prominent frameworks: Boyer-Brassard-Hoyer-Tapp, Fixed-Point search, and Density Estimation Methods. Density-specific benchmarks select the best tested method and configuration to minimize expected first-solution queries under 2 initialization-cost conventions. To translate these theoretical benchmarks into practical utility, a hybrid quantum-classical adaptive framework integrating Hill-climbing-assisted Grover Adaptive Search with state-space density estimation modeled via the Wang-Landau algorithm is proposed as a potential use-case. This implementation operates directly on the optimized query methods established earlier. Analytical models support the approach; ideal simulations show 18.8%-63.4% lower mean accumulated query costs than the tested randomized and fixed-point baselines.

arXiv:2611.09688•Nov 6, 2026•0 citations

One Axiom : The Geometry of Quantum Search

Robert Spychalski

2M: The Geometry of Quantum Search – $\sqrt{N}$ as Minimum Orbit Length and a Structural Unification of BBBV and Classical Simulability Abstract: Document 2M provides a rigorous geometric derivation of quantum search complexity lower bounds within the ONE AXIOM framework. It demonstrates that the $\Omega(\sqrt{N})$ quantum query lower bound is not merely a limitation of computational models, but the minimum orbit length required by $\sigma$-contractive dynamics in the coherence search space $(U_{\mathcal{M}},d_{\alpha})$ derived from Axiom M. The paper introduces and proves the Bridge Theorem (BT), which establishes a formal, bidirectional equivalence between the standard oracle query model and the $\sigma$-orbit model, preserving complexity across both tracks. By mapping queries to orbit steps, the $\Omega(\sqrt{N})$ lower bound is shown to follow from the geometric requirement of traversing a specific coherence angle to reach a target of measure $1/N$. Key Contributions: Geometric Lower Bound (T3): A first-principles derivation of the $\sqrt{N}$ bound as a traversal fact in a conservative Orbital Coherence Flow (OCF) field. Grover Uniqueness (T4): Formally proves that Grover’s algorithm is the unique $T_{min}$-optimal trajectory within the coherence geometry. BBBV–Schuster Unification (T8): Bridges the 27-year gap between the BBBV theorem (1997) and recent results on the classical simulability of noisy circuits (Schuster et al., 2024). It proves they are two regimes of a single structural condition: the maintenance or destruction of the coherence fixed point $M(x^*) = x^*$. The 13/64 Threshold (T8-III): Derives the algebraic boundary $f_F = 13/64$ (from the ABC 51:13 partition) as a structural upper bound on the ALLOWED region. The ALLOWED/FORBIDDEN dichotomy is proven independently of this value (Proposition CS-impl); the exact numerical identification of $f_F$ with the Schuster empirical threshold is an open calibration task. Context: Documents 0M: The M — One Axiom, ABC: Coherence, and 0A: Foundation

•Apr 25, 2026•5 citations

Quantum Algorithms for Trading: A Survey of Speedups, Thresholds, and Dequantization

Luigi Laura, Marco Parrillo, Alessio Pascucci +2 more

Quantum algorithms for trading span computational tasks with different input models and standards of evidence. This structured critical review describes its search scope, selection criteria and limitations, and distinguishes reported findings from author assessments. Amplitude estimation estimates bounded expectations to additive error ϵ with O(ϵ−1) oracle queries rather than the O(ϵ−2) samples of plain classical Monte Carlo at fixed confidence. This query advantage does not establish an end-to-end runtime advantage: state preparation, arithmetic, error correction and classical competitors must also be costed. Published resource estimates for benchmark exotics require thousands of logical qubits and demanding logical operation rates. An illustrative sensitivity analysis shows how the crossover depends on classical throughput, oracle depth and the comparison window; its numbers are scenarios, not calibrated hardware forecasts. Portfolio and trading-trajectory formulations have device demonstrations, but a 250-instance benchmark of discretized minimum-variance allocation finds classical mixed-integer programming and a tailored heuristic superior on the tested formulation. Specific low-rank quantum machine learning algorithms have been dequantized under analogous sampling-access assumptions. Separately, a controlled study of quantum kernels for Chinese equity returns finds no significant advantage and demonstrates sensitivity to evaluation design; this does not settle other learning tasks. Entanglement-assisted coordination offers advantages in specified nonlocal games without computational-complexity assumptions, while its financial implementation and economics remain open. We distinguish computational performance from economic value and identify input/output costs, structured algorithms, reproducible benchmarking and explicit financial evaluation as priorities.

Information•Sep 17, 2026•0 citations

Open-System Adiabatic Quantum Search under Dephasing

Afaf El Kalai, Peter J. Eder, Christian B. Mendl

Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing Lindbladians, Avron et al. [Phys. Rev. A 82, 040304(R) (2010)] showed that a unique timetable exists that maximizes the fidelity with a target state. This optimal schedule is characterized by a constant tunneling rate along the adiabatic path. In this work, we revisit their analysis and apply it to the adiabatic Grover search framework, obtaining closed-form expressions for the optimal evolution schedule, the minimum runtime, and the resulting achievable fidelity. Moreover, by invoking an energy-time uncertainty argument, we identify a critical dephasing threshold beyond which further noise-assisted acceleration is prohibited, showing that the apparent advantage of strong dephasing is a Zeno-type stabilization mechanism rather than a conventional algorithmic speedup over unitary Grover search.

quant-pharXiv:2603.28506•Physical Review A•Mar 31, 2026•0 citations

QALBench: A Tiered Audit Benchmark and Reference Implementation for Quantum Artificial-Life Claims

Gabriel Kahen

Quantum artificial-life (QAL) claims combine two demanding vocabularies. Artificial-life labels such as inheritance, mutation, interaction, turnover, and selection require population records and lineage controls. Quantum-resource labels such as coherence, entanglement, Bell nonlocality, and channel resources require resource diagnostics and resource-destroying controls. QALBench makes these claims independently auditable. It is a tiered benchmark suite and reference implementation that separates artificial-life adequacy, quantum-resource evidence, and computational nonclassicality. The reference results are deliberately diagnostic. Under matched seeds, basis-selection demographic, phenotype, and lineage summaries are identical for the quantum, dephased, and classical controls, excluding resource diagnostics. A software positive-control assay inserts a stored negativity-derived birth-event score into the reproduction rule and shows that resource-coupled reproduction is removed by dephasing or Markov controls. A no-inheritance resource control remains resource-positive but transmission-negative, establishing that resource-coupled reproduction and inherited resource-mediated artificial life are distinct claims. QALBench also supplies finite-shot certification and simulator-challenge submission workflows for external evidence. Its included reference packages exercise those workflows without asserting quantum advantage, loophole-free hardware certification, open-ended evolution, or persistent population-level entanglement.

•May 23, 2026•0 citations
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-MMM 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.
The Quantum Pi Benchmark (QPB) is a family of verification, search, counting, frequency-estimation, and collision tasks over the digits of Pi. It is designed as an architecture-neutral specification of mathematically fixed instances, classical comparators, resource boundaries, and admissible claims. The specification fixes zero-based indexing, binary and hexadecimal digit conventions, dense and sparse candidate domains, and task-specific payloads for target-bearing and collision problems. It separates three independent properties that benchmark descriptions can conflate: digit access (lookup or direct), oracle-construction provenance (P0–P4), and controller blindness (B0 or B1). A non-total capability grid retains codes R0–R12 as stable claim labels while stating their named dependencies; a higher-numbered code does not automatically inherit every lower-numbered capability. The evidence protocol requires pre-execution validation, routed-resource accounting, preservation of raw outcomes, outcome-independent eligibility, visible conditioning, uncertainty estimates, protocol separation, and formal record freezing. Collision scaling is stated as a heuristic candidate-domain model: birthday behavior gives D_h = Θ(16^(h/2)), while element distinctness gives O(D_h^(2/3)) coherent queries only under declared access and memory assumptions. These query bounds do not establish the earliest repeat, a quantum frontier, or end-to-end advantage. Frontier status depends on a current classical post-hoc resource audit; advantage requires a predeclared matched cost comparison that includes preparation, oracle construction, error correction, sampling, readout, and verification. The resulting framework classifies future Pi-derived experiments without importing device-specific performance into the foundational definition.
Grover's algorithm provides a mathematically optimal quadratic speedup for unstructured search, yet its standard formulation relies on a critical prerequisite: prior knowledge of the target solution count to determine the number of algorithm iterations. Although numerous strategies have been developed to identify or bypass this parameter, comparing them directly is nontrivial. This study investigates and computationally optimizes 3 prominent frameworks: Boyer-Brassard-Hoyer-Tapp, Fixed-Point search, and Density Estimation Methods. Density-specific benchmarks select the best tested method and configuration to minimize expected first-solution queries under 2 initialization-cost conventions. To translate these theoretical benchmarks into practical utility, a hybrid quantum-classical adaptive framework integrating Hill-climbing-assisted Grover Adaptive Search with state-space density estimation modeled via the Wang-Landau algorithm is proposed as a potential use-case. This implementation operates directly on the optimized query methods established earlier. Analytical models support the approach; ideal simulations show 18.8%-63.4% lower mean accumulated query costs than the tested randomized and fixed-point baselines.
2M: The Geometry of Quantum Search – N\sqrt{N}N​ as Minimum Orbit Length and a Structural Unification of BBBV and Classical Simulability Abstract: Document 2M provides a rigorous geometric derivation of quantum search complexity lower bounds within the ONE AXIOM framework. It demonstrates that the Ω(N)\Omega(\sqrt{N})Ω(N​) quantum query lower bound is not merely a limitation of computational models, but the minimum orbit length required by σ\sigmaσ-contractive dynamics in the coherence search space (UM,dα)(U_{\mathcal{M}},d_{\alpha})(UM​,dα​) derived from Axiom M. The paper introduces and proves the Bridge Theorem (BT), which establishes a formal, bidirectional equivalence between the standard oracle query model and the σ\sigmaσ-orbit model, preserving complexity across both tracks. By mapping queries to orbit steps, the Ω(N)\Omega(\sqrt{N})Ω(N​) lower bound is shown to follow from the geometric requirement of traversing a specific coherence angle to reach a target of measure 1/N1/N1/N. Key Contributions: Geometric Lower Bound (T3): A first-principles derivation of the N\sqrt{N}N​ bound as a traversal fact in a conservative Orbital Coherence Flow (OCF) field. Grover Uniqueness (T4): Formally proves that Grover’s algorithm is the unique TminT_{min}Tmin​-optimal trajectory within the coherence geometry. BBBV–Schuster Unification (T8): Bridges the 27-year gap between the BBBV theorem (1997) and recent results on the classical simulability of noisy circuits (Schuster et al., 2024). It proves they are two regimes of a single structural condition: the maintenance or destruction of the coherence fixed point M(x∗)=x∗M(x^*) = x^*M(x∗)=x∗. The 13/64 Threshold (T8-III): Derives the algebraic boundary fF=13/64f_F = 13/64fF​=13/64 (from the ABC 51:13 partition) as a structural upper bound on the ALLOWED region. The ALLOWED/FORBIDDEN dichotomy is proven independently of this value (Proposition CS-impl); the exact numerical identification of fFf_FfF​ with the Schuster empirical threshold is an open calibration task. Context: Documents 0M: The M — One Axiom, ABC: Coherence, and 0A: Foundation
Quantum algorithms for trading span computational tasks with different input models and standards of evidence. This structured critical review describes its search scope, selection criteria and limitations, and distinguishes reported findings from author assessments. Amplitude estimation estimates bounded expectations to additive error ϵ with O(ϵ−1) oracle queries rather than the O(ϵ−2) samples of plain classical Monte Carlo at fixed confidence. This query advantage does not establish an end-to-end runtime advantage: state preparation, arithmetic, error correction and classical competitors must also be costed. Published resource estimates for benchmark exotics require thousands of logical qubits and demanding logical operation rates. An illustrative sensitivity analysis shows how the crossover depends on classical throughput, oracle depth and the comparison window; its numbers are scenarios, not calibrated hardware forecasts. Portfolio and trading-trajectory formulations have device demonstrations, but a 250-instance benchmark of discretized minimum-variance allocation finds classical mixed-integer programming and a tailored heuristic superior on the tested formulation. Specific low-rank quantum machine learning algorithms have been dequantized under analogous sampling-access assumptions. Separately, a controlled study of quantum kernels for Chinese equity returns finds no significant advantage and demonstrates sensitivity to evaluation design; this does not settle other learning tasks. Entanglement-assisted coordination offers advantages in specified nonlocal games without computational-complexity assumptions, while its financial implementation and economics remain open. We distinguish computational performance from economic value and identify input/output costs, structured algorithms, reproducible benchmarking and explicit financial evaluation as priorities.
Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing Lindbladians, Avron et al. [Phys. Rev. A 82, 040304(R) (2010)] showed that a unique timetable exists that maximizes the fidelity with a target state. This optimal schedule is characterized by a constant tunneling rate along the adiabatic path. In this work, we revisit their analysis and apply it to the adiabatic Grover search framework, obtaining closed-form expressions for the optimal evolution schedule, the minimum runtime, and the resulting achievable fidelity. Moreover, by invoking an energy-time uncertainty argument, we identify a critical dephasing threshold beyond which further noise-assisted acceleration is prohibited, showing that the apparent advantage of strong dephasing is a Zeno-type stabilization mechanism rather than a conventional algorithmic speedup over unitary Grover search.
Quantum artificial-life (QAL) claims combine two demanding vocabularies. Artificial-life labels such as inheritance, mutation, interaction, turnover, and selection require population records and lineage controls. Quantum-resource labels such as coherence, entanglement, Bell nonlocality, and channel resources require resource diagnostics and resource-destroying controls. QALBench makes these claims independently auditable. It is a tiered benchmark suite and reference implementation that separates artificial-life adequacy, quantum-resource evidence, and computational nonclassicality. The reference results are deliberately diagnostic. Under matched seeds, basis-selection demographic, phenotype, and lineage summaries are identical for the quantum, dephased, and classical controls, excluding resource diagnostics. A software positive-control assay inserts a stored negativity-derived birth-event score into the reproduction rule and shows that resource-coupled reproduction is removed by dephasing or Markov controls. A no-inheritance resource control remains resource-positive but transmission-negative, establishing that resource-coupled reproduction and inherited resource-mediated artificial life are distinct claims. QALBench also supplies finite-shot certification and simulator-challenge submission workflows for external evidence. Its included reference packages exercise those workflows without asserting quantum advantage, loophole-free hardware certification, open-ended evolution, or persistent population-level entanglement.