A two-stage solution to quantum process tomography: error analysis and optimal design
Shuixin Xiao, Yuanlong Wang, Jun Zhang, Daoyi Dong, Gary J. Mooney, Ian R. Petersen, Hidehiro Yonezawa
TL;DR
The paper introduces a two-stage analytical solution for quantum process tomography (QPT) that applies to both trace-preserving and non-trace-preserving dynamics by exploiting a tensor structure to achieve $O(MLd^2)$ time and $O(ML)$ storage. It provides an explicit analytical error upper bound and proposes optimal input states and measurement operators (e.g., SIC and MUB configurations) to minimize the bound and maximize robustness, with a closed-form estimation that bypasses heavy convex optimization. The approach is validated through numerical simulations and IBM quantum-device experiments, showing favorable scalability and performance compared to convex methods, especially for unitary-like processes. The results offer practical pathways to efficient and robust QPT, with a clear route to extending the framework to ancillary-based tomographic schemes and broader process classes.
Abstract
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 $ 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.
