Long-distance quantum communication over noisy networks without long-time quantum memory

Abstract

The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008)] the authors put forward an important isomorphism between storing quantum information in a dimension $D$ and transmission of quantum information in a $D+1$-dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices.

15 pages, 10 figures; title modified; appendix included in main text; section IV extended; minor mistakes removed

References in corpus (9)

• Fault-tolerant quantum computation with high threshold in two dimensions
• Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
• Surface code quantum communication
• Internal Consistency of Fault-Tolerant Quantum Error Correction in Light of Rigorous Derivations of the Quantum Markovian Limit
• Local Fault-tolerant Quantum Computation
• One-shot entanglement generation over long distances in noisy quantum networks
• Fidelity threshold for long-range entanglement in quantum networks
• Quantum error correction fails for Hamiltonian models
• Comments on "Fault-Tolerant Quantum Computation for Local Non-Markovian Noise"

Cited by in corpus (15)

• Photonic quantum information processing: a review
• All photonic quantum repeaters
• Quantum repeaters: From quantum networks to the quantum internet
• A magic state's fidelity can be superior to the operations that created it
• Fundamental rate-loss tradeoff for the quantum internet
• Tools for quantum network design
• Quantum cryptography: key distribution and beyond
• Aggregating quantum repeaters for the quantum internet
• Practical decoy-state method for twin-field quantum key distribution
• Simple scheme for encoding and decoding a qubit in unknown state for various topological codes
• An optimal dissipative encoder for the toric code
• Fault-tolerant Coding for Quantum Communication
• Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
• Fault-tolerant Coding for Entanglement-Assisted Communication
• Preservation of quantum correlations in femtosecond light pulse train within atomic ensemble