Metraipolis › archive › dc_ff96201c07d1
QuantumMind: Constraint-Grounded Agentic Reasoning for Speedup Analysis in Quantum Computing — arXiv:2608.07743
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.07743
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T06:49:30.546Z
- SHA-256 of the archived text
9ebc7cd3f979dd292ed9a587f9dbb11bcb50151fd15b00c946a850e001d2a286- Stable URL of this page
https://metraipolis.com/documento/dc_ff96201c07d1
How to cite
QuantumMind: Constraint-Grounded Agentic Reasoning for Speedup Analysis in Quantum Computing — arXiv:2608.07743 — arXiv (en), https://arxiv.org/abs/2608.07743 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ff96201c07d1 (Metraipolis archive dc_ff96201c07d1, sha256 9ebc7cd3f979dd292ed9a587f9dbb11bcb50151fd15b00c946a850e001d2a286)
BibTeX
@misc{dcff96201c07d1,
title = {QuantumMind: Constraint-Grounded Agentic Reasoning for Speedup Analysis in Quantum Computing — arXiv:2608.07743},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.07743},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ff96201c07d1; sha256 9ebc7cd3f979dd292ed9a587f9dbb11bcb50151fd15b00c946a850e001d2a286},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.07743. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Identifying a meaningful quantum speedup requires more than matching a classical problem to a familiar quantum primitive: the claim must preserve the task, respect access and output models, expose required promises, and remain within a defensible complexity scope. We present QuantumMind, an auditable agentic workflow for generating and conservatively screening quantum-acceleration hypotheses. A fixed sequence of typed, role-specialized actions formalizes the public task, analyzes structure and classical bottlenecks, matches a source-linked registry of quantum primitives and barriers, and constructs a scoped candidate scheme. A deterministic ten-check validator assigns the authoritative verdict; completed states are compiled into a Quantum Acceleration Evidence Graph and passed through a downward-only research screen that cannot strengthen the decision. We evaluate QuantumMind against seven task-adapted prompting and agentic controls on 582 identical open-discovery tasks. Under the frozen Open-Discovery Score (ODS), QuantumMind obtains 53.1 mean ODS, exceeding the strongest baseline by 17.3 points (48.2% relative), and wins 355 of 582 paired tasks against that baseline. It passes the graph audit on 99.8% of tasks, compared with 43.6% for the strongest baseline, and ranks first in all seven task families. The results indicate that typed state transitions and deterministic evidence control contribute beyond fluent generation alone. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-11 in cs.MA). Categorie arXiv: Artificial Intelligence (cs.AI) ; Multiagent Systems (cs.MA). Pagina del lavoro: https://arxiv.org/abs/2608.07743 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T06:45:31.704Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).