arXiv:2601. 10034v2 Announce Type: cross Abstract: Decision making often exhibits context dependence that challenges classical probability theory.
arXiv:2607. 17327v1 Announce Type: cross Abstract: Quantum machine learning models define probabilistic input--output maps through coherent quantum evolution and measurement.
arXiv:2606. 08276v1 Announce Type: cross Abstract: Quantum reinforcement learning (QRL) is a promising approach to learn effective decision strategies across several applications with stochastic environments.
arXiv:2609.00372v1 Announce Type: cross Abstract: With quantum sensors, simulators and networks emerging, a future of quantum technology may produce quantum states as data---that is, coherently rathe...
The paper derives an information‑theoretic bound for a shared‑state cognitive architecture that uses an auxiliary variable to mediate context. It shows that the residual dependence of observable behavior on context, given the shared state, is bounded by the information carried by the auxiliary variable and its conditional entropy. A recognition‑memory example illustrates how to compute and compare this bound across different representational choices, providing a framework for analyzing context‑memory‑control trade‑offs in cognitive models and artificial agents.
The paper investigates whether quantum reinforcement learning algorithms can be matched by efficient classical methods. It focuses on a simplified reinforcement learning setting with a uniform generative model, providing finite‑sample guarantees for classical kernelized Fitted Q‑Iteration that uses kernels aligned with parameterized quantum circuits. The authors identify sufficient conditions on data encoding, kernel choice, and problem structure under which this classical approach dequantizes quantum Q‑learning, and suggest using kernelized Fitted Q‑Iteration as a heuristic when those conditions cannot be verified.
arXiv:2507. 18606v2 Announce Type: replace-cross Abstract: Reinforcement learning (RL) provides a principled framework for decision-making in partially observable environments, which can be modeled as Markov decision processes and compactly represented through dynamic decision Bayesian networks.
arXiv:2608. 19306v1 Announce Type: cross Abstract: Given a set of input states, we consider the task of predicting the expectation value of a Pauli observable at the output of an unknown quantum evolution, using only a limited number of measurements.
arXiv:2608. 19779v1 Announce Type: cross Abstract: World models provide digital simulacra of the true world, allowing agents to be trained and tested before costly real-world deployment.
arXiv:2606. 13422v2 Announce Type: replace-cross Abstract: We develop theoretical foundations for a practical quantum-advantage mechanism in quantum-informed machine learning for chaotic dynamical systems.
arXiv:2606. 19947v1 Announce Type: cross Abstract: Reliable quantum control in the presence of decoherence requires policies that combat the effect of environmental noise on the controlled dynamics.
The paper investigates whether having only forward access to a state-preparation unitary—without its inverse—can reduce the number of queries needed for quantum PAC learning. By analyzing worst-case scenarios over all compatible unitaries and finite dimensions, the authors prove that the optimal forward-only query complexities for realizable and agnostic learning are θ((d+log(1/δ))/ε) and θ((d+log(1/δ))/ε²), respectively, matching classical and quantum-copy bounds. These results demonstrate that forward-only access offers no asymptotic advantage over classical data or quantum copies, highlighting the essential role of inverse access for any improvement in the realizable setting.
arXiv:2608. 15715v1 Announce Type: cross Abstract: Quantum feedback control requires acting on noisy continuous measurement records without direct access to the underlying quantum state.