Papers › Fast and simple quantum state estimation
Fast and simple quantum state estimation
Daniel Uzcategui Contreras, Gabriel Senno, Dardo Goyeneche
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.
We present an iterative method to solve the multipartite quantum state estimation problem. We demonstrate convergence for any informationally complete set of generalized quantum measurements in every finite dimension. Our method exhibits fast convergence in high dimension and strong robustness under the presence of realistic errors both in state preparation and measurement stages. In particular, for mutually unbiased bases and tensor product of generalized Pauli observables it converges in a single iteration. We show outperformance of our algorithm with respect to the state-of-the-art of maximum likelihood estimation methods both in runtime and fidelity of the reconstructed states.
Code
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