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

Connecting Quantum Tomography and Quantum Retrodiction

Sebastian Murk, Ian Tan, Fabian Müller, Dominik Šafránek

quant-phmath-phmath.STphysics.data-anSubmitted Jun 22, 2026• Announced Jun 24, 2026• 4 citations• Revised Oct 29, 2026 (v2)
v1 · Jun 22, 2026v2 · Oct 29, 2026
arXivHTMLPDF

Abstract

Quantum tomography and quantum retrodiction are traditionally viewed as separate inference tasks. We show that the two are manifestations of the same underlying principle. We prove that the Petz recovery map of a measurement channel is a gradient of the log-likelihood used in maximum-likelihood tomography, and we derive its extension to arbitrary quantum channels. Consequently, for measurement channels, repeated applications of the Petz map monotonically increase the likelihood, naturally yielding a method for quantum tomography.

Comments
6+9 pages, 4 figures. Revised version: updated Figs. 2 and 3; added Fig. 4 and supplementary sections on numerical evidence for Conjecture 3 and a thermodynamic reconstruction example; moved the gradient derivation to End Matter

Related papers

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•2 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•51 citations

Quantum measurement tomography with mini-batch stochastic gradient descent

Akshay Gaikwad, Manuel Sebastian Torres, Anton Frisk Kockum

Drawing inspiration from gradient-descent methods developed for data processing in quantum state tomography [\href{https://iopscience.iop.org/article/10.1088/2058-9565/ae0baa}{Quantum Sci.~Technol.~\textbf{10} 045055 (2025)}] and quantum process tomography [\href{https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.130.150402}{Phys.~Rev.~Lett.~\textbf{130}, 150402 (2023)}], we introduce stochastic gradient descent (SGD) algorithms for fast quantum measurement tomography (QMT), applicable to both discrete- and continuous-variable quantum systems -- thus completing the tomography trio. A measurement device or detector in a quantum experiment is characterized by a set of positive operator-valued measure (POVM) elements; the goal of QMT is to estimate these operators from experimental data. To ensure physically valid (positive and complete) POVM reconstructions, we propose two distinct parameterization schemes within the SGD framework: one leveraging optimization on a Stiefel manifold and one based on Hermitian operator normalization via eigenvalue scaling. Within the SGD-QMT framework, we further investigate two loss functions: mean squared error, equivalent to L2 or Euclidean norm, and average negative log-likelihood, inspired by maximum likelihood estimation. We benchmark performance against state-of-the-art constrained convex optimization methods. Numerical simulations demonstrate that, compared to standard methods, our SGD-QMT algorithms offer significantly lower computational cost, superior reconstruction fidelity, and enhanced robustness to noise. We make a Python implementation of the SGD-QMT algorithms publicly available at \href{https://github.com/agtomo/SGD-QMT}{github.com/agtomo/SGD-QMT}.

quant-pharXiv:2511.15682•Nov 20, 2025•0 citations

Maximum a posteriori probability estimates for quantum tomography

Vikesh Siddhu

Using a Bayesian methodology, we introduce the maximum a posteriori probability (MAP) estimator for quantum state and process tomography. We show that the maximum likelihood, the hedged maximum likelihood, and the maximum likelihood-maximum entropy estimator, and estimators of this general type, can be viewed as special cases of the MAP estimator. The MAP, like the Bayes mean estimator, includes prior knowledge. For cases of interest to tomography MAP can take advantage of convex optimization tools, making it numerically tractable. We show how the MAP and other Bayesian quantum state estimators can be corrected for noise produced if the quantum state passes through a noisy quantum channel prior to measurement. Numerical simulations on a single qubit indicate that, on average, including these corrections significantly improves the estimate even when the measurement data are modestly large.

arXiv:1805.12235•Physical Review A•Jan 28, 2019•10 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.07885•Aug 15, 2024•2 citations

Bayesian inference and retrodiction for faithful states on von Neumann algebras

Pradyut Karmakar, Arthur J. Parzygnat

Retrodiction is the act of inferring a cause from its effects, the most common example of which is Bayesian inference. Retrodiction can be defined by its structural process-theoretic properties, which are mathematically captured by category theory. This categorical definition of retrodiction has recently been shown to potentially isolate the Petz recovery map as a unique universal candidate for quantum Bayesian inference. This paper extends these results to the infinite-dimensional setting on von Neumann algebras. In the process, we provide a pedagogical review of the Petz recovery map in infinite dimensions and its relation to the more commonly used expression in the finite-dimensional setting. We formalize the open question as to whether these categorical axioms for retrodiction do in fact uniquely characterize the Petz recovery map. If such a characterization holds, this would show that Bayesian inversion and the Petz recovery map are structural necessities and not simply useful algorithms for classical and quantum inference.

math.OACross-listedarXiv:2608.20001•Aug 21, 2026•4 citations
Quantum tomography and quantum retrodiction are traditionally viewed as separate inference tasks. We show that the two are manifestations of the same underlying principle. We prove that the Petz recovery map of a measurement channel is a gradient of the log-likelihood used in maximum-likelihood tomography, and we derive its extension to arbitrary quantum channels. Consequently, for measurement channels, repeated applications of the Petz map monotonically increase the likelihood, naturally yielding a method for quantum tomography.
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.
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.
Drawing inspiration from gradient-descent methods developed for data processing in quantum state tomography [\href{https://iopscience.iop.org/article/10.1088/2058-9565/ae0baa}{Quantum Sci.~Technol.~\textbf{10} 045055 (2025)}] and quantum process tomography [\href{https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.130.150402}{Phys.~Rev.~Lett.~\textbf{130}, 150402 (2023)}], we introduce stochastic gradient descent (SGD) algorithms for fast quantum measurement tomography (QMT), applicable to both discrete- and continuous-variable quantum systems -- thus completing the tomography trio. A measurement device or detector in a quantum experiment is characterized by a set of positive operator-valued measure (POVM) elements; the goal of QMT is to estimate these operators from experimental data. To ensure physically valid (positive and complete) POVM reconstructions, we propose two distinct parameterization schemes within the SGD framework: one leveraging optimization on a Stiefel manifold and one based on Hermitian operator normalization via eigenvalue scaling. Within the SGD-QMT framework, we further investigate two loss functions: mean squared error, equivalent to L2 or Euclidean norm, and average negative log-likelihood, inspired by maximum likelihood estimation. We benchmark performance against state-of-the-art constrained convex optimization methods. Numerical simulations demonstrate that, compared to standard methods, our SGD-QMT algorithms offer significantly lower computational cost, superior reconstruction fidelity, and enhanced robustness to noise. We make a Python implementation of the SGD-QMT algorithms publicly available at \href{https://github.com/agtomo/SGD-QMT}{github.com/agtomo/SGD-QMT}.
Using a Bayesian methodology, we introduce the maximum a posteriori probability (MAP) estimator for quantum state and process tomography. We show that the maximum likelihood, the hedged maximum likelihood, and the maximum likelihood-maximum entropy estimator, and estimators of this general type, can be viewed as special cases of the MAP estimator. The MAP, like the Bayes mean estimator, includes prior knowledge. For cases of interest to tomography MAP can take advantage of convex optimization tools, making it numerically tractable. We show how the MAP and other Bayesian quantum state estimators can be corrected for noise produced if the quantum state passes through a noisy quantum channel prior to measurement. Numerical simulations on a single qubit indicate that, on average, including these corrections significantly improves the estimate even when the measurement data are modestly large.
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.
Retrodiction is the act of inferring a cause from its effects, the most common example of which is Bayesian inference. Retrodiction can be defined by its structural process-theoretic properties, which are mathematically captured by category theory. This categorical definition of retrodiction has recently been shown to potentially isolate the Petz recovery map as a unique universal candidate for quantum Bayesian inference. This paper extends these results to the infinite-dimensional setting on von Neumann algebras. In the process, we provide a pedagogical review of the Petz recovery map in infinite dimensions and its relation to the more commonly used expression in the finite-dimensional setting. We formalize the open question as to whether these categorical axioms for retrodiction do in fact uniquely characterize the Petz recovery map. If such a characterization holds, this would show that Bayesian inversion and the Petz recovery map are structural necessities and not simply useful algorithms for classical and quantum inference.