Efficient quantum computation in a network with probabilistic gates and logical encoding
arXiv:1612.06812 · doi:10.1103/PhysRevA.95.042312
Abstract
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from linear optical quantum computation in order to perform high fidelity quantum gates across a quantum network. The error-detecting properties of the heralded operations ensure high fidelity while the encoding makes it possible to correct for failed attempts such that deterministic and high-quality gates can be achieved. Importantly, this is robust to photon loss, which is typically the main obstacle to photonic based quantum information processing. Overall this approach opens a novel path towards quantum networks with atomic nodes and photonic links.
5 pages, 4 figures
References in corpus (11)
- The Quantum Internet
- Quantum Computing
- Modular Entanglement of Atomic Qubits using both Photons and Phonons
- Robust creation of entanglement between ions in spatially separate cavities
- From three-photon GHZ states to ballistic universal quantum computation
- Efficient Distributed Quantum Computing
- Robust and Efficient Quantum Repeaters with Atomic Ensembles and Linear Optics
- Quantum networks with chiral light--matter interaction in waveguides
- Heralded quantum gates with integrated error detection in optical cavities
- Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
- Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links