Chordal Graphs and Distinguishability of Quantum Product States
Authors:
- Comfort MintahCMComfort Mintah
- David W. KribsDKDavid W. Kribs
- Michael NathansonMNMichael Nathanson
- Rajesh PereiraRPRajesh Pereira
Preprint
Abstract
We investigate a graph-theoretic approach to the problem of distinguishing quantum product states in the fundamental quantum communication framework called local operations and classical communication (LOCC). We identify chordality as the key graph structure that drives distinguishability in one-way LOCC, and we derive a one-way LOCC characterization for chordal graphs that establishes a connection with the theory of matrix completions. We also derive minimality conditions on graph parameters that allow for the determination of indistinguishability of states. We present a number of applications and examples built on these results.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Three maximally entangled states can require two-way local operations and classical communication for local discriminationPhysical Review A, 2013
- Four Locally Indistinguishable Ququad-Ququad Orthogonal Maximally Entangled StatesPhysical Review Letters, 2012
- Minimum semidefinite rank of outerplanar graphs and the tree cover numberThe Electronic Journal of Linear Algebra, 2011
- Linearly independent vertices and minimum semidefinite rankLinear Algebra and its Applications, 2009
- Distinguishing bipartitite orthogonal states using LOCC: Best and worst casesJournal of Mathematical Physics, 2005
- Hiding Classical Data in Multipartite Quantum StatesPhysical Review Letters, 2002
- Local Distinguishability of Multipartite Orthogonal Quantum StatesPhysical Review Letters, 2000
- A correction: orthogonal representations and connectivity of graphsLinear Algebra and its Applications, 2000