Distributed quantum computation with arbitrarily poor photon detection
arXiv:1003.2258 · doi:10.1103/PhysRevA.82.010302
Abstract
In a distributed quantum computer scalability is accomplished by networking together many elementary nodes. Typically the network is optical and inter-node entanglement involves photon detection. In complex networks the entanglement fidelity may be degraded by the twin problems of photon loss and dark counts. Here we describe an entanglement protocol which can achieve high fidelity even when these issues are arbitrarily severe; indeed the method succeeds with finite probability even if the detectors are entirely removed from the network. An experimental demonstration should be possible with existing technologies.
5 pages, 4 figs
References in corpus (11)
- Topological fault-tolerance in cluster state quantum computation
- Mapping photonic entanglement into and out of a quantum memory
- Strong interaction between light and a single trapped atom without a cavity
- Excited-state spectroscopy of single NV defects in diamond using optically detected magnetic resonance
- Brokered Graph State Quantum Computing
- Design of a mode converter for efficient light-atom coupling in free space
- Prospects for measurement-based quantum computing with solid state spins
- Measurement based entanglement under conditions of extreme photon loss
- Interfacing light and single atoms with a lens
- Probabilistic growth of large entangled states with low error accumulation
- Strategies for the preparation of large cluster states using non-deterministic gates