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

Abstract

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.

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

References in corpus (18)

• Review article: Linear optical quantum computing
• Measurement-based quantum computation with cluster states
• Multi-party entanglement in graph states
• Resource-efficient linear optical quantum computation
• Efficient high-fidelity quantum computation using matter qubits and linear optics
• Optical quantum computation using cluster states
• Creation of entangled states of distant atoms by interference
• Proposal for teleportation of an atomic state via cavity decay
• Repeat-Until-Success Quantum Computing
• Robust creation of entanglement between ions in spatially separate cavities
• Efficient quantum computation with probabilistic quantum gates
• Repeat-Until-Success quantum computing using stationary and flying qubits
• Deterministic linear optics quantum computation utilizing linked photon circuits
• Brokered Graph State Quantum Computing
• Entanglement in spin chains and lattices with long-range Ising-type interactions
• Ground state approximation for strongly interacting systems in arbitrary dimension
• Potential and limits to cluster state quantum computing using probabilistic gates
• Optical generation of matter qubit graph states

Cited by in corpus (15)

• Novel schemes for measurement-based quantum computation
• Modular architectures for quantum networks
• Prospects for measurement-based quantum computing with solid state spins
• Fusing multiple W states simultaneously with a Fredkin gate
• Effects of self-phase modulation on weak nonlinear optical quantum gates
• Analysis of Multipartite Entanglement Distribution using a Central Quantum-Network Node
• Growth of graph states in quantum networks
• Effect of frequency mismatched photons in quantum information processing
• Fast graph operations in quantum computation
• Layer by layer generation of cluster states
• Atomic cluster state build up with macroscopic heralding
• Efficient growth of complex graph states via imperfect path erasure
• Lecture notes on Optical Quantum Computing
• Quantum Random State Generation with Predefined Entanglement Constraint
• Experimental nonlocality-based network diagnostics of mutipartite entangled states