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:2610.29450

Quantum Belief Characterization: A Multi-Shot Notion of Equivalence

Mingxuan Liu, Pavel Sekatski, Valerio Scarani

quant-phSubmitted Oct 21, 2026• Announced Oct 22, 2026• 0 citations
arXivHTMLPDF

Abstract

A recent formulation of quantum belief showed that quantum retrodiction depends not only on the reduced density operator of the system of interest, but also on correlations with a hidden reference system, which leads to the notion of quantum belief equivalence. In this paper we formulate a multi-shot problem, where the extended posterior obtained after one update is used again as the prior for the next update. We first define a formal notion of $n$-shot equivalence and derive several propositions for arbitrary extended beliefs. We then argue that the agent must also specify why the data obtained in different rounds concern the same underlying object. Through the quantum de Finetti representation, this narrows the one-copy belief to a special class: candidate-state ensemble belief. In that sector, we show that two beliefs are $n$-shot equivalent if and only if their $(n+1)$-th moments are equal. We also give a physical interpretation of this moment condition and illustrate it through the equivalence between Haar priors and projective-design priors at bounded update depth.

AI Summary

The paper asks when two quantum priors remain indistinguishable under repeated retrodictive updates, rather than a single update. A prior is an extended state on a system $S$ and hidden reference $R$; each prior-extended Petz update produces an extended posterior that becomes the next prior. Two beliefs are $n$-shot equivalent if every length-$n$ channel–evidence sequence admissible for both yields the same final marginal on $S$. For arbitrary extended beliefs, the paper establishes a nested hierarchy of equivalence relations, a recursive characterization, and invariance under reversible channels on the hidden reference. To interpret iteration as learning about a common source, it uses an exchangeable, conditionally i.i.d. model motivated by quantum de Finetti theory. The resulting candidate-state ensemble representation keeps candidate states fixed while updating their classical weights. The main theorem states that two such ensembles are $n$-shot equivalent exactly when their $(n+1)$-copy moment operators coincide: $\sum_x p_x\rho_x^{\otimes(n+1)}=\sum_y q_y\varrho_y^{\otimes(n+1)}$. The proof uses induction, recursive equivalence, and tomographically spanning update operators. For measurement outcomes, iteration reduces to Bayesian reweighting, with the posterior representing an untouched source copy. Consequently, projective $(n+1)$-design priors exactly reproduce Haar-prior posterior system states through $n$ updates; an analogous statement holds for Scrooge designs. A closed-form characterization for arbitrary extended beliefs remains open. Alternative retrodiction rules and approximate moment matching are not analyzed. The numerical illustration is restricted to qubits, design orders one through five, and five measurement rounds.

Little sign of AI-generated textIncrementalStrong assumptions

Error found: The abstract attributes the restriction to candidate-state ensemble beliefs to de Finetti exchangeability, but the appendix's retrodictive justification additionally assumes that every admissible global update remains asymptotically exchangeable even when the updated copy is retained.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
16 pages, 2 figures

Related papers

Proper and Improper Mixed States Serve as Different Prior Beliefs for Quantum State Retrodiction

Mingxuan Liu, Valerio Scarani, Ge Bai

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.

arXiv:2502.10030•Physical Review Letters•Jan 9, 2026•7 citations

Towards a formulation of quantum theory as a causally neutral theory of Bayesian inference

Matthew Leifer, Robert W. Spekkens

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.

arXiv:1107.5849•Physical Review A•Nov 27, 2013•340 citations

Witnessing Quantum Bayesian Inference beyond Classical Learning

Francesco Buscemi

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.

quant-pharXiv:2610.09293•Oct 8, 2026•1 citation

A Bayesian approach to compatibility, improvement, and pooling of quantum states

Matthew Leifer, Robert W. Spekkens

In approaches to quantum theory in which the quantum state is regarded as a representation of knowledge, information, or belief, two agents can assign different states to the same quantum system. This raises two questions: when are such state assignments compatible? And how should the state assignments of different agents be reconciled? In this paper, we address these questions from the perspective of the recently developed conditional states formalism for quantum theory (Leifer M S and Spekkens R W 2013 Phys. Rev. A 88 052310). Specifically, we derive a compatibility criterion proposed by Brun, Finkelstein and Mermin from the requirement that, upon acquiring data, agents should update their states using a quantum generalization of Bayesian conditioning. We provide two alternative arguments for this criterion, based on the objective and subjective Bayesian interpretations of probability theory. We then apply the same methodology to the problem of quantum state improvement, i.e. how to update your state when you learn someone else's state assignment, and to quantum state pooling, i.e. how to combine the state assignments of several agents into a single assignment that accurately represents the views of the group. In particular, we derive a pooling rule previously proposed by Spekkens and Wiseman under much weaker assumptions than those made in the original derivation. All of our results apply to a much broader class of experimental scenarios than have been considered previously in this context.

arXiv:1110.1085•Journal of Physics A Mathematical and Theoretical•Jun 18, 2014•24 citations

Quantum measurement retrodiction and entropic uncertainty relations

Jiaxi Kuang, Kensei Torii, Francesco Buscemi

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.

quant-pharXiv:2511.20281•Quantum Science and Technology•Nov 26, 2025•3 citations

Unifying quantum smoothing theories with extended retrodiction

Mingxuan Liu, Ge Bai, Valerio Scarani

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.

arXiv:2510.08447•npj Quantum Information•Nov 1, 2026•9 citations
A recent formulation of quantum belief showed that quantum retrodiction depends not only on the reduced density operator of the system of interest, but also on correlations with a hidden reference system, which leads to the notion of quantum belief equivalence. In this paper we formulate a multi-shot problem, where the extended posterior obtained after one update is used again as the prior for the next update. We first define a formal notion of nnn-shot equivalence and derive several propositions for arbitrary extended beliefs. We then argue that the agent must also specify why the data obtained in different rounds concern the same underlying object. Through the quantum de Finetti representation, this narrows the one-copy belief to a special class: candidate-state ensemble belief. In that sector, we show that two beliefs are nnn-shot equivalent if and only if their (n+1)(n+1)(n+1)-th moments are equal. We also give a physical interpretation of this moment condition and illustrate it through the equivalence between Haar priors and projective-design priors at bounded update depth.
The paper asks when two quantum priors remain indistinguishable under repeated retrodictive updates, rather than a single update. A prior is an extended state on a system SSS and hidden reference RRR; each prior-extended Petz update produces an extended posterior that becomes the next prior. Two beliefs are nnn-shot equivalent if every length-nnn channel–evidence sequence admissible for both yields the same final marginal on SSS.
For arbitrary extended beliefs, the paper establishes a nested hierarchy of equivalence relations, a recursive characterization, and invariance under reversible channels on the hidden reference. To interpret iteration as learning about a common source, it uses an exchangeable, conditionally i.i.d. model motivated by quantum de Finetti theory. The resulting candidate-state ensemble representation keeps candidate states fixed while updating their classical weights.
The main theorem states that two such ensembles are nnn-shot equivalent exactly when their (n+1)(n+1)(n+1)-copy moment operators coincide: ∑xpxρx⊗(n+1)=∑yqyϱy⊗(n+1)\sum_x p_x\rho_x^{\otimes(n+1)}=\sum_y q_y\varrho_y^{\otimes(n+1)}∑x​px​ρx⊗(n+1)​=∑y​qy​ϱy⊗(n+1)​. The proof uses induction, recursive equivalence, and tomographically spanning update operators. For measurement outcomes, iteration reduces to Bayesian reweighting, with the posterior representing an untouched source copy. Consequently, projective (n+1)(n+1)(n+1)-design priors exactly reproduce Haar-prior posterior system states through nnn updates; an analogous statement holds for Scrooge designs.
A closed-form characterization for arbitrary extended beliefs remains open. Alternative retrodiction rules and approximate moment matching are not analyzed. The numerical illustration is restricted to qubits, design orders one through five, and five measurement rounds.
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.
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.
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.
In approaches to quantum theory in which the quantum state is regarded as a representation of knowledge, information, or belief, two agents can assign different states to the same quantum system. This raises two questions: when are such state assignments compatible? And how should the state assignments of different agents be reconciled? In this paper, we address these questions from the perspective of the recently developed conditional states formalism for quantum theory (Leifer M S and Spekkens R W 2013 Phys. Rev. A 88 052310). Specifically, we derive a compatibility criterion proposed by Brun, Finkelstein and Mermin from the requirement that, upon acquiring data, agents should update their states using a quantum generalization of Bayesian conditioning. We provide two alternative arguments for this criterion, based on the objective and subjective Bayesian interpretations of probability theory. We then apply the same methodology to the problem of quantum state improvement, i.e. how to update your state when you learn someone else's state assignment, and to quantum state pooling, i.e. how to combine the state assignments of several agents into a single assignment that accurately represents the views of the group. In particular, we derive a pooling rule previously proposed by Spekkens and Wiseman under much weaker assumptions than those made in the original derivation. All of our results apply to a much broader class of experimental scenarios than have been considered previously in this context.
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.
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.