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:1803.10062 · Physical Review A

Quantum process tomography via completely positive and trace-preserving projection

George C. Knee, Eliot Bolduc, Jonathan Leach, Erik M. Gauger

Published Dec 28, 2018• 95 citations
arXivHTMLPDF

Abstract

We present an algorithm for projecting superoperators onto the set of completely positive, trace-preserving maps. When combined with gradient descent of a cost function, the procedure results in an algorithm for quantum process tomography: finding the quantum process that best fits a set of sufficient observations. We compare the performance of our algorithm to the diluted iterative algorithm as well as second-order solvers interfaced with the popular cvx package for matlab, and find it to be significantly faster and more accurate while guaranteeing a physical estimate.

DOI
10.1103/physreva.98.062336

Related papers

Boosting projective methods for quantum process and detector tomography

Júlia Barberà-Rodríguez, Leonardo Zambrano, Antonio Acín +1 more

We introduce two methods for quantum process and detector tomography. In the quantum process tomography method, we develop an analytical procedure for projecting the linear inversion estimation of a quantum channel onto the set of completely positive trace-preserving matrices. By integrating this method with alternate projection techniques, we achieve a three-order-of-magnitude improvement in approximating the closest quantum channel to an arbitrary Hermitian matrix compared to existing methods without compromising computational efficiency. Our second method extends this approach to quantum detector tomography, demonstrating superior efficiency compared to current techniques. Through numerical simulations, we evaluate our protocols across channels of up to four qubits in quantum process tomography and systems of up to six qubits in quantum detector tomography, showcasing superior precision and efficiency.

arXiv:2406.11646•Physical Review Research•Feb 26, 2025•11 citations

Projected gradient descent algorithms for quantum state tomography

Eliot Bolduc, George C. Knee, Erik M. Gauger +1 more

Abstract Accurate quantum tomography is a vital tool in both fundamental and applied quantum science. It is a task that involves processing a noisy measurement record in order to construct a reliable estimate of an unknown quantum state, and is central to quantum computing, metrology and communication. To date, many different approaches to quantum state estimation have been developed, yet no one method fits all applications, and all fail relatively quickly as the dimensionality of the unknown state grows. In this work, we suggest that projected gradient descent is a method that can evade some of these shortcomings. We present three tomography algorithms that use projected gradient descent and compare their performance with state-of-the-art alternatives, i.e., the diluted iterative algorithm and convex programming. Our results find in favour of the general class of projected gradient descent methods due to their speed, applicability to large states, and the range of conditions in which they perform as well as providing insight into which variant of projected gradient descent ought to be used in various measurement scenarios.

arXiv:1612.09531•npj Quantum Information•Oct 10, 2017•81 citations

Fast and Sure-ious Quantum Process Tomography

A. Afham, Sayantan Sen, Marco Tomamichel

Quantum process tomography (QPT) protocols are often designed by lifting quantum state tomography (QST) protocols through the Choi-Jamiolkowski isomorphism, at the cost of an extra step enforcing the trace-preserving (TP) constraint. Existing approaches fall into two classes. The folklore partial normalization, which sandwiches the density estimate between inverse square roots of its input marginal, has a closed form but is used as a heuristic, its only analyses being asymptotic and losing a factor polynomial in the dimension. Projection-based methods are principled but have no closed forms and scale poorly with dimension. We resolve this dichotomy by showing that the partial normalization is the exact projection onto the Choi states of quantum channels in fidelity (equivalently in Bures or purified distance). Consequently, any QST algorithm with guarantees in fidelity lifts to a QPT algorithm that inherits its sample complexity, through a single closed-form congruence that preserves the Choi rank and is computed in Kraus form without any eigendecomposition of Choi dimension. We lift two single-copy protocols and prove that the non-adaptive one (Fidelity Projected Least Squares) recovers the Choi rank and reaches infidelity $\varepsilon$ from a number of channel uses proportional to $1/\varepsilon$. Numerically, for channels of low Choi rank, it improves on the state-of-the-art projected least squares in accuracy, and by orders of magnitude in the time and memory of the TP-regularization step and of the returned estimate.

quant-pharXiv:2609.39941•Oct 1, 2026•0 citations

Gradient-Descent Quantum Process Tomography by Learning Kraus Operators

Shahnawaz Ahmed, Fernando Quijandría, Anton Frisk Kockum

We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems by learning a process representation using Kraus operators. The Kraus form ensures that the reconstructed process is completely positive. To make the process trace preserving, we use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. Our ansatz uses a few Kraus operators to avoid direct estimation of large process matrices, e.g., the Choi matrix, for low-rank quantum processes. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes, but shines by combining the best features of these two methods. Similar to CS (but unlike PLS), GD-QPT can reconstruct a process from just a small number of random measurements, and similar to PLS (but unlike CS) it also works for larger system sizes, up to at least five qubits. We envisage that the data-driven approach of GD-QPT can become a practical tool that greatly reduces the cost and computational effort for QPT in intermediate-scale quantum systems.

arXiv:2208.00812•Physical Review Letters•Apr 14, 2023•35 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•93 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
We present an algorithm for projecting superoperators onto the set of completely positive, trace-preserving maps. When combined with gradient descent of a cost function, the procedure results in an algorithm for quantum process tomography: finding the quantum process that best fits a set of sufficient observations. We compare the performance of our algorithm to the diluted iterative algorithm as well as second-order solvers interfaced with the popular cvx package for matlab, and find it to be significantly faster and more accurate while guaranteeing a physical estimate.
We introduce two methods for quantum process and detector tomography. In the quantum process tomography method, we develop an analytical procedure for projecting the linear inversion estimation of a quantum channel onto the set of completely positive trace-preserving matrices. By integrating this method with alternate projection techniques, we achieve a three-order-of-magnitude improvement in approximating the closest quantum channel to an arbitrary Hermitian matrix compared to existing methods without compromising computational efficiency. Our second method extends this approach to quantum detector tomography, demonstrating superior efficiency compared to current techniques. Through numerical simulations, we evaluate our protocols across channels of up to four qubits in quantum process tomography and systems of up to six qubits in quantum detector tomography, showcasing superior precision and efficiency.
Abstract Accurate quantum tomography is a vital tool in both fundamental and applied quantum science. It is a task that involves processing a noisy measurement record in order to construct a reliable estimate of an unknown quantum state, and is central to quantum computing, metrology and communication. To date, many different approaches to quantum state estimation have been developed, yet no one method fits all applications, and all fail relatively quickly as the dimensionality of the unknown state grows. In this work, we suggest that projected gradient descent is a method that can evade some of these shortcomings. We present three tomography algorithms that use projected gradient descent and compare their performance with state-of-the-art alternatives, i.e., the diluted iterative algorithm and convex programming. Our results find in favour of the general class of projected gradient descent methods due to their speed, applicability to large states, and the range of conditions in which they perform as well as providing insight into which variant of projected gradient descent ought to be used in various measurement scenarios.
Quantum process tomography (QPT) protocols are often designed by lifting quantum state tomography (QST) protocols through the Choi-Jamiolkowski isomorphism, at the cost of an extra step enforcing the trace-preserving (TP) constraint. Existing approaches fall into two classes. The folklore partial normalization, which sandwiches the density estimate between inverse square roots of its input marginal, has a closed form but is used as a heuristic, its only analyses being asymptotic and losing a factor polynomial in the dimension. Projection-based methods are principled but have no closed forms and scale poorly with dimension. We resolve this dichotomy by showing that the partial normalization is the exact projection onto the Choi states of quantum channels in fidelity (equivalently in Bures or purified distance). Consequently, any QST algorithm with guarantees in fidelity lifts to a QPT algorithm that inherits its sample complexity, through a single closed-form congruence that preserves the Choi rank and is computed in Kraus form without any eigendecomposition of Choi dimension. We lift two single-copy protocols and prove that the non-adaptive one (Fidelity Projected Least Squares) recovers the Choi rank and reaches infidelity ε\varepsilonε from a number of channel uses proportional to 1/ε1/\varepsilon1/ε. Numerically, for channels of low Choi rank, it improves on the state-of-the-art projected least squares in accuracy, and by orders of magnitude in the time and memory of the TP-regularization step and of the returned estimate.
We perform quantum process tomography (QPT) for both discrete- and continuous-variable quantum systems by learning a process representation using Kraus operators. The Kraus form ensures that the reconstructed process is completely positive. To make the process trace preserving, we use a constrained gradient-descent (GD) approach on the so-called Stiefel manifold during optimization to obtain the Kraus operators. Our ansatz uses a few Kraus operators to avoid direct estimation of large process matrices, e.g., the Choi matrix, for low-rank quantum processes. The GD-QPT matches the performance of both compressed-sensing (CS) and projected least-squares (PLS) QPT in benchmarks with two-qubit random processes, but shines by combining the best features of these two methods. Similar to CS (but unlike PLS), GD-QPT can reconstruct a process from just a small number of random measurements, and similar to PLS (but unlike CS) it also works for larger system sizes, up to at least five qubits. We envisage that the data-driven approach of GD-QPT can become a practical tool that greatly reduces the cost and computational effort for QPT in intermediate-scale quantum systems.
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.
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}.