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 vertex ring graph state is improved to 2.9275, less than the upper bound determined by local operations and classical communication. An upper bound of entanglement is proposed based on the definition of graph state. Author: Xiao-Yu Chen, College of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou 310018, China
Dear Saeed,
I donot know whether I am answering your question or Prof. Chen's question but since I feel like answering the question I 'll give you an even more tangential answer. Since there are finite combinations of the two dimensional graph coordinates whatever method you use in computation have to be uppersemicontinuous even if you make probabilistic entries. SKM QC
- Badges
- Science topic
- Similar topics
- Physical Sciences
- Theoretical Physics