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

Simple item page
dc.creatorCampbell, Earl T.
dc.creatorFitzsimons, Joseph
dc.creatorBenjamin, Simon C.
dc.creatorKok, Pieter
dc.date2006-06-23
dc.date2007-02-08
dc.date.accessioned2026-07-07T08:00:09Z
dc.date.available2026-07-07T08:00:09Z
dc.descriptionGraph 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.
dc.description4 pages, 4 figures. Typos corrected, nicer figures, neater notation and better read
dc.identifierhttps://arxiv.org/abs/quant-ph/0606199
dc.identifierhttp://arxiv.org/abs/quant-ph/0606199
dc.identifierPhys. Rev. A 75, 042303 (2007)
dc.identifierdoi:10.1103/PhysRevA.75.042303
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128610
dc.subjectQuantum Physics
dc.titleAdaptive strategies for graph state growth in the presence of monitored errors
dc.typetext

Files

Collections

arXiv