2004/06/18 by Sudhir Kumar Singh, Singh, Sudhir Kumar, Sudebkumar Prasant Pal +5
Computer Science · Physics and Astronomy · #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.quant-ph/0406135
openalex publication_date 2004/06/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called \it bicolored merging, based on the monotonicity feature of entanglement measures, for determining combinatorial conditions that must be satisfied for any two distinct multiparticle states to be comparable under local operations and classical communication (LOCC). We present several results based on the possibility or impossibility of comparability of pure multipartite states. We show that there are exponentially many such entangled multipartite states among n agents. Further, we discuss a new graph theoretic metric on a class of multi-partite states, and its implications.