arXiv:2610.29450
Quantum Belief Characterization: A Multi-Shot Notion of Equivalence
Mingxuan Liu, Pavel Sekatski, Valerio Scarani
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.
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