analiza aiqbench
This paper extends Solomonoff's universal inductive inference framework to quantum systems, establishing a theory for learning and predicting sources with arbitrary entanglement and temporal correlations. The authors derive an information-theoretic algorithm with specific round complexity bounds and prove matching lower bounds, even when applied to classical sources. Additionally, the work addresses non-i.i.d. state tomography and investigates the computational hardness of these inference tasks under quantum cryptographic assumptions.
Universal Inductive Inference of Quantum States
arXiv:2609.36912v1 Announce Type: new Abstract: Solomonoff's universal inductive inference [Inf. Control. 1964] is one of the most general frameworks for learning from sequential data and predicting future observations. It provides prediction guarantees for any computable stochastic source. We ask whether an analogous universal theory of induction can be developed for quantum systems. To this end, we introduce universal quantum inductive inference, a framework for learning and predicting quantum sources that may exhibit arbitrary correlations and entanglement across time. Given the outcomes of past measurements and the corresponding post-measurement quantum systems, the learner produces a joint state that predicts the next measurement outcome and post-measurement system while preserving correlations with the past systems. We model a quantum source as a multipartite quantum state whose description is generated by an unknown $s$-bit program within a given time bound. The learner is required to produce a state that is $\epsilon$-close in trace distance to the target with probability at least $1-\delta$. We establish an information-theoretic inference algorithm with round complexity $O(s\epsilon^{-2}\delta^{-1})$. We further prove a matching lower bound in the relevant parameter regime, even for classical sources. As a second result, we construct a non-i.i.d. state tomography algorithm that outputs a classical description of the conditional state of the next system given past measurement outcomes. Our information-theoretic tomography algorithm achieves round complexity $O(s\min\{2^s,2^n\}\epsilon^{-2}\delta^{-1})$, where $n$ is the number of qubits received in each round. Finally, we investigate the computational hardness of universal quantum inductive inference under quantum cryptographic assumptions.
Abstract:Solomonoff's universal inductive inference [Inf. Control. 1964] is one of the most general frameworks for learning from sequential data and predicting future observations. It provides prediction guarantees for any computable stochastic source. We ask whether an analogous universal theory of induction can be developed for quantum systems. To this end, we introduce universal quantum inductive inference, a framework for learning and predicting quantum sources that may exhibit arbitrary correlations and entanglement across time. Given the outcomes of past measurements and the corresponding post-measurement quantum systems, the learner produces a joint state that predicts the next measurement outcome and post-measurement system while preserving correlations with the past systems. We model a quantum source as a multipartite quantum state whose description is generated by an unknown $s$-bit program within a given time bound. The learner is required to produce a state that is $\epsilon$-close in trace distance to the target with probability at least $1-\delta$. We establish an information-theoretic inference algorithm with round complexity $O(s\epsilon^{-2}\delta^{-1})$. We further prove a matching lower bound in the relevant parameter regime, even for classical sources. As a second result, we construct a non-i.i.d. state tomography algorithm that outputs a classical description of the conditional state of the next system given past measurement outcomes. Our information-theoretic tomography algorithm achieves round complexity $O(s\min\{2^s,2^n\}\epsilon^{-2}\delta^{-1})$, where $n$ is the number of qubits received in each round. Finally, we investigate the computational hardness of universal quantum inductive inference under quantum cryptographic assumptions.
arXiv:2609.36912 [quant-ph]
(or arXiv:2609.36912v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.36912 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 332 cuvinte
Subiecte conexe

News
Quantum Computing Report · 7 iun. 2026

Review of Fundamental Uncertainty.
LessWrong · 1 aug. 2026
The Next Swan: Frank Ramsey, Variable Hypotheticals, and the Bet on Induction
LessWrong · 8 iun. 2026

New 13 meV Sensors Probe Dark Matter at Lower Energies
Quantum Zeitgeist · 23 iul. 2026