Papers › Adaptive Procedures for Discrimination Between Arbitrary Tensor-Product Quantum States
Adaptive Procedures for Discrimination Between Arbitrary Tensor-Product Quantum States
Sarah Brandsen, Mengke Lian, Kevin D. Stubbs, Narayanan Rengaswamy, Henry D. Pfister
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.
Discrimination between quantum states is a fundamental task in quantum information theory. Given two arbitrary tensor-product quantum states (TPQS) ρ_± = ρ_±⁽¹⁾ ⊗⋯⊗ρ_±⁽ᴺ⁾, determining the joint N-system measurement to optimally distinguish between the two states is a hard problem. Thus, there is great interest in identifying local measurement schemes that are optimal or close-to-optimal. In this work, we focus on distinguishing between two general TPQS. We begin by generalizing previous work by Acin et al. (Phys. Rev. A 71, 032338) to show that a locally greedy (LG) scheme using Bayesian updating can optimally distinguish between two states that can be written as tensor products of arbitrary pure states. Then, we show that even in the limit of large N the same algorithm cannot distinguish tensor products of mixed states with vanishing error probability. This poor asymptotic behavior occurs because the Helstrom measurement becomes trivial for sufficiently biased priors. Based on this, we introduce a modified locally greedy (MLG) scheme with strictly better performance. In the second part of this work, we compare these simple local schemes with a general dynamic programming (DP) approach that finds the optimal series of local measurements to distinguish the two states. When the subsystems are non-identical, we demonstrate that the ordering of the systems affects performance and we extend the DP technique to determine the optimal ordering adaptively. Finally, in contrast to the binary optimal collective measurement, we show that adaptive protocols on sufficiently large (e.g., qutrit) subsystems must contain non-binary measurements to be optimal. (The code that produced the simulation results in this paper can be found at: https://github.com/SarahBrandsen/AdaptiveStateDiscrimination)
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