Efficient Graph State Construction Under the Barrett and Kok Scheme
arXiv:quant-ph/0504111 · doi:10.1103/PhysRevA.72.056302
Abstract
Recently Barrett and Kok (BK) proposed an elegant method for entangling separated matter qubits. They outlined a strategy for using their entangling operation (EO) to build graph states, the resource for one-way quantum computing. However by viewing their EO as a graph fusion event, one perceives that each successful event introduces an ideal redundant graph edge, which growth strategies should exploit. For example, if each EO succeeds with probability p=0.4 then a highly connected graph can be formed with an overhead of only about ten EO attempts per graph edge. The BK scheme then becomes competitive with the more elaborate entanglement procedures designed to permit p to approach unity.
3 pages, 3 figures. Small refinements
References in corpus (4)
Cited by in corpus (24)
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Brokered Graph State Quantum Computing
- Resource costs for fault-tolerant linear optical quantum computing
- Prospects for measurement-based quantum computing with solid state spins
- Fusing multiple W states simultaneously with a Fredkin gate
- The efficiencies of generating cluster states with weak non-linearities
- Potential and limits to cluster state quantum computing using probabilistic gates
- Fully fault tolerant quantum computation with non-deterministic gates
- Entangling spins by measuring charge: a parity-gate toolbox
- Distributed quantum information processing with minimal local resources
- Probabilistic growth of large entangled states with low error accumulation
- Minimal resources for linear optical one-way computing
- Long range failure-tolerant entanglement distribution
- Strategies for the preparation of large cluster states using non-deterministic gates
- Fast graph operations in quantum computation
- An introduction to one-way quantum computing in distributed architectures
- Efficient growth of complex graph states via imperfect path erasure
- Coherent quantum effects through dispersive bosonic media
- Modelling of quantum information processing with Ehrenfest guided tra jectories: a case study
- Distributed quantum computation with arbitrarily poor photon detection
- Constructing 2D and 3D cluster states with photonic modules
- How to exploit local information when distilling entanglement
- Perfect Cluster States from Imperfect Global Entanglement
- Quantum Information Processing with Continuous Variables and Atomic Ensembles