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:2205.10453 · Physical Review Applied

Selective and Efficient Quantum Process Tomography for Non-Trace-Preserving Maps: Implementation with a Superconducting Quantum Processor

Quimey Pears Stefano, Ignacio Perito, Lorena Rebón

Published Apr 21, 2023• 2 citations
arXivHTMLPDF

Abstract

Alternatively to the full reconstruction of an unknown quantum process, the so-called selective and efficient quantum process tomography (SEQPT) allows estimating, individually and up to the required accuracy, a given element of the matrix that describes such an operation with a polynomial amount of resources. The implementation of this protocol has been carried out with success to characterize the evolution of a quantum system that is well described by a trace-preserving quantum map. Here, we deal with a more general type of quantum process that does not preserve the trace of the input quantum state, which naturally arises in the presence of imperfect devices and system-environment interactions, in the context of quantum information science or quantum dynamics control. In that case, we show with the aid of a priori information on the losses structure of the quantum channel that the SEQPT reconstruction can be adapted to reconstruct the non-trace-preserving map. We explicitly describe how to implement the reconstruction in an arbitrary Hilbert space of finite dimension $d$. The method is experimentally verified on a superconducting quantum processor provided by IBM Quantum services, by estimating several non-trace-preserving quantum processes in dimensions up to $d=6$. Our results show that it is possible to efficiently reconstruct non-trace-preserving processes, with high precision, and with significantly higher fidelity than when the process is assumed to be trace preserving.

DOI
10.1103/physrevapplied.19.044065

Related papers

Experimental quantum process tomography of non-trace-preserving maps

Irene Bongioanni, Linda Sansoni, Fabio Sciarrino +2 more

The ability of fully reconstructing quantum maps is a fundamental task of quantum information, in particular when coupling with the environment and experimental imperfections of devices are taken into account. In this context, we carry out a quantum process tomography approach for a set of non-trace-preserving maps. We introduce an operator $\mathcal{P}$ to characterize the state-dependent probability of success for the process under investigation. We also evaluate the result of approximating the process with a trace-preserving one.

arXiv:1008.5334•Physical Review A•Oct 11, 2010•77 citations

Experimental characterization of quantum processes: A selective and efficient method in arbitrary finite dimensions

Quimey Pears Stefano, Ignacio Perito, J. J. M. Varga +2 more

The temporal evolution of a quantum system can be characterized by quantum process tomography, a complex task that consumes a number of physical resources scaling exponentially with the number of subsystems. An alternative approach to the full reconstruction of a quantum channel is the selective and efficient quantum process tomography, a method that allows estimating, individually and up to the required accuracy, each element of the matrix that describes the process, using only a polynomial amount of resources. The implementation of this protocol is closely related to the possibility of building a complete set of mutually unbiased bases (MUBs), whose existence is known only when the dimension of the Hilbert space is the power of a prime number. However, an extension of the method that uses tensor products of maximal sets of MUBs has been recently introduced. Here we explicitly describe how to implement the algorithm for a selective and efficient estimation of a quantum process in a nonprime power dimension and conduct, an experimental verification of the method in a Hilbert space of dimension $d=6$. This is the smallest space for which a complete set of MUBs is not known to exist, but it can be decomposed as a tensor product of two Hilbert spaces of dimensions ${D}_{1}=2$ and ${D}_{2}=3$, in which a complete set of MUBs is already known. The six-dimensional states were codified in the discretized transverse linear momentum of photons. The state preparation and detection stages are dynamically programed with the use of only-phase spatial light modulators, in a versatile experimental setup that allows one to implement the algorithm in any finite dimension.

arXiv:2011.08228•Physical Review A•May 28, 2021•3 citations

Implementing efficient selective quantum process tomography of superconducting quantum gates on IBM quantum experience

Akshay Vijay Gaikwad, Krishna Shende, Arvind +1 more

The experimental implementation of selective quantum process tomography (SQPT) involves computing individual elements of the process matrix with the help of a special set of states called quantum 2-design states. However, the number of experimental settings required to prepare input states from quantum 2-design states to selectively and precisely compute a desired element of the process matrix is still high, and hence constructing the corresponding unitary operations in the lab is a daunting task. In order to reduce the experimental complexity, we mathematically reformulated the standard SQPT problem, which we term the modified SQPT (MSQPT) method. We designed the generalized quantum circuit to prepare the required set of input states and formulated an efficient measurement strategy aimed at minimizing the experimental cost of SQPT. We experimentally demonstrated the MSQPT protocol on the IBM QX2 cloud quantum processor and selectively characterized various two- and three-qubit quantum gates.

arXiv:2107.07462•Scientific Reports•Mar 7, 2022•20 citations

A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design

Shuixin Xiao, Yuanlong Wang, Jun Zhang +4 more

Quantum process tomography is a critical task for characterizing the dynamics of quantum systems and achieving precise quantum control. In this paper, we propose a two-stage solution for both trace-preserving and non-trace-preserving quantum process tomography. Utilizing a tensor structure, our algorithm exhibits a computational complexity of$O(MLd^{2})$where d is the dimension of the quantum system and$M, L~(M\geq d^{2}, L\geq d^{2})$represent the numbers of different input states and measurement operators, respectively. We establish an analytical error upper bound and then design the optimal input states and the optimal measurement operators, which are both based on minimizing the error upper bound and maximizing the robustness characterized by the condition number. Numerical examples and testing on IBM quantum devices are presented to demonstrate the performance and efficiency of our algorithm.

arXiv:2402.08952•IEEE Transactions on Information Theory•Dec 24, 2024•4 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

Selective and efficient quantum process tomography

Ariel Bendersky, Fernando Pastawski, Juan Pablo Paz

In this paper we describe in detail and generalize a method for quantum process tomography that was presented by Bendersky et al. [Phys. Rev. Lett. 100, 190403 (2008)]. The method enables the efficient estimation of any element of the $\ensuremath{\chi}$ matrix of a quantum process. Such elements are estimated as averages over experimental outcomes with a precision that is fixed by the number of repetitions of the experiment. Resources required implementing it scale polynomially with the number of qubits of the system. The estimation of all diagonal elements of the $\ensuremath{\chi}$ matrix can be efficiently done without any ancillary qubits. In turn, the estimation of all the off-diagonal elements requires an extra clean qubit. The key ideas of the method, which is based on efficient estimation by random sampling over a set of states forming a 2-design, are described in detail. Efficient methods for preparing and detecting such states are explicitly shown.

arXiv:0906.3002•Physical Review A•Sep 24, 2009•47 citations
Alternatively to the full reconstruction of an unknown quantum process, the so-called selective and efficient quantum process tomography (SEQPT) allows estimating, individually and up to the required accuracy, a given element of the matrix that describes such an operation with a polynomial amount of resources. The implementation of this protocol has been carried out with success to characterize the evolution of a quantum system that is well described by a trace-preserving quantum map. Here, we deal with a more general type of quantum process that does not preserve the trace of the input quantum state, which naturally arises in the presence of imperfect devices and system-environment interactions, in the context of quantum information science or quantum dynamics control. In that case, we show with the aid of a priori information on the losses structure of the quantum channel that the SEQPT reconstruction can be adapted to reconstruct the non-trace-preserving map. We explicitly describe how to implement the reconstruction in an arbitrary Hilbert space of finite dimension ddd. The method is experimentally verified on a superconducting quantum processor provided by IBM Quantum services, by estimating several non-trace-preserving quantum processes in dimensions up to d=6d=6d=6. Our results show that it is possible to efficiently reconstruct non-trace-preserving processes, with high precision, and with significantly higher fidelity than when the process is assumed to be trace preserving.
The ability of fully reconstructing quantum maps is a fundamental task of quantum information, in particular when coupling with the environment and experimental imperfections of devices are taken into account. In this context, we carry out a quantum process tomography approach for a set of non-trace-preserving maps. We introduce an operator P\mathcal{P}P to characterize the state-dependent probability of success for the process under investigation. We also evaluate the result of approximating the process with a trace-preserving one.
The temporal evolution of a quantum system can be characterized by quantum process tomography, a complex task that consumes a number of physical resources scaling exponentially with the number of subsystems. An alternative approach to the full reconstruction of a quantum channel is the selective and efficient quantum process tomography, a method that allows estimating, individually and up to the required accuracy, each element of the matrix that describes the process, using only a polynomial amount of resources. The implementation of this protocol is closely related to the possibility of building a complete set of mutually unbiased bases (MUBs), whose existence is known only when the dimension of the Hilbert space is the power of a prime number. However, an extension of the method that uses tensor products of maximal sets of MUBs has been recently introduced. Here we explicitly describe how to implement the algorithm for a selective and efficient estimation of a quantum process in a nonprime power dimension and conduct, an experimental verification of the method in a Hilbert space of dimension d=6d=6d=6. This is the smallest space for which a complete set of MUBs is not known to exist, but it can be decomposed as a tensor product of two Hilbert spaces of dimensions D1=2{D}_{1}=2D1​=2 and D2=3{D}_{2}=3D2​=3, in which a complete set of MUBs is already known. The six-dimensional states were codified in the discretized transverse linear momentum of photons. The state preparation and detection stages are dynamically programed with the use of only-phase spatial light modulators, in a versatile experimental setup that allows one to implement the algorithm in any finite dimension.
The experimental implementation of selective quantum process tomography (SQPT) involves computing individual elements of the process matrix with the help of a special set of states called quantum 2-design states. However, the number of experimental settings required to prepare input states from quantum 2-design states to selectively and precisely compute a desired element of the process matrix is still high, and hence constructing the corresponding unitary operations in the lab is a daunting task. In order to reduce the experimental complexity, we mathematically reformulated the standard SQPT problem, which we term the modified SQPT (MSQPT) method. We designed the generalized quantum circuit to prepare the required set of input states and formulated an efficient measurement strategy aimed at minimizing the experimental cost of SQPT. We experimentally demonstrated the MSQPT protocol on the IBM QX2 cloud quantum processor and selectively characterized various two- and three-qubit quantum gates.
Quantum process tomography is a critical task for characterizing the dynamics of quantum systems and achieving precise quantum control. In this paper, we propose a two-stage solution for both trace-preserving and non-trace-preserving quantum process tomography. Utilizing a tensor structure, our algorithm exhibits a computational complexity ofO(MLd2)O(MLd^{2})O(MLd2)where d is the dimension of the quantum system andM,L (M≥d2,L≥d2)M, L~(M\geq d^{2}, L\geq d^{2})M,L (M≥d2,L≥d2)represent the numbers of different input states and measurement operators, respectively. We establish an analytical error upper bound and then design the optimal input states and the optimal measurement operators, which are both based on minimizing the error upper bound and maximizing the robustness characterized by the condition number. Numerical examples and testing on IBM quantum devices are presented to demonstrate the performance and efficiency of our algorithm.
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.
In this paper we describe in detail and generalize a method for quantum process tomography that was presented by Bendersky et al. [Phys. Rev. Lett. 100, 190403 (2008)]. The method enables the efficient estimation of any element of the $\ensuremath{\chi}$ matrix of a quantum process. Such elements are estimated as averages over experimental outcomes with a precision that is fixed by the number of repetitions of the experiment. Resources required implementing it scale polynomially with the number of qubits of the system. The estimation of all diagonal elements of the $\ensuremath{\chi}$ matrix can be efficiently done without any ancillary qubits. In turn, the estimation of all the off-diagonal elements requires an extra clean qubit. The key ideas of the method, which is based on efficient estimation by random sampling over a set of states forming a 2-design, are described in detail. Efficient methods for preparing and detecting such states are explicitly shown.