Efficient Graph State Construction Under the Barrett and Kok Scheme

Details Efficient Graph State Construction Under the Barrett and Kok Scheme Efficient Graph State Construction Under the Barrett and Kok Scheme

2005-04-14

arxiv.org/abs/quant-ph/0504111v2

Phys. Rev. A 72, 056302 (2005).

Physics

Quantum Physics

3 pages, 3 figures. Small refinements

Scientific paper

Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However by viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p=0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The BK scheme then becomes competitive with the more elaborate entanglement procedures designed to permit p to approach unity.

Affiliated with

Also associated with

No associations

Rating

Efficient Graph State Construction Under the Barrett and Kok Scheme 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 Efficient Graph State Construction Under the Barrett and Kok Scheme, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Graph State Construction Under the Barrett and Kok Scheme will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-401645