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

Bayesian retrodiction of quantum supermaps

Bai, Ge

Published Aug 15, 2024• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2408.07885

Related papers

State retrieval beyond Bayes' retrodiction

Jacopo Surace, Matteo Scandi

In the context of irreversible dynamics, associating to a physical process its intuitive reverse can result to be a quite ambiguous task. It is a standard choice to define the reverse process using Bayes' theorem, but, in general, this choice is not optimal. In this work we explore whether it is possible to characterise an optimal reverse map building from the concept of state retrieval maps. In doing so, we propose a set of principles that state retrieval maps should satisfy. We find out that the Bayes inspired reverse is just one case in a whole class of possible choices, which can be optimised to give a map retrieving the initial state more precisely than the Bayes rule. Our analysis has the advantage of naturally extending to the quantum regime. In fact, we find a class of reverse transformations containing the Petz recovery map as a particular case, corroborating its interpretation as quantum analogue of the Bayes retrieval. Finally, we present numerical evidences that by adding a single extra axiom one can isolate the usual reverse process derived from Bayes' theorem.

arXiv:2201.09899•Quantum•Apr 27, 2023•22 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.40158•Oct 30, 2026•0 citations

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.00319•Physical Review Letters•Jul 18, 2025•8 citations

Axioms for retrodiction: achieving time-reversal symmetry with a prior

Arthur J. Parzygnat, Francesco Buscemi

We propose a category-theoretic definition of retrodiction and use it to exhibit a time-reversal symmetry for all quantum channels. We do this by introducing retrodiction families and functors, which capture many intuitive properties that retrodiction should satisfy and are general enough to encompass both classical and quantum theories alike. Classical Bayesian inversion and all rotated and averaged Petz recovery maps define retrodiction families in our sense. However, averaged rotated Petz recovery maps, including the universal recovery map of Junge-Renner-Sutter-Wilde-Winter, do not define retrodiction functors, since they fail to satisfy some compositionality properties. Among all the examples we found of retrodiction families, the original Petz recovery map is the only one that defines a retrodiction functor. In addition, retrodiction functors exhibit an inferential time-reversal symmetry consistent with the standard formulation of quantum theory. The existence of such a retrodiction functor seems to be in stark contrast to the many no-go results on time-reversal symmetry for quantum channels. One of the main reasons is because such works defined time-reversal symmetry on the category of quantum channels alone, whereas we define it on the category of quantum channels and quantum states. This fact further illustrates the importance of a prior in time-reversal symmetry.

arXiv:2210.13531•Quantum•May 23, 2023•33 citations

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

Clive Cenxin Aw, Peter Sidajaya

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.

quant-pharXiv:2603.18665•Mar 20, 2026•0 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.21309•Aug 24, 2026•0 citations
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.
In the context of irreversible dynamics, associating to a physical process its intuitive reverse can result to be a quite ambiguous task. It is a standard choice to define the reverse process using Bayes' theorem, but, in general, this choice is not optimal. In this work we explore whether it is possible to characterise an optimal reverse map building from the concept of state retrieval maps. In doing so, we propose a set of principles that state retrieval maps should satisfy. We find out that the Bayes inspired reverse is just one case in a whole class of possible choices, which can be optimised to give a map retrieving the initial state more precisely than the Bayes rule. Our analysis has the advantage of naturally extending to the quantum regime. In fact, we find a class of reverse transformations containing the Petz recovery map as a particular case, corroborating its interpretation as quantum analogue of the Bayes retrieval. Finally, we present numerical evidences that by adding a single extra axiom one can isolate the usual reverse process derived from Bayes' theorem.
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.
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.
We propose a category-theoretic definition of retrodiction and use it to exhibit a time-reversal symmetry for all quantum channels. We do this by introducing retrodiction families and functors, which capture many intuitive properties that retrodiction should satisfy and are general enough to encompass both classical and quantum theories alike. Classical Bayesian inversion and all rotated and averaged Petz recovery maps define retrodiction families in our sense. However, averaged rotated Petz recovery maps, including the universal recovery map of Junge-Renner-Sutter-Wilde-Winter, do not define retrodiction functors, since they fail to satisfy some compositionality properties. Among all the examples we found of retrodiction families, the original Petz recovery map is the only one that defines a retrodiction functor. In addition, retrodiction functors exhibit an inferential time-reversal symmetry consistent with the standard formulation of quantum theory. The existence of such a retrodiction functor seems to be in stark contrast to the many no-go results on time-reversal symmetry for quantum channels. One of the main reasons is because such works defined time-reversal symmetry on the category of quantum channels alone, whereas we define it on the category of quantum channels and quantum states. This fact further illustrates the importance of a prior in time-reversal symmetry.
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.
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.