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.
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)where d is the dimension of the quantum system andM,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) is a fundamental task to characterize the dynamics of quantum systems. In contrast to standard QPT, ancilla-assisted process tomography (AAPT) framework introduces an extra ancilla system such that a single input state is needed. In this paper, we extend the two-stage solution, a method originally designed for standard QPT, to perform AAPT. Our algorithm hasO(MdA2dB2)computational complexity whereMis the type number of the measurement operators,dAis the dimension of the quantum system of interest, anddBis the dimension of the ancilla system. Then we establish an error upper bound and further discuss the optimal design on the input state in AAPT. A numerical example on a phase damping process demonstrates the effectiveness of the optimal design and illustrates the theoretical error analysis.
Quantum process tomography (QPT) is a critical task for characterizing the dynamics of quantum systems and achieving precise quantum control. In this paper, we propose an effective two-stage solution (TSS) for QPT in the natural basis. Our algorithm has O(d6) computational complexity where d is the dimension of the quantum system. We establish an error bound O(Nd5) where N is the copy number for each output state. The numerical examples compared with a convex optimization algorithm demonstrate the effectiveness of our algorithm.
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.
Quantum channel tomography (also known as quantum process tomography) is a fundamental task in quantum information and quantum computing, aiming to learn the full description of an unknown quantum channel from black-box queries. For channels with input dimension d1, output dimension d2, and Kraus rank at most r, [CGO+26] identifies the dilation rate τ=rd2/d1≥1 as a key parameter governing a Heisenberg-to-classical transition in query complexity. While the optimal bounds in the boundary regime (τ=1) and the away-from-boundary regime (τ≥1+Ω(1)) are now known, the precise behavior in the near-boundary regime (1<τ<1+o(1)) has remained unresolved.
In this paper, we close this gap, thereby fully settling the query complexity of quantum channel tomography. Specifically, we show that the query complexity is
- Ω(rd1d2/ε2) for diamond norm error ε, matching the upper bound by [MB26, CGO+26],
- Θ(d12/ε+min{(τ−1)d12,(τ−1)2d12d22}/ε2) for Choi trace norm error ε.
Our results reveal two qualitatively different forms of the Heisenberg-to-classical transition. For diamond norm tomography, the Heisenberg scaling disappears suddenly as soon as τ leaves the boundary regime. In contrast, Choi trace norm tomography exhibits a gradual transition from Heisenberg to classical scaling as τ moves from the boundary regime to the away-from-boundary regime.
Quantum detector tomography is a fundamental technique for calibrating quantum devices and performing quantum engineering tasks. In this paper, a novel quantum detector tomography method is proposed. First, a series of different probe states are used to generate measurement data. Then, using constrained linear regression estimation, a stage-1 estimation of the detector is obtained. Finally, the positive semidefinite requirement is added to guarantee a physical stage-2 estimation. This Two-stage Estimation (TSE) method has computational complexity O(nd2M), where n is the number of d-dimensional detector matrices and M is the number of different probe states. An error upper bound is established, and optimization on the coherent probe states is investigated. We perform simulation and a quantum optical experiment to testify the effectiveness of the TSE method.
Quantum process tomography (QPT) methods aim at identifying a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates, which are the building blocks of quantum computers. The present paper focuses on the estimation of a unitary process. This class is of particular interest because quantum mechanics postulates that the evolution of any closed quantum system is described by a unitary transformation. Unitary processes have significantly fewer parameters than general quantum processes (22nqb vs. 24nqb−22nqb real independent parameters for nqb qubits). By assuming that the process is unitary we develop two methods that scale better with the size of the system. In the present paper, we stay as close as possible to the standard setup of QPT: the operator has to prepare copies of different input states. The properties those states have to satisfy in order for our method to achieve QPT are very mild. Therefore, we choose to operate with copies of 2nqb initially unknown pure input states. In order to perform QPT without knowing the input states, we perform measurements on half the copies of each state, and let the other half be transformed by the system before measuring them (each copy is only measured once). This setup has the advantage of removing the issue of systematic (i.e., same on all the copies of a state) errors entirely because it does not require the process input to take predefined values. We develop a straightforward analytical solution that first estimates the states from the averaged measurements and then finds the unitary matrix (representing the process) coherent with those estimates by using our analytical solution to an extended version of Wahba’s problem. This estimate may then be used as an initial point for a fine tuning algorithm that maximizes the likelihood of the measurements. Simulation results show the effectiveness of the proposed methods.