Colouring an Orthogonality Graph

Details Colouring an Orthogonality Graph Colouring an Orthogonality Graph

2005-09-07

arxiv.org/abs/math/0509151v1

Mathematics

Combinatorics

13 pages

Scientific paper

We deal with a graph colouring problem that arises in quantum information theory. Alice and Bob are each given a $\pm1$-vector of length $k$, and are to respond with $k$ bits. Their responses must be equal if they are given equal inputs, and distinct if they are given orthogonal inputs; however, they are not allowed to communicate any information about their inputs. They can always succeed using quantum entanglement, but their ability to succeed using only classical physics is equivalent to a graph colouring problem. We resolve the graph colouring problem, thus determining that they can succeed without entanglement exactly when $k\leq3$.

Affiliated with

Also associated with

No associations

Rating

Colouring an Orthogonality Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Colouring an Orthogonality Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Colouring an Orthogonality Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-215941