Do Quantum AIs Dream in Paths? Path-Integral Slow Thinking through Grover Interference
Not on the map. Why?
Abstract (arXiv)
Reinforcement learning with verifiable rewards enables large language models to think slowly, but the same training can induce policy collapse: probability concentrates onto a few successful trajectories and exploratory diversity erodes. We ask whether quantum AI can realize slow thinking differently. We formulate slow thinking as coherent dynamics over reasoning trajectories, a discrete path integral in which action sequences coexist in superposition and recombine before measurement. In our trainable realization, an exact verifier partitions the ensemble into collective accepted and rejected components that interfere under Grover amplitude amplification. A finite Grover evolution is maximized when the pre-amplification success probability lies at an analytically determined value below one, so inference itself defines an interior training target and removes the monotonic pressure toward unit success. In exact statevector simulations of a 2x3 sliding puzzle, Grover training reaches accuracy 0.95 on a 32-question training set at one round, against 0.73 for the strongest classical control. On held-out questions specialization has a cost: an untrained uniform policy read out through the same amplification remains the strongest reference on this solution-dense benchmark, and quantum training preserves far more held-out accuracy than classical training - at four rounds with matched circuit applications the two quantum models reach 3.2 and 3.9 times the strongest classical controls. The number of training questions supported by fixed-size policies trained at each amplification budget also grows faster with the budget than with matched classical repetition. These results establish a Grover-based realization of path-integral slow thinking: the interior target preserves exploratory path diversity, and ensemble-level interference converts it into verified performance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 41 references that are in the map. First posted on arXiv 5 Sep 2026.
Builds on
17 of 41 references.
References · 17
- 2017Attention Is All You Needcited by 60,361
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,986
- 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 991
- 2025Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?cited by 982
- 2025The Entropy Mechanism of Reinforcement Learning for Reasoning Language Modelscited by 485
- 2021Parametrized quantum policies for reinforcement learningcited by 90
- 2024Inference-Aware Fine-Tuning for Best-of-N Sampling in Large Language Modelscited by 89
- 2025Rethinking Fine-Tuning when Scaling Test-Time Compute: Limiting Confidence Improves Mathematical Reasoningcited by 29
- 2018Learning and Inference on Generative Adversarial Quantum Circuitscited by 22
- 2022Quantum Policy Iteration via Amplitude Estimation and Grover Search -- Towards Quantum Advantage for Reinforcement Learningcited by 21
5 more
- 2026Understanding Diversity Collapse in RLVR via the Lens of Overtrainingcited by 10
- 2025Emergent Slow Thinking in LLMs as Inverse Tree Freezingcited by 8
- 2025Learning-at-Criticality in Large Language Models for Quantum Field Theory and Beyondcited by 5
- 2024Quantum framework for Reinforcement Learning: Integrating Markov decision process, quantum arithmetic, and trajectory searchcited by 3
- 2025Scalable Quantum Reinforcement Learning on NISQ Devices with Dynamic-Circuit Qubit Reuse and Grover Optimizationcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026QuantumMind: Constraint-Grounded Agentic Reasoning for Speedup Analysis in Quantum Computing
- 2025Quantum Bayesian Networks Can Speed up Reinforcement Learning in Partially Observable Environments
- 2026Reinforcement learning for quantum processes with memory
- 2025Quantum Decision Transformers (QDT): Synergistic Entanglement and Interference for Offline Reinforcement Learning
- 2025Quantum AIXI: Universal Intelligence via Quantum Information
- 2025PEPS: Quantum-Inspired Reinforcement Learning for Coherent Reasoning Traces in LLMs
- 2026Quantum entanglement provides a competitive advantage in adversarial games
- 2024Quantum Reinforcement Learning in Non-Abelian Environments: Unveiling Novel Formulations and Quantum Advantage Exploration