2005/04/30 by Masahito Hayashi, Keiji Matsumoto, Yoshiyuki Tsuda · 3 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1088/0305-4470/39/46/013
published as J. Phys. A: Math. Gen. 39 (2006) 14427-14446.
arxiv created 2006/09/13 · openalex publication_date 2006/11/01 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/30
We study how well we can answer the question 'Is the given quantum state equal to a certain maximally entangled state?' using LOCC, in the context of hypothesis testing. Under several locality and invariance conditions, optimal tests will be derived for several special cases by using basic theory of group representations. Some optimal tests are realized by performing quantum teleportation and checking whether the state is teleported. We will also give a finite process for realizing some optimal tests. The performance of the tests will be numerically compared.