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

Efficient and Robust Methods for Quantum Tomography

Charles H. Baldwin

Published Jan 6, 2017• 2 citations
arXivHTMLPDF

Abstract

The development of large-scale platforms for quantum information requires new methods for verification and validation of quantum behavior. Quantum tomography (QT) is the standard tool for diagnosing quantum states, process, and readout devices by providing complete information. However, QT is limited since it is expensive to not only implement experimentally, but also requires heavy classical post-processing of data. In this dissertation, we introduce new methods for QT that are more efficient to implement and robust to noise and errors, thereby making QT a more practical tool for current quantum information experiments. The crucial detail that makes these new, efficient, and robust methods possible is prior information about the quantum system. This prior information is prompted by the goals of most experiments in quantum information, which require pure states, unitary processes, and rank-1 POVM operators. Therefore, most experiments are designed to operate near this ideal regime. We show that when this is the case, QT can be accomplished with significantly fewer resources, and produce a robust estimate in the presence of noise and errors. Moreover, the estimate is also robust if the state is not exactly pure, the process is not exactly unitary, or the POVM is not exactly rank-1. Such compelling methods are only made possible by the positivity constraint on quantum states, processes, and POVMs. This requirement is an inherent feature of quantum mechanics, but has powerful consequences to QT. Since QT is necessarily an experimental tool, we discuss a test of these new methods in an experimental setting. The physical system is an ensemble of laser-cooled cesium atoms in the laboratory of Prof. Poul Jessen. Experiments were conducted by Hector Sosa-Martinez et al. to demonstrate different QT protocols. We compare the results, and conclude that the new methods are effective.

DOI
10.48550/arxiv.1701.01764

Related papers

Practical adaptive quantum tomography

Christopher Granade, Christopher Ferrie, Steven T. Flammia

We introduce a fast and accurate heuristic for adaptive tomography that addresses many of the limitations of prior methods.Previous approaches were either too computationally intensive or tailored to handle special cases such as single qubits or pure states.By contrast, our approach combines the efficiency of online optimization with generally applicable and well-motivated data-processing techniques.We numerically demonstrate these advantages in several scenarios including mixed states, higher-dimensional systems, and restricted measurements.Quantum information processing (QIP) promises advantages in a wide range of different contexts, including machine learning [2-4], chemistry simulation [5][6][7], and number theory [8,9].As such, the experimental effort to build useful QIP devices has exploded in recent years.In the course of this effort, quantum tomography is a valuable tool for diagnosing and debugging small quantum devices, and has subsequently seen a variety of different advances.In particular, Bayesian approaches to tomography which are especially well suited to utilizing prior information and adapting to changing experimental conditions have developed significantly in recent years [10-13], presenting a useful experimental tool [14][15][16].In this paper we demonstrate the efficiency and accuracy of an adaptive tomography protocol that we call PAQT: practical adaptive quantum tomography.PAQT intelligently selects new measurements based on the outcomes of previous ones [10,[17][18][19][20][21].Adaptivity has been experimentally demonstrated [14,15,[22][23][24][25], but is not currently standard practice.Though adaptivity increases accuracy, the computational costs incurred outweigh that of simply repeating standard measurements many times.The PAQT approach employs a simple heuristic that can be efficiently computed between measurements, even with embedded hardware [26][27][28][29].The algorithm we propose is therefore compatible with modern experimental design and avoids an important limitation of previous approaches.We base our algorithm off of self-guided quantum tomography (SGQT), which treats adaptive tomography as a direct optimization problem rather than a new optimization problem between each measurement [30].Though this affords an efficient and easy to implement adaptive heuristic, SGQT is not without its limitations.It requires assuming that the target state is pure, and it does not return rich region estimates for a state.What PAQT achieves is to effectively combine SGQT with conventional and easily-implemented tomographic estimators, such as the Bayesian particle filter or least-squares fit (LSF) estimators.Under this approach, an experimentalist can collect data using SGQT (even if its assumptions are not met), and then post-process this data using particle filtering or LSF.The benefit of PAQT is two-fold.(1) From the point of view of traditional tomography, it gives an adaptive tomography protocol requiring only modest computational resources, as the bulk of the computational cost is offloaded to post-processing.(2) From the point of view of simulation-based optimization tomography (such as SGQT), it effectively augments the output with region estimation providing a statistically robust quantification of uncertainty.Thus, while we do not explicitly demonstrate that the improved scaling of Ferrie [30] remains in the more general case considered here, PAQT does provide a practical and efficient procedure for performing adaptive quantum tomography with rigorous statistical principles.

arXiv:1605.05039•New Journal of Physics•Sep 29, 2017•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

Comparison of Tomography Methods for Pure and Almost Pure Quantum States

B. I. Bantysh, Andrey Yu. Chernyavskiy, Yu. I. Bogdanov

Quantum tomography is the most informative tool for estimating the quality of preparation and transformation of quantum states. Its development is crucially necessary for debugging of developed quantum processors. Many existing methods of quantum tomography differ in types of performed measurements and in procedures of their processing. The practical implementation of quantum tomography requires the comparison of different methods, which is complicated because of the absence of a general methodology of estimation. A universal methodology based on numerical experiments has been proposed in this work to estimate the quality of quantum state tomography methods. The developed methodology has been applied to three quantum tomography methods (root approach, compressed sensing, and adaptive tomography) efficiently operating with almost pure states, which is relevant for the current technological foundation of the experiments.

Journal of Experimental and Theoretical Physics Letters•May 1, 2020•10 citations

Experimental Study of Optimal Measurements for Quantum State Tomography

Hector Sosa Martinez, Nathan Lysne, Charles H. Baldwin +3 more

Quantum tomography is a critically important tool to evaluate quantum hardware, making it essential to develop optimized measurement strategies that are both accurate and efficient. We compare a variety of strategies using nearly pure test states. Those that are informationally complete for all states are found to be accurate and reliable even in the presence of errors in the measurements themselves, while those designed to be complete only for pure states are far more efficient but highly sensitive to such errors. Our results highlight the unavoidable trade-offs inherent in quantum tomography.

arXiv:1706.03137•Physical Review Letters•Oct 13, 2017•29 citations

The power of being positive: Robust state estimation made possible by quantum mechanics

Amir Kalev, Charles H. Baldwin, Ivan Deutsch

We study the problem of quantum-state tomography under the assumption that the state of the system is close to pure. In this context, an efficient measurements that one typically formulates uniquely identify a pure state from within the set of other pure states. In general such measurements are not robust in the presence of measurement noise and other imperfections, and therefore are less practical for tomography. We argue here that state tomography experiments should instead be done using measurements that can distinguish a pure state from {\em any} other quantum state, of any rank. We show that such nontrivial measurements follows from the physical constraint that the density matrix is positive semidefinite and prove that these measurements yield a robust estimation of the state. We assert that one can implement such tomography relatively simply by measuring only a few random orthonormal bases; our conjecture is supported by numerical evidence. These results are generalized for estimation of states close to bounded-rank.

arXiv:1511.01433•Bulletin of the American Physical Society•Nov 4, 2015•17 citations

Quantum process tomography of unitary and near-unitary maps

Charles H. Baldwin, Amir Kalev, Ivan Deutsch

We study quantum process tomography given the prior information that the map is a unitary or close to a unitary process. We show that a unitary map on a $d$-level system is completely characterized by a minimal set of ${d}^{2}+d$ elements associated with a collection of POVMs, in contrast to the ${d}^{4}\ensuremath{-}{d}^{2}$ elements required for a general completely positive trace-preserving map. To achieve this lower bound, one must probe the map with particular sets of $d$ pure states. We further compare the performance of different estimators inspired by compressed sensing, to reconstruct a near-unitary process from such data. We find that when we have accurate prior information, an appropriate compressed sensing method reduces the required data needed for high-fidelity estimation, and different estimators applied to the same data are sensitive to different types of noise. Convex optimization inspired by the techniques of compressed sensing can therefore be used both as indicators of error models and to validate the use of the prior assumptions.

arXiv:1404.2877•Physical Review A•Jul 17, 2014•87 citations
The development of large-scale platforms for quantum information requires new methods for verification and validation of quantum behavior. Quantum tomography (QT) is the standard tool for diagnosing quantum states, process, and readout devices by providing complete information. However, QT is limited since it is expensive to not only implement experimentally, but also requires heavy classical post-processing of data. In this dissertation, we introduce new methods for QT that are more efficient to implement and robust to noise and errors, thereby making QT a more practical tool for current quantum information experiments. The crucial detail that makes these new, efficient, and robust methods possible is prior information about the quantum system. This prior information is prompted by the goals of most experiments in quantum information, which require pure states, unitary processes, and rank-1 POVM operators. Therefore, most experiments are designed to operate near this ideal regime. We show that when this is the case, QT can be accomplished with significantly fewer resources, and produce a robust estimate in the presence of noise and errors. Moreover, the estimate is also robust if the state is not exactly pure, the process is not exactly unitary, or the POVM is not exactly rank-1. Such compelling methods are only made possible by the positivity constraint on quantum states, processes, and POVMs. This requirement is an inherent feature of quantum mechanics, but has powerful consequences to QT. Since QT is necessarily an experimental tool, we discuss a test of these new methods in an experimental setting. The physical system is an ensemble of laser-cooled cesium atoms in the laboratory of Prof. Poul Jessen. Experiments were conducted by Hector Sosa-Martinez et al. to demonstrate different QT protocols. We compare the results, and conclude that the new methods are effective.
We introduce a fast and accurate heuristic for adaptive tomography that addresses many of the limitations of prior methods.Previous approaches were either too computationally intensive or tailored to handle special cases such as single qubits or pure states.By contrast, our approach combines the efficiency of online optimization with generally applicable and well-motivated data-processing techniques.We numerically demonstrate these advantages in several scenarios including mixed states, higher-dimensional systems, and restricted measurements.Quantum information processing (QIP) promises advantages in a wide range of different contexts, including machine learning [2-4], chemistry simulation [5][6][7], and number theory [8,9].As such, the experimental effort to build useful QIP devices has exploded in recent years.In the course of this effort, quantum tomography is a valuable tool for diagnosing and debugging small quantum devices, and has subsequently seen a variety of different advances.In particular, Bayesian approaches to tomography which are especially well suited to utilizing prior information and adapting to changing experimental conditions have developed significantly in recent years [10-13], presenting a useful experimental tool [14][15][16].In this paper we demonstrate the efficiency and accuracy of an adaptive tomography protocol that we call PAQT: practical adaptive quantum tomography.PAQT intelligently selects new measurements based on the outcomes of previous ones [10,[17][18][19][20][21].Adaptivity has been experimentally demonstrated [14,15,[22][23][24][25], but is not currently standard practice.Though adaptivity increases accuracy, the computational costs incurred outweigh that of simply repeating standard measurements many times.The PAQT approach employs a simple heuristic that can be efficiently computed between measurements, even with embedded hardware [26][27][28][29].The algorithm we propose is therefore compatible with modern experimental design and avoids an important limitation of previous approaches.We base our algorithm off of self-guided quantum tomography (SGQT), which treats adaptive tomography as a direct optimization problem rather than a new optimization problem between each measurement [30].Though this affords an efficient and easy to implement adaptive heuristic, SGQT is not without its limitations.It requires assuming that the target state is pure, and it does not return rich region estimates for a state.What PAQT achieves is to effectively combine SGQT with conventional and easily-implemented tomographic estimators, such as the Bayesian particle filter or least-squares fit (LSF) estimators.Under this approach, an experimentalist can collect data using SGQT (even if its assumptions are not met), and then post-process this data using particle filtering or LSF.The benefit of PAQT is two-fold.(1) From the point of view of traditional tomography, it gives an adaptive tomography protocol requiring only modest computational resources, as the bulk of the computational cost is offloaded to post-processing.(2) From the point of view of simulation-based optimization tomography (such as SGQT), it effectively augments the output with region estimation providing a statistically robust quantification of uncertainty.Thus, while we do not explicitly demonstrate that the improved scaling of Ferrie [30] remains in the more general case considered here, PAQT does provide a practical and efficient procedure for performing adaptive quantum tomography with rigorous statistical principles.
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}.
Quantum tomography is the most informative tool for estimating the quality of preparation and transformation of quantum states. Its development is crucially necessary for debugging of developed quantum processors. Many existing methods of quantum tomography differ in types of performed measurements and in procedures of their processing. The practical implementation of quantum tomography requires the comparison of different methods, which is complicated because of the absence of a general methodology of estimation. A universal methodology based on numerical experiments has been proposed in this work to estimate the quality of quantum state tomography methods. The developed methodology has been applied to three quantum tomography methods (root approach, compressed sensing, and adaptive tomography) efficiently operating with almost pure states, which is relevant for the current technological foundation of the experiments.
Quantum tomography is a critically important tool to evaluate quantum hardware, making it essential to develop optimized measurement strategies that are both accurate and efficient. We compare a variety of strategies using nearly pure test states. Those that are informationally complete for all states are found to be accurate and reliable even in the presence of errors in the measurements themselves, while those designed to be complete only for pure states are far more efficient but highly sensitive to such errors. Our results highlight the unavoidable trade-offs inherent in quantum tomography.
We study the problem of quantum-state tomography under the assumption that the state of the system is close to pure. In this context, an efficient measurements that one typically formulates uniquely identify a pure state from within the set of other pure states. In general such measurements are not robust in the presence of measurement noise and other imperfections, and therefore are less practical for tomography. We argue here that state tomography experiments should instead be done using measurements that can distinguish a pure state from {\em any} other quantum state, of any rank. We show that such nontrivial measurements follows from the physical constraint that the density matrix is positive semidefinite and prove that these measurements yield a robust estimation of the state. We assert that one can implement such tomography relatively simply by measuring only a few random orthonormal bases; our conjecture is supported by numerical evidence. These results are generalized for estimation of states close to bounded-rank.
We study quantum process tomography given the prior information that the map is a unitary or close to a unitary process. We show that a unitary map on a ddd-level system is completely characterized by a minimal set of d2+d{d}^{2}+dd2+d elements associated with a collection of POVMs, in contrast to the ${d}^{4}\ensuremath{-}{d}^{2}$ elements required for a general completely positive trace-preserving map. To achieve this lower bound, one must probe the map with particular sets of ddd pure states. We further compare the performance of different estimators inspired by compressed sensing, to reconstruct a near-unitary process from such data. We find that when we have accurate prior information, an appropriate compressed sensing method reduces the required data needed for high-fidelity estimation, and different estimators applied to the same data are sensitive to different types of noise. Convex optimization inspired by the techniques of compressed sensing can therefore be used both as indicators of error models and to validate the use of the prior assumptions.