Can an agent's predictions reveal whether its reasoning is based on a classical or a quantum model? Using known results on matrix factorizations, here we show that quantum Bayesian retrodiction can produce one-step-ahead forecasts incompatible with every classical Bayesian explanation based on learning about a fixed but unknown sampling law from conditionally independent observations. The separation has a sharp threshold in the number of outcomes: for any measurement with at most four outcomes, the quantum predictions admit a classical realization, irrespective of the prior state and the finite Hilbert-space dimension, whereas a five-outcome measurement on a single qubit already violates an explicit classical bound. This bound holds for arbitrary classical latent states, prior probabilities, and sampling laws, and involves only the agent's initial and updated predictions. Thus, in this setting, quantum Bayesian retrodiction is strictly more expressive than classical Bayesian learning, and this difference can be witnessed without observing or specifying the agent's internal description.
AI Summary
Can initial and updated forecasts distinguish quantum Bayesian retrodiction from classical Bayesian learning? The classical benchmark is learning a fixed, unknown sampling law from conditionally i.i.d. observations—not arbitrary classical dynamics. The observable table is $T_{xy}=p_xT(y|x)$; quantum updates use the retrodictive state $\gamma_x=\sqrt\gamma P_x\sqrt\gamma/p_x$.
The paper identifies classical tables with normalized completely positive matrices, $T=BB^{\mathsf T}$ with $B\geq0$, and quantum tables with normalized completely positive semidefinite matrices, $T_{xy}=\operatorname{Tr}(Q_xQ_y)$ with $Q_x\succeq0$. It constructs a prior and POVM for every finite-dimensional positive-semidefinite Gram representation. Known matrix-cone results then imply a sharp outcome threshold: every quantum table with at most four outcomes has a classical realization, regardless of Hilbert-space dimension, whereas five outcomes suffice for separation.
An explicit maximally mixed qubit with a regular-pentagon POVM violates the classical inequality $\mathcal B_5=2\sum_{j=0}^4T_{j,j+1}\leq1/2$, attaining $(3+\sqrt5)/10\approx0.5236$. The classical bound follows from a five-cycle probability inequality preserved under mixtures. Positive semidefiniteness and entrywise nonnegativity give the dimension-independent upper bound $\mathcal B_5\leq1-1/\sqrt5\approx0.5528$, but quantum attainability is not established. The separating matrix and inequality are known; their application here is to retrodictive forecasts.
The distinction concerns compatibility with the specified inference model, not certification of an agent’s physical implementation; allowing arbitrary classical state changes removes it. The maximal quantum violation, noise robustness, dimension dependence, operational certification, and advantages in concrete inference tasks remain open.
No sign of AI-generated textIncremental
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
Comments
v2: discussion expanded, bound added; v1: 4 pages, one diagram
Can an agent's predictions reveal whether its reasoning is based on a classical or a quantum model? Using known results on matrix factorizations, here we show that quantum Bayesian retrodiction can produce one-step-ahead forecasts incompatible with every classical Bayesian explanation based on learning about a fixed but unknown sampling law from conditionally independent observations. The separation has a sharp threshold in the number of outcomes: for any measurement with at most four outcomes, the quantum predictions admit a classical realization, irrespective of the prior state and the finite Hilbert-space dimension, whereas a five-outcome measurement on a single qubit already violates an explicit classical bound. This bound holds for arbitrary classical latent states, prior probabilities, and sampling laws, and involves only the agent's initial and updated predictions. Thus, in this setting, quantum Bayesian retrodiction is strictly more expressive than classical Bayesian learning, and this difference can be witnessed without observing or specifying the agent's internal description.
Can initial and updated forecasts distinguish quantum Bayesian retrodiction from classical Bayesian learning? The classical benchmark is learning a fixed, unknown sampling law from conditionally i.i.d. observations—not arbitrary classical dynamics. The observable table is Txy=pxT(y∣x); quantum updates use the retrodictive state γx=γPxγ/px.
The paper identifies classical tables with normalized completely positive matrices, T=BBT with B≥0, and quantum tables with normalized completely positive semidefinite matrices, Txy=Tr(QxQy) with Qx⪰0. It constructs a prior and POVM for every finite-dimensional positive-semidefinite Gram representation. Known matrix-cone results then imply a sharp outcome threshold: every quantum table with at most four outcomes has a classical realization, regardless of Hilbert-space dimension, whereas five outcomes suffice for separation.
An explicit maximally mixed qubit with a regular-pentagon POVM violates the classical inequality B5=2∑j=04Tj,j+1≤1/2, attaining (3+5)/10≈0.5236. The classical bound follows from a five-cycle probability inequality preserved under mixtures. Positive semidefiniteness and entrywise nonnegativity give the dimension-independent upper bound B5≤1−1/5≈0.5528, but quantum attainability is not established. The separating matrix and inequality are known; their application here is to retrodictive forecasts.
The distinction concerns compatibility with the specified inference model, not certification of an agent’s physical implementation; allowing arbitrary classical state changes removes it. The maximal quantum violation, noise robustness, dimension dependence, operational certification, and advantages in concrete inference tasks remain open.
Quantum theory can be viewed as a generalization of classical probability theory, but the analogy as it has been developed so far is not complete. Whereas the manner in which inferences are made in classical probability theory is independent of the causal relation that holds between the conditioned variable and the conditioning variable, in the conventional quantum formalism, there is a significant difference between how one treats experiments involving two systems at a single time and those involving a single system at two times. In this article, we develop the formalism of quantum conditional states, which provides a unified description of these two sorts of experiment. In addition, concepts that are distinct in the conventional formalism become unified: Channels, sets of states, and positive operator valued measures are all seen to be instances of conditional states; the action of a channel on a state, ensemble averaging, the Born rule, the composition of channels, and nonselective state-update rules are all seen to be instances of belief propagation. Using a quantum generalization of Bayes' theorem and the associated notion of Bayesian conditioning, we also show that the remote steering of quantum states can be described within our formalism as a mere updating of beliefs about one system given new information about another, and retrodictive inferences can be expressed using the same belief propagation rule as is used for predictive inferences. Finally, we show that previous arguments for interpreting the projection postulate as a quantum generalization of Bayesian conditioning are based on a misleading analogy and that it is best understood as a combination of belief propagation (corresponding to the nonselective state-update map) and conditioning on the measurement outcome.
Quantum theory can be viewed as a generalization of classical probability
theory, but the analogy as it has been developed so far is not complete.
Classical probability theory is independent of causal structure, whereas the
conventional quantum formalism requires causal structure to be fixed in
advance. In this paper, we develop the formalism of quantum conditional states,
which unifies the description of experiments involving two systems at a single
time with the description of those involving a single system at two times. The
analogies between quantum theory and classical probability theory are expressed
succinctly within the formalism and it unifies the mathematical description of
distinct concepts, such as ensemble preparation procedures, measurements, and
quantum dynamics. We introduce a quantum generalization of Bayes' theorem and
the associated notion of Bayesian conditioning. Conditioning a quantum state on
a classical variable is the correct rule for updating quantum states in light
of classical data, regardless of the causal relationship between the classical
variable and the quantum degrees of freedom, but it does not include the
projection postulate as a special case. We show that previous arguments that
projection is the quantum generalization of conditioning are based on
misleading analogies. Since our formalism is causally neutral, conditioning
provides a unification of the predictive and retrodictive formalisms for
prepare-and-measure experiments and leads to an elegant derivation of the set
of states that a system can be steered to by making measurements on a remote
system.
A core tenet of Bayesian epistemology is that rational agents update by conditionalization.Accuracy arguments in favour of this norm are well-known.Meanwhile, scholars working in quantum probability and quantum state estimation have proposed multiple updating rules, all of which look prima facie like analogues of Bayesian conditionalization.The most common are Lüders conditionalization and Bayesian mean estimation (BME).Some authors also endorse a lesser-known alternative that we call retrodiction.We show how one can view Lüders and BME as complementary rules, and we give expected accuracy and accuracy dominance arguments for both.By contrast, we find that retrodiction is accuracy-dominated, at least on many measures of accuracy.Bayesian norms do not immediately carry over to this setting.(Here and in what follows, we assume that there are objective quantum probabilities, and that quantum systems have true, objective quantum states.The idea that there are both subjective and objective probabilities, and we can discuss their relationship, is sometimes known as Lewisian dualism (Wallace [2012]).)While it is unclear how to translate standard Bayesian norms into this quantum operatortheoretic setting, we can draw a natural analogy.Usually, the Bayesian represents both credences and states of the world as real-valued functions over an algebra of propositions; we can view credences as 'estimates' of the truth values assigned by a given state. 1 In quantum theory, one represents states with bounded, linear operators on a Hilbert space.It turns out that one can also use such operators to encode estimates of quantum states.We adopt this paradigm to construct natural analogues of the accuracy arguments, affording novel Bayesian justifications for several quantum updating rules.It is controversial whether such a non-classical approach to probability is necessary once we fix an appropriate solution to the measurement problem (Loewer, Healey [1994, 2020]).However, even if it is not necessary, this alternate setting is immensely popular.Experimenters typically work within the framework of Hilbert-space operators, as this framework houses most approaches to quantum state estimation (that is, the reconstruction of quantum states based on measurement outcomes; see Jones, Blume-Kohout, Granade et al. [1991Granade et al. [ , 2010Granade et al. [ , 2016]]).So, the status of Bayesian norms in this setting seems well worth exploring.Interestingly, authors have proposed multiple updating norms in this framework, all of which look prima facie like analogues of Bayesian conditionalization:
We study quantum measurement retrodiction using the principle of minimum change. For quantum-to-classical measurement channels, we show that all standard quantum divergences select the same retrodictive update, yielding a unique and divergence-independent quantum Bayesian inverse for any POVM and prior state. Using this update, we construct a symmetric joint distribution for pairs of POVMs and introduce the mutual retrodictability, for which we also derive a general upper bound that depends only on the prior state and holds for all measurements. This structure leads to two retrodictive entropic uncertainty relations, expressed directly in terms of the prior state and the POVMs, but valid independently of the retrodictive framework and fully compatible with the conventional operational interpretation of entropic uncertainty relations. Finally, we benchmark these relations numerically and find that they provide consistently tighter bounds than existing entropic uncertainty relations over broad classes of measurements and states.
A mixed quantum state can be taken as capturing an unspecified form of ignorance; or as describing the lack of knowledge about the true pure state of the system ("proper mixture"); or as arising from entanglement with another system that has been disregarded ("improper mixture"). These different views yield identical density matrices and therefore identical predictions for future measurements. But when used as prior beliefs for inferring the past state from later observations ("retrodiction"), they lead to different updated beliefs. This is a purely quantum feature of Bayesian agency. Based on this observation, we establish a framework for retrodicting on any quantum belief and we prove a necessary and sufficient condition for the equivalence of beliefs. We also illustrate how these differences have operational consequences in quantum state recovery.
Estimating the state of an open quantum system monitored over time requires incorporating information from past measurements (filtering) and, for improved accuracy, also from future measurements (smoothing). While classical smoothing is well understood within a Bayesian framework, its quantum generalization has been challenging, leading to distinct and seemingly incompatible approaches. In this work, we demonstrate that quantum state smoothing hinges on a uniquely quantum feature: the fundamental dependence of retrodiction on prior correlations. We introduce auxiliary systems into the prior to represent specified correlations formed during preparation and evolution, and formulate quantum state smoothing as extended Bayesian retrodiction. This framework identifies previous approaches as different choices of the extended prior, and naturally extends it to other choices that have not been considered before. We also give an information-theoretic characterization of the choices of prior, in terms of the average entropy of the smoothed states. Our results establish quantum state smoothing as a fundamentally retrodictive process just like classical smoothing, with proper quantum features clearly identified.