2009/06/30 by Michael Nathanson
Computer Science · Mathematics · Physics and Astronomy · #Quantum Information and Cryptography #Quantum Mechanics and Applications #Random Matrices and Applications #quant-ph
paper · pdf · doi:10.1063/1.3299294
published as Journal of Mathematical Physics vol 51 (2010) 042102 · 11 pages, 2 figures. Published version with small revisions and expanded title.
openalex publication_date 2010/04/01 · arxiv created 2010/04/11 · arxiv updated 2010/04/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We examine the problem of using local operations and classical communication (LOCC) to distinguish a known pure state from an unknown (possibly mixed) state, bounding the error probability from above and below. We study the asymptotic rate of detecting multiple copies of the pure state and show that, if the overlap of the two states is great enough, then they can be distinguished asymptotically as well with LOCC as with global measurements; otherwise, the maximal Schmidt coefficient of the pure state is sufficient to determine the asymptotic error rate.