IDEAS home Printed from https://ideas.repec.org/a/nat/natcom/v10y2019i1d10.1038_s41467-019-11008-z.html
   My bibliography  Save this article

Repeaterless quantum key distribution with efficient finite-key analysis overcoming the rate-distance limit

Author

Listed:
  • Kento Maeda

    (The University of Tokyo
    The University of Tokyo)

  • Toshihiko Sasaki

    (The University of Tokyo)

  • Masato Koashi

    (The University of Tokyo
    The University of Tokyo)

Abstract

Quantum key distribution (QKD) over a point-to-point link enables us to benefit from a genuine quantum effect even with conventional optics tools such as lasers and photon detectors, but its capacity is limited to a linear scaling of the repeaterless bound. Recently, twin-field (TF) QKD was conjectured to beat the limit by using an untrusted central station conducting a single-photon interference detection. So far, the effort to prove the conjecture was confined to the infinite key limit which neglected the time and cost for monitoring an adversary’s act. Here we propose a variant of TF-type QKD protocol equipped with a simple methodology of monitoring to reduce its cost and provide an information-theoretic security proof applicable to finite communication time. We simulate the key rate to show that the protocol beats the linear bound in a reasonable running time of sending 1012 pulses, which positively solves the conjecture.

Suggested Citation

  • Kento Maeda & Toshihiko Sasaki & Masato Koashi, 2019. "Repeaterless quantum key distribution with efficient finite-key analysis overcoming the rate-distance limit," Nature Communications, Nature, vol. 10(1), pages 1-8, December.
    • Handle: RePEc:nat:natcom:v:10:y:2019:i:1:d:10.1038_s41467-019-11008-z
    DOI: 10.1038/s41467-019-11008-z
    as

    Download full text from publisher

    File URL: https://www.nature.com/articles/s41467-019-11008-z
    File Function: Abstract
    Download Restriction: no
    File URL: https://libkey.io/10.1038/s41467-019-11008-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:nat:natcom:v:10:y:2019:i:1:d:10.1038_s41467-019-11008-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.nature.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.