Metraipolis › archive › dc_3f231d31e503
QART: A Quantum-Classical Hybrid Architecture for Long-Horizon Reasoning -- Exploring a Conditional Path toward Quantum Scaling — arXiv:2609.16887
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.16887
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T18:32:16.047Z
- SHA-256 of the archived text
f8a72e88996c1725dacac96250bb0607f1f3d9d3c1bad55ebe1eb42e1dea3dd9- Stable URL of this page
https://metraipolis.com/documento/dc_3f231d31e503
How to cite
QART: A Quantum-Classical Hybrid Architecture for Long-Horizon Reasoning -- Exploring a Conditional Path toward Quantum Scaling — arXiv:2609.16887 — arXiv (en), https://arxiv.org/abs/2609.16887 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3f231d31e503 (Metraipolis archive dc_3f231d31e503, sha256 f8a72e88996c1725dacac96250bb0607f1f3d9d3c1bad55ebe1eb42e1dea3dd9)
BibTeX
@misc{dc3f231d31e503,
title = {QART: A Quantum-Classical Hybrid Architecture for Long-Horizon Reasoning -- Exploring a Conditional Path toward Quantum Scaling — arXiv:2609.16887},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.16887},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3f231d31e503; sha256 f8a72e88996c1725dacac96250bb0607f1f3d9d3c1bad55ebe1eb42e1dea3dd9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.16887. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Long-horizon reasoning is vulnerable to early errors that compromise later decisions. We present QART, the Quantum-Augmented Reasoning Transformer, a quantum--classical hybrid architecture combining a backbone language model with quantum encoding, CIM-based QUBO optimization, and quantum decoding. Semantic information can come from hidden representations or model-generated text; detailed encoding and optimization procedures remain proprietary. Under explicit assumptions, we establish a conditional asymptotic reliability separation from single-trajectory autoregressive LLMs. For a common task family with aligned optimality and acceptance criteria, autoregressive acceptance probability tends to zero when cumulative conditional risk of irreversible errors diverges. QART's task-optimal-path recovery probability remains bounded away from zero if conditional probabilities for optimal-path coverage and semantic fidelity, spectral certification, dynamical reachability, and faithful readout remain uniformly positive under a specified resource schedule. The architecture alone does not imply these bounds. Paired measurements on six long-horizon benchmarks using DeepSeek V4 Flash, GLM-5.3, and GPT-5.5 xhigh in a Codex agent environment favor QART in 14 of 15 backbone--benchmark pairs. Relative gains reach 84.0% on SciCode, 47.6% on $\tau^3$-Bench, and 44.4% on Terminal-Bench 4.0; the DeepSeek V4 Flash configuration regresses by 7.8% on DeepSWE. These results do not directly validate the asymptotic separation. Potential quantum scaling laws are formulated as conditional hypotheses. A quantum-advantage interpretation requires a demonstrated CIM quantum advantage over strong classical solvers and its transfer to end-to-end reasoning after all system overheads. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-16 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2609.16887 — 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-15T18:03:09.487Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-16?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).