Efficient growth of complex graph states via imperfect path erasure

Abstract

Given a suitably large and well connected (complex) graph state, any quantum algorithm can be implemented purely through local measurements on the individual qubits. Measurements can also be used to create the graph state: Path erasure techniques allow one to entangle multiple qubits by determining only global properties of the qubits. Here, this powerful approach is extended by demonstrating that even imperfect path erasure can produce the required graph states with high efficiency. By characterizing the degree of error in each path erasure attempt, one can subsume the resulting imperfect entanglement into an extended graph state formalism. The subsequent growth of the improper graph state can be guided, through a series of strategic decisions, in such a way as to bound the growth of the error and eventually yield a high-fidelity graph state. As an implementation of these techniques, we develop an analytic model for atom (or atom-like) qubits in mismatched cavities, under the double-heralding entanglement procedure of Barrett and Kok [Phys. Rev. A 71, 060310 (2005)]. Compared to straightforward postselection techniques our protocol offers a dramatic improvement in growing complex high-fidelity graph states.

15 pages, 10 figures (which print to better quality than when viewed as an on screen pdf)

References in corpus (23)

• Review article: Linear optical quantum computing
• Quantum Teleportation is a Universal Computational Primitive
• Measurement-based quantum computation with cluster states
• Multi-party entanglement in graph states
• Triggered single photons from a quantum dot
• 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
• Vacuum-Stimulated Raman Scattering based on Adiabatic Passage in a High-Finesse Optical Cavity
• Robust creation of entanglement between ions in spatially separate cavities
• Loss tolerance in one-way quantum computation via counterfactual error correction
• Efficient quantum computation with probabilistic quantum gates
• Loss Tolerant Optical Qubits
• 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
• Optical generation of matter qubit graph states
• Efficient Graph State Construction Under the Barrett and Kok Scheme
• Adaptive strategies for graph state growth in the presence of monitored errors

Cited by in corpus (9)

• Measurement-based quantum computation beyond the one-way model
• Prospects for measurement-based quantum computing with solid state spins
• Fusing multiple W states simultaneously with a Fredkin gate
• Growth of graph states in quantum networks
• Effect of frequency mismatched photons in quantum information processing
• Protocol for generation of high-dimensional entanglement from an array of non-interacting photon emitters
• Strategies for the preparation of large cluster states using non-deterministic gates
• Fast graph operations in quantum computation
• Fluxon-based generation of graph states in Josephson qubits