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:quant-ph/0201119 · Journal of Mathematical Physics

Choi’s proof as a recipe for quantum process tomography

Debbie Leung

Published Jan 17, 2003• 100 citations
arXivHTMLPDF

Abstract

Quantum process tomography is a procedure by which an unknown quantum operation can be fully experimentally characterized. We reinterpret Choi’s proof [Linear Algebr. Appl. 10, 285 (1975)] of the fact that any completely positive linear map has a Kraus representation as a method for quantum process tomography. The analysis for obtaining the Kraus operators is extremely simple. We discuss the systems in which this tomography method is particularly suitable.

DOI
10.1063/1.1518554

Related papers

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•25 citations

Existence of Kraus decomposition in infinite dimension via strongly-convergent direct process tomography

Paul E. Lammert

An algorithm is presented for Kraus decomposition of a completely positive operator over separable (countably-infinite-dimensional) Hilbert spaces, together with an elementary proof that the generated sum convergences in strong-operator topology. This improves on the standard, nonconstructive, proof by fusing the abstract problem with practical process tomography. Kraus operators are generated one-by-one, each having one more guaranteed zero matrix entry than the previous one. In this way, the stream of outputs of the algorithm provides a coherent family of Kraus decompositions of restrictions of the target CP map to ever-larger subspaces.

quant-pharXiv:2608.07207•Aug 10, 2026•0 citations

Exponential families for Bayesian quantum process tomography

Kevin Schultz

A Bayesian approach to quantum process tomography has yet to be fully developed due to the lack of appropriate probability distributions on the space of quantum channels. Here, by associating the Choi matrix form of a completely positive, trace preserving (CPTP) map with a particular space of matrices with orthonormal columns, called a Stiefel manifold, we present two parametric probability distributions on the space of CPTP maps that enable Bayesian analysis of process tomography. The first is a probability distribution that has an average Choi matrix as a sufficient statistic. The second is a distribution resulting from binomial likelihood data that enables a simple connection to data gathered through process tomography experiments. These are examples of continuous, nonunitary random CPTP maps that capture meaningful prior information for use in Bayesian estimation. We show how these distributions can be used for point estimation using either maximum a posteriori estimates or expected a posteriori estimates, as well as full Bayesian tomography resulting in posterior credibility intervals. This approach will enable the full power of Bayesian analysis in all forms of quantum characterization, verification, and validation.

arXiv:1705.03853•Physical Review A•Dec 11, 2019•9 citations

The Vector representation of the Standard Quantum Process Tomography

Xiaohua, Wu

The characterization of the evolution of a quantum system is one of the main tasks to accomplish to achieve quantum information processing. The standard quantum process tomography (SQPT) has the unique property that it can be applied without introducing any additional quantum resources. In present work, we shall focus on the following two topics about the SQPT. At first, in the SQPT protocol for a $d$-dimensional system, one should encounter a problem in solving of a set of $d^4$ linear equations in order to get the matrix containing the complete information about the unknown quantum channel. Until now, the general form of the solution is unknown. And a long existed conviction is that the solutions are not unique. Here, we shall develop a self-consistent scheme, in which bounded linear operators are presented by vectors, to construct the set of linear equations. With the famous Cramer's rule for the set of linear equations, we are able to give the general form of the solution and prove that it is unique. In second, the central idea of the SQPT is to prepare a set of linearly independent inputs and measuring the outputs via the quantum state tomography (QST). Letting the inputs and the measurements be prepared by two sets of the rank-one positive-operator-valued measures [POVMs], where each POVM is supposed to be linearly independent and informationally complete (IC), we observe that SQPT now is equivalent to deciding a unknown state with a set of product IC-POVM in the $d^2$-dimensional Hilbert space. Following the general linear state tomography theory, we show that the product symmetric IC-POVM should minimize the mean-square Hilbert-Schmidt distance between the estimator and the true states. So, an optimal SQPT can be realized by preparing both the inputs and the measurements as the symmetric IC-POVM.

arXiv:1212.0105•Dec 1, 2012•0 citations

Simple representation of quantum process tomography

Giuliano Benenti, G. Strini

We show that the Fano representation leads to a particularly simple and appealing form of the quantum process tomography matrix ${\ensuremath{\chi}}_{F}$, in that the matrix ${\ensuremath{\chi}}_{F}$ is real, the number of matrix elements is exactly equal to the number of free parameters required for the complete characterization of a quantum operation, and these matrix elements are directly related to evolution of the expectation values of the system's polarization measurements. These facts are illustrated in the examples of one- and two-qubit quantum noise channels.

arXiv:0905.0578•Physical Review A•Aug 13, 2009•9 citations

De Finetti representation theorem for quantum-process tomography

Christopher A. Fuchs, Rüdiger Schack, Petra F. Scudo

In quantum-process tomography it is possible to express the experimenter's prior information as a sequence of quantum operations, i.e., trace-preserving completely positive maps. In analogy to de Finetti's concept of exchangeability for probability distributions, we give a definition of exchangeability for sequences of quantum operations. We then state and prove a representation theorem for such exchangeable sequences. The theorem leads to a simple characterization of admissible priors for quantum process tomography and solves to a Bayesian's satisfaction the problem of an unknown quantum operation.

arXiv:quant-ph/0307198•Physical Review A•Jun 3, 2004•38 citations
Quantum process tomography is a procedure by which an unknown quantum operation can be fully experimentally characterized. We reinterpret Choi’s proof [Linear Algebr. Appl. 10, 285 (1975)] of the fact that any completely positive linear map has a Kraus representation as a method for quantum process tomography. The analysis for obtaining the Kraus operators is extremely simple. We discuss the systems in which this tomography method is particularly suitable.
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.
An algorithm is presented for Kraus decomposition of a completely positive operator over separable (countably-infinite-dimensional) Hilbert spaces, together with an elementary proof that the generated sum convergences in strong-operator topology. This improves on the standard, nonconstructive, proof by fusing the abstract problem with practical process tomography. Kraus operators are generated one-by-one, each having one more guaranteed zero matrix entry than the previous one. In this way, the stream of outputs of the algorithm provides a coherent family of Kraus decompositions of restrictions of the target CP map to ever-larger subspaces.
A Bayesian approach to quantum process tomography has yet to be fully developed due to the lack of appropriate probability distributions on the space of quantum channels. Here, by associating the Choi matrix form of a completely positive, trace preserving (CPTP) map with a particular space of matrices with orthonormal columns, called a Stiefel manifold, we present two parametric probability distributions on the space of CPTP maps that enable Bayesian analysis of process tomography. The first is a probability distribution that has an average Choi matrix as a sufficient statistic. The second is a distribution resulting from binomial likelihood data that enables a simple connection to data gathered through process tomography experiments. These are examples of continuous, nonunitary random CPTP maps that capture meaningful prior information for use in Bayesian estimation. We show how these distributions can be used for point estimation using either maximum a posteriori estimates or expected a posteriori estimates, as well as full Bayesian tomography resulting in posterior credibility intervals. This approach will enable the full power of Bayesian analysis in all forms of quantum characterization, verification, and validation.
The characterization of the evolution of a quantum system is one of the main tasks to accomplish to achieve quantum information processing. The standard quantum process tomography (SQPT) has the unique property that it can be applied without introducing any additional quantum resources. In present work, we shall focus on the following two topics about the SQPT. At first, in the SQPT protocol for a ddd-dimensional system, one should encounter a problem in solving of a set of d4d^4d4 linear equations in order to get the matrix containing the complete information about the unknown quantum channel. Until now, the general form of the solution is unknown. And a long existed conviction is that the solutions are not unique. Here, we shall develop a self-consistent scheme, in which bounded linear operators are presented by vectors, to construct the set of linear equations. With the famous Cramer's rule for the set of linear equations, we are able to give the general form of the solution and prove that it is unique. In second, the central idea of the SQPT is to prepare a set of linearly independent inputs and measuring the outputs via the quantum state tomography (QST). Letting the inputs and the measurements be prepared by two sets of the rank-one positive-operator-valued measures [POVMs], where each POVM is supposed to be linearly independent and informationally complete (IC), we observe that SQPT now is equivalent to deciding a unknown state with a set of product IC-POVM in the d2d^2d2-dimensional Hilbert space. Following the general linear state tomography theory, we show that the product symmetric IC-POVM should minimize the mean-square Hilbert-Schmidt distance between the estimator and the true states. So, an optimal SQPT can be realized by preparing both the inputs and the measurements as the symmetric IC-POVM.
We show that the Fano representation leads to a particularly simple and appealing form of the quantum process tomography matrix ${\ensuremath{\chi}}_{F}$, in that the matrix ${\ensuremath{\chi}}_{F}$ is real, the number of matrix elements is exactly equal to the number of free parameters required for the complete characterization of a quantum operation, and these matrix elements are directly related to evolution of the expectation values of the system's polarization measurements. These facts are illustrated in the examples of one- and two-qubit quantum noise channels.
In quantum-process tomography it is possible to express the experimenter's prior information as a sequence of quantum operations, i.e., trace-preserving completely positive maps. In analogy to de Finetti's concept of exchangeability for probability distributions, we give a definition of exchangeability for sequences of quantum operations. We then state and prove a representation theorem for such exchangeable sequences. The theorem leads to a simple characterization of admissible priors for quantum process tomography and solves to a Bayesian's satisfaction the problem of an unknown quantum operation.