26
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Fundamental limits of repeaterless quantum communications

      research-article

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Quantum communications promises reliable transmission of quantum information, efficient distribution of entanglement and generation of completely secure keys. For all these tasks, we need to determine the optimal point-to-point rates that are achievable by two remote parties at the ends of a quantum channel, without restrictions on their local operations and classical communication, which can be unlimited and two-way. These two-way assisted capacities represent the ultimate rates that are reachable without quantum repeaters. Here, by constructing an upper bound based on the relative entropy of entanglement and devising a dimension-independent technique dubbed ‘teleportation stretching', we establish these capacities for many fundamental channels, namely bosonic lossy channels, quantum-limited amplifiers, dephasing and erasure channels in arbitrary dimension. In particular, we exactly determine the fundamental rate-loss tradeoff affecting any protocol of quantum key distribution. Our findings set the limits of point-to-point quantum communications and provide precise and general benchmarks for quantum repeaters.

          Abstract

          Quantum communications will be used to transmit entanglement and secure keys, but it is important to estimate their optimal transfer rates. Here the authors compute the fundamental limit of repeaterless quantum communications for the most relevant practical scenario.

          Related collections

          Most cited references107

          • Record: found
          • Abstract: not found
          • Article: not found

          Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels

            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            Mixed State Entanglement and Quantum Error Correction

            Entanglement purification protocols (EPP) and quantum error-correcting codes (QECC) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbi- trary quantum state \(|\xi\rangle\) can be transmitted at some rate Q through a noisy channel \(\chi\) without degradation. We prove that an EPP involving one- way classical communication and acting on mixed state \(\hat{M}(\chi)\) (obtained by sharing halves of EPR pairs through a channel \(\chi\)) yields a QECC on \(\chi\) with rate \(Q=D\), and vice versa. We compare the amount of entanglement E(M) required to prepare a mixed state M by local actions with the amounts \(D_1(M)\) and \(D_2(M)\) that can be locally distilled from it by EPPs using one- and two-way classical communication respectively, and give an exact expression for \(E(M)\) when \(M\) is Bell-diagonal. While EPPs require classical communica- tion, QECCs do not, and we prove Q is not increased by adding one-way classical communication. However, both D and Q can be increased by adding two-way com- munication. We show that certain noisy quantum channels, for example a 50% depolarizing channel, can be used for reliable transmission of quantum states if two-way communication is available, but cannot be used if only one-way com- munication is available. We exhibit a family of codes based on universal hash- ing able toachieve an asymptotic \(Q\) (or \(D\)) of 1-S for simple noise models, where S is the error entropy. We also obtain a specific, simple 5-bit single- error-correcting quantum block code. We prove that {\em iff} a QECC results in high fidelity for the case of no error the QECC can be recast into a form where the encoder is the matrix inverse of the decoder.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              The Quantum Internet

              H. Kimble (2008)
              Quantum networks offer a unifying set of opportunities and challenges across exciting intellectual and technical frontiers, including for quantum computation, communication, and metrology. The realization of quantum networks composed of many nodes and channels requires new scientific capabilities for the generation and characterization of quantum coherence and entanglement. Fundamental to this endeavor are quantum interconnects that convert quantum states from one physical system to those of another in a reversible fashion. Such quantum connectivity for networks can be achieved by optical interactions of single photons and atoms, thereby enabling entanglement distribution and quantum teleportation between nodes.
                Bookmark

                Author and article information

                Journal
                Nat Commun
                Nat Commun
                Nature Communications
                Nature Publishing Group
                2041-1723
                26 April 2017
                2017
                : 8
                : 15043
                Affiliations
                [1 ]Department of Computer Science and York Centre for Quantum Technologies, University of York , York YO10 5GH, UK
                [2 ]Department of Physics and Astronomy, University College London , Gower Street, London WC1E 6BT, UK
                Author notes
                Author information
                http://orcid.org/0000-0001-6165-5615
                Article
                ncomms15043
                10.1038/ncomms15043
                5414096
                28443624
                f0614467-0e76-4d44-92ac-6674ba65ee6b
                Copyright © 2017, The Author(s)

                This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

                History
                : 15 March 2016
                : 23 February 2017
                Categories
                Article

                Uncategorized
                Uncategorized

                Comments

                Comment on this article