Abstract In the present work, we propose a generalization of the confidence polytopes approach for quantum state tomography (QST) to the case of quantum process tomography (QPT). Our approach allows obtaining a confidence region in the polytope form for a Choi matrix of an unknown quantum channel based on the measurement results of the corresponding QPT experiment. The method uses the improved version of the expression for confidence levels for the case of several positive operator-valued measures. We then demonstrate how confidence polytopes can be employed for calculating confidence intervals for affine functions of quantum states (Choi matrices), such as fidelities and observables mean values, which are used both in QST and QPT settings. As we propose, this problem can be efficiently solved using linear programming tools. We also study the performance and scalability of the developed approach on the basis of simulation and experimental data collected using IBM cloud quantum processor.
Abstract In the present work, we propose a generalization of the confidence polytopes approach for quantum state tomography (QST) to the case of quantum process tomography (QPT). Our approach allows obtaining a confidence region in the polytope form for a Choi matrix of an unknown quantum channel based on the measurement results of the corresponding QPT experiment. The method uses the improved version of the expression for confidence levels for the case of several positive operator-valued measures. We then demonstrate how confidence polytopes can be employed for calculating confidence intervals for affine functions of quantum states (Choi matrices), such as fidelities and observables mean values, which are used both in QST and QPT settings. As we propose, this problem can be efficiently solved using linear programming tools. We also study the performance and scalability of the developed approach on the basis of simulation and experimental data collected using IBM cloud quantum processor.
We propose and investigate a new method of quantum process tomography (QPT) which we call projected least squares (PLS). In short, PLS consists of first computing the least-squares estimator of the Choi matrix of an unknown channel, and subsequently projecting it onto the convex set of Choi matrices. We consider four experimental setups including direct QPT with Pauli eigenvectors as input and Pauli measurements, and ancilla-assisted QPT with mutually unbiased bases (MUB) measurements. In each case, we provide a closed form solution for the least-squares estimator of the Choi matrix. We propose a novel, two-step method for projecting these estimators onto the set of matrices representing physical quantum channels, and a fast numerical implementation in the form of the hyperplane intersection projection algorithm. We provide rigorous, non-asymptotic concentration bounds, sampling complexities and confidence regions for the Frobenius and trace-norm error of the estimators. For the Frobenius error, the bounds are linear in the rank of the Choi matrix, and for low ranks, they improve the error rates of the least squares estimator by a factor d2 , where d is the system dimension. We illustrate the method with numerical experiments involving channels on systems with up to 7 qubits, and find that PLS has highly competitive accuracy and computational tractability.
Quantum tomography is a widely applicable method for reconstructing unknown quantum states and processes. However, its applications in quantum technologies usually also require estimating the difference between prepared and target quantum states with reliable confidence intervals. In this work we suggest a computationally efficient and reliable scheme for determining well-justified error bars for quantum tomography. We approximate the probability distribution of the Hilbert-Schmidt distance between the target state and the estimation, which is given by the linear inversion, by calculating its two moments. We also present a generalization of this approach for quantum process tomography and deriving confidence intervals for affine functions. We benchmark our approach for a number of quantum tomography protocols using both simulation and demonstration with the use of a cloud-accessible quantum processor. The obtained results pave the way for the use of the suggested scheme for the complete characterization of quantum systems of various natures.
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 ε from a number of channel uses proportional to 1/ε. 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.
Quantum state tomography is the task of inferring the state of a quantum system from measurement data. A reliable tomography scheme should not only report an estimate for that state, but also well-justified error bars. These may be specified in terms of confidence regions, i.e., subsets of the state space which contain the system's state with high probability. Here, building upon a quantum generalization of Clopper-Pearson confidence intervals-a notion known from classical statistics-we present a simple and reliable scheme for generating confidence regions. These have the shape of a polytope and can be computed efficiently. We provide several examples to demonstrate the practical usability of the scheme in experiments.
ABSTRACT Quantum process tomography (QPT) plays a central role in characterizing quantum gates and circuits, diagnosing quantum devices, calibrating hardware, and supporting quantum error correction. However, conventional QPT methods face challenges related to scalability and sensitivity to noise. In this work, we propose a QPT framework based on quantum compilation, which represents quantum processes using optimized Kraus operators and Choi matrices. By formulating QPT as a compilation and optimization problem, our approach significantly reducing measurement and computational overhead while maintaining reconstruction accuracy. We benchmark the method using numerical simulations of Haar‐random unitary gates and demonstrate a reliable process reconstruction. We further apply the framework to dephasing channels with both time‐homogeneous and time‐inhomogeneous noise, as well as to depolarizing and amplitude‐damping channels, where stable performance is observed across different noise regimes. These results indicate that quantum compilation–based QPT can serve as a practical alternative to standard QPT methods for quantum process characterization and device validation.
Quantum State Tomography (QST), Quantum Process Tomography (QPT), and Quantum Network Tomography (QNT) are related parameter-estimation problems that aim to reconstruct different physical quantities. QST estimates an unknown quantum state, represented by its density matrix, from the measurement outcomes. QPT characterises an unknown quantum channel using known input states and measurements of the corresponding outputs. QNT, in contrast, aims to infer parameters associated with individual links from end-to-end probe measurements collected at accessible monitor nodes. A key distinction among the three tomography problems lies in the conditions required to achieve identifiability, the ability to determine unknown parameters uniquely from the available measurement statistics. In QST and QPT, the experimenter can choose an Informationally Complete (IC) measurement set. QNT limits the reachable measurements to what topology and monitor placement allow, so the admissible probe paths fix the information available about the link parameters. This work studies all three tomography problems through a common Fisher Information Matrix (FIM). We factorise QNT FIM and show that its rank equals the rank of the path-link incidence matrix at every interior parameter value, so local and global identifiability coincide. We then show that QST and QPT attain full rank under IC settings, QNT loses rank when the probe paths leave link parameters indistinguishable, and increasing the number of copies scales the FIM eigenvalues while leaving its rank fixed.