Papers › Quantum tomography benchmarking

Quantum tomography benchmarking

31 Dec 2020arXiv:2012.15656links table onlyarchive 2025-07-28

B. I. Bantysh, A. Yu. Chernyavskiy, Yu. I. Bogdanov

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Recent advances in quantum computers and simulators are steadily leading us towards full-scale quantum computing devices. Due to the fact that debugging is necessary to create any computing device, quantum tomography (QT) is a critical milestone on this path. In practice, the choice between different QT methods faces the lack of comparison methodology. Modern research provides a wide range of QT methods, which differ in their application areas, as well as experimental and computational complexity. Testing such methods is also being made under different conditions, and various efficiency measures are being applied. Moreover, many methods have complex programming implementations; thus, comparison becomes extremely difficult. In this study, we have developed a general methodology for comparing quantum state tomography methods. The methodology is based on an estimate of the resources needed to achieve the required accuracy. We have developed a software library (in MATLAB and Python) that makes it easy to analyze any QT method implementation through a series of numerical experiments. The conditions for such a simulation are set by the number of tests corresponding to real physical experiments. As a validation of the proposed methodology and software, we analyzed and compared a set of QT methods. The analysis revealed some method-specific features and provided estimates of the relative efficiency of the methods.

PaperPDFCode

Code

PQCLab/pyQTB officialmentioned in papermentioned on GitHub report
PQCLab/mQTB officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections