Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1711.04557

Quantum Statistical Inference

Ahmad Shafiei Deh Abad, Shahbazi, Mohammad

Published Nov 13, 2017• 0 citations
arXivHTMLPDF

Abstract

In this paper, inspired by the "Minimum Description Length Principle" in classical Statistics, we introduce a new method for predicting the outcomes of a quantum measurement and for estimating the state of a quantum system with minimum quantum complexity, while, at the same time, avoiding overfitting.
DOI
10.48550/arxiv.1711.04557

Related papers

Semi-Density Matrices and Quantum Statistical Inference

Ahmad Shafiei Deh Abad, Mohammad Shahbazi

Abstract In this paper, inspired by the ‘Minimum Description Length Principle’ in classical statistics, we introduce a new method for predicting the outcomes of performing quantum measurements and for estimating the state of quantum systems.

Journal of Physics Communications•Jan 24, 2020•0 citations

Universal Inductive Inference of Quantum States

Taiga Hiroka, Min-Hsiu Hsieh, Yuki Shirakawa

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 $ε$-close in trace distance to the target with probability at least $1-δ$. We establish an information-theoretic inference algorithm with round complexity $O(sε^{-2}δ^{-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(sn^2ε^{-4}δ^{-2})$, 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.

quant-pharXiv:2609.36912•Sep 30, 2026•0 citations

On Quantum Statistical Inference, II

Ole Eiler Barndorff-Nielsen, Richard David Gill, Peter E. Jupp

Interest in problems of statistical inference connected to measurements of quantum systems has recently increased substantially, in step with dramatic new developments in experimental techniques for studying small quantum systems. Furthermore, theoretical developments in the theory of quantum measurements have brought the basic mathematical framework for the probability calculations much closer to that of classical probability theory. The present paper reviews this field and proposes and interrelates a number of new concepts for an extension of classical statistical inference to the quantum context.

arXiv:quant-ph/0307191•Jul 26, 2003•3 citations

The foundations of superposition and its use in quantum walks on complex networks

Peter G. Lewis

In classical physics, it is possible in principle to predict with certainty the outcome of any measurement that we might perform on a system. Where we are not able to predict outcome with certainty, we can attribute the uncertainty to incompleteness in our knowledge about the history of the system (its pre-measurement state), or the behaviour of the apparatus we use to measure it. Quantum theory, on the other hand, describes systems where what we can find out about the pre-measurement state is significantly restricted: we are not generally able to predict with certainty the outcome of an arbitrary measurement, even with full knowledge of that system’s history. Superposition states are at the heart of this phenomenon, and do not have an analogue in classical physics. In this thesis we examine superposition states from two points of view. Firstly, following long-running arguments about whether quantum theory can be considered complete, we examine the possibility of an underlying ‘ontological’ model of quantum theory that explains the quantum measurement statistics. We derive the first such model that has the property that a single state in the underlying model is compatible with distinct quantum states, and recovers the measurement statistics for systems of dimension greater than two. Secondly, we examine the dynamics of continuous time quantum walks in complex networks. Discovering community structure in these networks is a useful task to be able to perform, and there are several algorithms using the classical dynamics of random walks to return that structure. We introduce a new ‘centrality measure’ based on the observable dynamics of a quantum walker, and provide an algorithm using our new measure for community detection.

•Oct 1, 2014•1 citation

On Quantum Statistical Inference, I

Ole Eiler Barndorff-Nielsen, Richard David Gill, Peter E. Jupp

Recent developments in the mathematical foundations of quantum mechanics have brought the theory closer to that of classical probability and statistics. On the other hand, the unique character of quantum physics sets many of the questions addressed apart from those met classically in stochastics. Furthermore, concurrent advances in experimental techniques and in the theory of quantum computation have led to a strong interest in questions of quantum information, in particular in the sense of the amount of information about unknown parameters in given observational data or accessible through various possible types of measurements. This scenery is outlined (with an audience of statisticians and probabilists in mind).

arXiv:quant-ph/0307189•Jul 25, 2003•9 citations

On Quantum Statistical Inference

Ole Eiler Barndorff-Nielsen, Richard David Gill, Peter E. Jupp

Summary Interest in problems of statistical inference connected to measurements of quantum systems has recently increased substantially, in step with dramatic new developments in experimental techniques for studying small quantum systems. Furthermore, developments in the theory of quantum measurements have brought the basic mathematical framework for the probability calculations much closer to that of classical probability theory. The present paper reviews this field and proposes and interrelates some new concepts for an extension of classical statistical inference to the quantum context.

Journal of the Royal Statistical Society Series B (Statistical Methodology)•Oct 28, 2003•198 citations
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 sss-bit program within a given time bound. The learner is required to produce a state that is εεε-close in trace distance to the target with probability at least 1−δ1-δ1−δ. We establish an information-theoretic inference algorithm with round complexity O(sε−2δ−1)O(sε^{-2}δ^{-1})O(sε−2δ−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(sn2ε−4δ−2)O(sn^2ε^{-4}δ^{-2})O(sn2ε−4δ−2), where nnn is the number of qubits received in each round. Finally, we investigate the computational hardness of universal quantum inductive inference under quantum cryptographic assumptions.
Interest in problems of statistical inference connected to measurements of quantum systems has recently increased substantially, in step with dramatic new developments in experimental techniques for studying small quantum systems. Furthermore, theoretical developments in the theory of quantum measurements have brought the basic mathematical framework for the probability calculations much closer to that of classical probability theory. The present paper reviews this field and proposes and interrelates a number of new concepts for an extension of classical statistical inference to the quantum context.
In classical physics, it is possible in principle to predict with certainty the outcome of any measurement that we might perform on a system. Where we are not able to predict outcome with certainty, we can attribute the uncertainty to incompleteness in our knowledge about the history of the system (its pre-measurement state), or the behaviour of the apparatus we use to measure it. Quantum theory, on the other hand, describes systems where what we can find out about the pre-measurement state is significantly restricted: we are not generally able to predict with certainty the outcome of an arbitrary measurement, even with full knowledge of that system’s history. Superposition states are at the heart of this phenomenon, and do not have an analogue in classical physics. In this thesis we examine superposition states from two points of view. Firstly, following long-running arguments about whether quantum theory can be considered complete, we examine the possibility of an underlying ‘ontological’ model of quantum theory that explains the quantum measurement statistics. We derive the first such model that has the property that a single state in the underlying model is compatible with distinct quantum states, and recovers the measurement statistics for systems of dimension greater than two. Secondly, we examine the dynamics of continuous time quantum walks in complex networks. Discovering community structure in these networks is a useful task to be able to perform, and there are several algorithms using the classical dynamics of random walks to return that structure. We introduce a new ‘centrality measure’ based on the observable dynamics of a quantum walker, and provide an algorithm using our new measure for community detection.
Recent developments in the mathematical foundations of quantum mechanics have brought the theory closer to that of classical probability and statistics. On the other hand, the unique character of quantum physics sets many of the questions addressed apart from those met classically in stochastics. Furthermore, concurrent advances in experimental techniques and in the theory of quantum computation have led to a strong interest in questions of quantum information, in particular in the sense of the amount of information about unknown parameters in given observational data or accessible through various possible types of measurements. This scenery is outlined (with an audience of statisticians and probabilists in mind).
Summary Interest in problems of statistical inference connected to measurements of quantum systems has recently increased substantially, in step with dramatic new developments in experimental techniques for studying small quantum systems. Furthermore, developments in the theory of quantum measurements have brought the basic mathematical framework for the probability calculations much closer to that of classical probability theory. The present paper reviews this field and proposes and interrelates some new concepts for an extension of classical statistical inference to the quantum context.