The entanglement of some non-two-colorable graph states

Details The entanglement of some non-two-colorable graph states The entanglement of some non-two-colorable graph states

2009-06-28

arxiv.org/abs/0906.5130v2

Physics

Quantum Physics

6 pages, 1 figure

Scientific paper

We exactly evaluate the entanglement of a six vertex and a nine vertex graph
states which correspond to non ''two-colorable'' graphs. The upper bound of
entanglement for five vertices ring graph state is improved to 2.9275, less
than upper bound determined by LOCC. An upper bound of entanglement is proposed
based on the definition of graph state.

Affiliated with

Also associated with

No associations

Rating

The entanglement of some non-two-colorable graph states 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 The entanglement of some non-two-colorable graph states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The entanglement of some non-two-colorable graph states will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180597