Quantum state tomography (QST) is one of the fundamental problems in quantum information. Among various metrics, sample complexity is widely used to evaluate QST algorithms. While multi-copy measurements are known to achieve optimal sample complexity, they are challenging to implement on near-term quantum devices. In practice, single-copy measurements with shallow-depth circuits are more feasible. Although a near-optimal QST algorithm under single-qubit measurements has recently been proposed, its sample complexity does not match the known lower bound for single-copy measurements. Here, we make two contributions by employing circuits with depth on an -qubit system. First, QST for rank- -dimensional state can be achieved with sample complexity to error in trace distance, which is near-optimal up to a factor compared to the known lower bound . Second, for the general case of , we can remove the factor, yielding an optimal sample complexity of .

生成讲解博客的中文版本

生成AI智能校验的中文版本