Generalized collective quantum tomography: algorithm design, optimization, and validation
Abstract
Quantum tomography is a fundamental technique for characterizing, benchmarking, and verifying quantum states and devices. It plays a crucial role in advancing quantum technologies and deepening our understanding of quantum mechanics. Collective quantum state tomography, which estimates an unknown state \r{ho} through joint measurements on multiple copies of the unknown state, offers superior information extraction efficiency. Here we extend this framework to a generalized setting where the target becomes , with each representing identical or distinct quantum states, detectors, or processes from the same category. We formulate these tasks as optimization problems and develop three algorithms for collective quantum state, detector and process tomography, respectively, each accompanied by an analytical characterization of the computational complexity and mean squared error (MSE) scaling. Furthermore, we develop optimal solutions of these optimization problems using sum of squares (SOS) techniques with semi-algebraic constraints. The effectiveness of our proposed methods is demonstrated through numerical examples. Additionally, we experimentally demonstrate the algorithms using two-copy collective measurements, where entangled measurements directly provide information about the state purity. Compared to existing methods, our algorithms achieve lower MSEs and approach the collective MSE bound by effectively leveraging purity information.
Cite
@article{arxiv.2510.25466,
title = {Generalized collective quantum tomography: algorithm design, optimization, and validation},
author = {Shuixin Xiao and Yuanlong Wang and Zhibo Hou and Aritra Das and Ian R. Petersen and Farhad Farokhi and Guo-Yong Xiang and Jie Zhao and Daoyi Dong},
journal= {arXiv preprint arXiv:2510.25466},
year = {2025}
}