Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2016 Nov 2:6:36163.
doi: 10.1038/srep36163.

High-speed quantum networking by ship

Affiliations

High-speed quantum networking by ship

Simon J Devitt et al. Sci Rep. .

Abstract

Networked entanglement is an essential component for a plethora of quantum computation and communication protocols. Direct transmission of quantum signals over long distances is prevented by fibre attenuation and the no-cloning theorem, motivating the development of quantum repeaters, designed to purify entanglement, extending its range. Quantum repeaters have been demonstrated over short distances, but error-corrected, global repeater networks with high bandwidth require new technology. Here we show that error corrected quantum memories installed in cargo containers and carried by ship can provide a exible connection between local networks, enabling low-latency, high-fidelity quantum communication across global distances at higher bandwidths than previously proposed. With demonstrations of technology with sufficient fidelity to enable topological error-correction, implementation of the quantum memories is within reach, and bandwidth increases with improvements in fabrication. Our approach to quantum networking avoids technological restrictions of repeater deployment, providing an alternate path to a worldwide Quantum Internet.

PubMed Disclaimer

Figures

Figure 1
Figure 1. Physical transport protocol for a transpacific sneakernet using a single ship.
The transpacific connection shows the location of memory stick units both on shore in the U.S. and Japan and in transit aboard a VLCS-class ship. Each cargo container (memorystick) contains the actual memory units as well as any required control, cooling and power infrastructure. Each memory unit (for the specific hardware model of optically connected NV qubits30) consists of an array of diamond crystals within adjustable single sided cavities which are optically connected to perform individual qubit/qubit interactions.
Figure 2
Figure 2. Properties of the planar code.
The memory unit is a two-dimensional nearest neighbour array of qubits encoded with the topological planar code. (a) Structure of the planar code with the single qubit XL and ZL operators. (Gridlines do not represent entanglement bonds.) (b) Logical error rate as a function of physical error rate for different code distances. Simulations confirm that the fault-tolerant threshold of the planar code lies at p ≈ 0.7% under a standard error model. (c) Memory time as a function of N and Plink for a device that has a t = 3.5 μs physical gate time and p = 0.1%. Along the heavy black contour line, an N-qubit memory unit can maintain sufficiently high coherence to achieve the selected Plink after one year of storage time. (d) Per-error correction cycle logical error rate PL as a function of physical error rate p for different code distances. Numbers in parentheses are total physical qubits per logical qubit at that code distance.

References

    1. Bennett C. H. & Brassard G. quantum cryptography: Public key distribution and coin tossing. Proc. IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India: IEEE 175, 8 (December 10–12 1984).
    1. Ekert A. K. Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 67, 661 (1991). - PubMed
    1. Ben-Or M. & Hassidim A. Fast quantum Byzantine agreement. Proc. thirty-seventh annual ACM symposium on Theory of computing, Baltimore, USA: ACM. pages 481–485 (2005, May 22–24).
    1. Buhrman H. & Rohrig H. Distributed Quantum Computing. Mathematical Foundations of Computer Science pages 1–20 (2003).
    1. Broadbent A., Fitzsimons J. & Kashefi E.. Universal blind quantum computation. Proc. 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS2009), Atlanta, USA: IEEE. pages 517–526 (October 27–29 2009).

Publication types