2006/06/30 by Earl T. Campbell, Joseph F. Fitzsimons, Joseph Fitzsimons +2 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Cluster state #Computer science #Constructive #Erasure #Fidelity #Graph #Imperfect #Mathematics #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Qubit #Spurious relationship #Squashed entanglement #Statistical physics #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physreva.75.042303
published as Phys. Rev. A 75, 042303 (2007) · 4 pages, 4 figures. Typos corrected, nicer figures, neater notation and better read
arxiv created 2007/02/08 · openalex publication_date 2007/04/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.