arXiv:2603.18665

Schrödinger Bridges via the Hacking of Bayesian Priors in Classical and Quantum Regimes

Clive Cenxin Aw, Peter Sidajaya

quant-phcond-mat.stat-mechmath-phSubmitted Mar 19, 2026• Announced Mar 20, 2026• 0 citations

Abstract

Bayes' rule is widely regarded as the canonical prescription for belief updating. We show, however, that one can arbitrarily preserve pre-specified beliefs while appearing to perform Bayesian updates via "prior hacking": engineering a reference prior distribution such that, for a fixed channel and evidence, the update matches a chosen target distribution. We prove that this is generically possible in both classical and quantum settings whenever Bayesian inversions are well-defined (with the Petz recovery map as the quantum analogue to Bayes' rule), and provide constructive algorithms for doing so. We further establish a duality between prior hacking and Schrödinger bridge problems (a key object in statistical physics with applications in generative modelling), yielding in the quantum setting a unique, inference-consistent selection among candidate bridges. This formally establishes the Bayes-like updating that Schrödinger bridges are performing with respect to the process as opposed to the reference prior, both in classical and quantum settings.

Comments: 12 pages (main text, 23 pages total with appendix), 8 Figures,

Related papers

Quantum Bayes’ Rule and Petz Transpose Map from the Minimum Change Principle

Ge Bai, Francesco Buscemi, Valerio Scarani

Bayes' rule, which is routinely used to update beliefs based on new evidence, can be derived from a principle of minimum change. This principle states that updated beliefs must be consistent with new data, while deviating minimally from the prior belief. Here, we introduce a quantum analog of the minimum change principle and use it to derive a quantum Bayes' rule by minimizing the change between two quantum input-output processes, not just their marginals. This is analogous to the classical case, where Bayes' rule is obtained by minimizing several distances between the joint input-output distributions. When the change maximizes the fidelity, the quantum minimum change principle has a unique solution, and the resulting quantum Bayes' rule recovers the Petz transpose map in many cases.

arXiv:2410.00319Physical Review LettersJul 18, 20258 citations

Quantum Bayes' Rule and Petz Transpose Map from the Minimum Change Principle

Bai, Ge, Francesco Buscemi, Valerio Scarani

Bayes’ rule, which is routinely used to update beliefs based on new evidence, can be derived from a principle of minimum change. This principle states that updated beliefs must be consistent with new data, while deviating minimally from the prior belief. Here, we introduce a quantum analog of the minimum change principle and use it to derive a quantum Bayes’ rule by minimizing the change between two quantum input-output processes, not just their marginals. This is analogous to the classical case, where Bayes’ rule is obtained by minimizing several distances between the joint input-output distributions. When the change maximizes the fidelity, the quantum minimum change principle has a unique solution, and the resulting quantum Bayes’ rule recovers the Petz transpose map in many cases.

Aug 28, 20250 citations

Inevitability of the Petz transpose map

Jacopo Surace, Chenxu Li, Francesco Buscemi

Bayes' rule is central to classical statistical inference: given a prior and a stochastic model, it determines the corresponding retrodictive conditional probabilities. In quantum theory, however, the question of whether an equally general rule of retrodiction exists and, if so, whether it is uniquely determined remains nontrivial. Here we prove that a retrodiction assignment defined for all priors and channels, which takes each predicted output state back to its prior, must coincide with the Petz transpose map if it is involutive, respects sequential and parallel composition, and agrees with unitary inversion. The theorem holds for channels between finite-dimensional full matrix algebras, with the input and output spaces restricted to the supports of the corresponding reference states. In particular, affinity under probabilistic mixtures and the characteristic square-root dependence on the reference states follow from these requirements rather than being postulated. Without involutivity, the remaining requirements characterize a family of doubly rotated Petz maps. Our result thus explains why the Petz transpose map arises in seemingly different areas of quantum theory: it is the unique quantum analogue of Bayes' rule compatible with these consistency requirements.

quant-pharXiv:2610.40158Oct 30, 20260 citations

Quantum Bayesian Inference in Quasiprobability Representations

Clive Cenxin Aw, Kelvin Onggadinata, Dagomir Kaszlikowski +1 more

Bayes' rule plays a crucial role in logical inference in information and physical sciences alike.Its extension into the quantum regime has been the subject of several recent works.These quantum versions of Bayes' rule have been expressed in the language of Hilbert spaces.In this paper, we derive the expression for the Petz recovery map within any quasiprobability representation, with explicit formulas for the two canonical choices of "normal quasiprobability representations" (which include discrete-Wigner representations) and of representations based on symmetric informationally complete positive operator-valued measures (SIC-POVMs).By using the same mathematical syntax of (quasi)stochastic matrices acting on (quasi)stochastic vectors, the core difference in logical inference between classical and quantum theory is found in the manipulation of the reference prior rather than in the representation of the channel.

arXiv:2301.01952PRX QuantumJun 27, 202310 citations

Tomographic Limits of the Petz Recovery Map

Peter Sidajaya, Clive Cenxin Aw, Mingxuan Liu +1 more

The Petz recovery map is considered one of the key candidates for the quantum analogue of Bayesian inference and Jeffrey's conditionalization. Since, there seems to be a natural connection between Bayesian inference and the notion of state tomography, it is natural to ask if the Petz recovery can be used for this latter task. In this paper, we discuss such recent results on iterated Petz recovery and relate them to Bayesian approaches to quantum state tomography. We highlight the limitations of direct Petz iteration and show how an extended Petz construction, by lifting the inference problem to a classical distribution over candidate quantum states, recovers the structure of Bayesian and maximum likelihood tomography. This provides perspective on the modifications or nuances required for a Petz approach to quantum retrodiction to perform quantum state tomography.

quant-pharXiv:2608.21309Aug 24, 20260 citations

Bayesian retrodiction of quantum supermaps

Bai, Ge

The Petz map has been established as a quantum version of the Bayes' rule. It unifies the conceptual belief update rule of a quantum state observed after a forward quantum process, and the operational reverse process that recovers the final state to match the updated belief, effectively counteracting the forward process. Here, we study a higher-order generalization of the quantum Bayes' rule by considering a quantum process undergoing a quantum supermap. For a few families of initial beliefs, we show that a similar unification is possible -- the rules updating the beliefs about quantum channels can be implemented via a "reverse" quantum supermap, termed the retrodiction supermap. The potential applications of retrodiction supermap are demonstrated with examples of improved error correction in quantum cloud computing. Analytical solutions are provided for these families, while a recipe for arbitrary initial beliefs remains an open question.

arXiv:2408.07885Aug 15, 20240 citations