Adaptive strategies for graph state growth in the presence of monitored errors

Details Adaptive strategies for graph state growth in the presence of monitored errors Adaptive strategies for graph state growth in the presence of monitored errors

2006-06-23

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

Phys. Rev. A 75, 042303 (2007)

Physics

Quantum Physics

4 pages, 4 figures. Typos corrected, nicer figures, neater notation and better read

Scientific paper

10.1103/PhysRevA.75.042303

Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure probability. Moreover, they may generate imperfect entanglement. Here we describe strategies to adapt growth operations in order to cancel incurred errors. Nascent states that initially deviate from the ideal graph states evolve toward the desired high fidelity resource without impractical overheads. Our analysis extends the diagrammatic language of graph states to include characteristics such as tilted vertices, weighted edges, and partial fusion, which arise from experimental imperfections. The strategies we present are relevant to parity projection schemes such as optical `path erasure' with distributed matter qubits.

Affiliated with

Also associated with

No associations

Rating

Adaptive strategies for graph state growth in the presence of monitored errors 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 Adaptive strategies for graph state growth in the presence of monitored errors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive strategies for graph state growth in the presence of monitored errors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-530067