Skip to main content
Cornell University
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arxiv logo > quant-ph > arXiv:quant-ph/9906073

Help | Advanced Search

arXiv logo
Cornell University Logo

quick links

  • Login
  • Help Pages
  • About

Quantum Physics

arXiv:quant-ph/9906073 (quant-ph)
[Submitted on 21 Jun 1999]

Title:Quantum memory in quantum cryptography

Authors:Tal Mor
View a PDF of the paper titled Quantum memory in quantum cryptography, by Tal Mor
View PDF
Abstract: [Shortened abstract:] This thesis investigates the importance of quantum memory in quantum cryptography, concentrating on quantum key distribution schemes.
In the hands of an eavesdropper -- a quantum memory is a powerful tool, putting in question the security of quantum cryptography; Classical privacy amplification techniques, used to prove security against less powerful eavesdroppers, might not be effective when the eavesdropper can keep quantum states for a long time. In this work we suggest a possible direction for approaching this problem. We define strong attacks of this type, and show security against them, suggesting that quantum cryptography is secure. We start with a complete analysis regarding the information about a parity bit (since parity bits are used for privacy amplification). We use the results regarding the information on parity bits to prove security against very strong eavesdropping attacks, which uses quantum memories and all classical data (including error correction codes) to attack the final key directly.
In the hands of the legitimate users, a quantum memory is also a useful tool. We suggest a new type of quantum key distribution scheme where quantum memories are used instead of quantum channels. This scheme is especially adequate for networks of many users. The use of quantum memory also allows reducing the error rate to improve large scale quantum cryptography, and to enable the legitimate users to work with reasonable error rate.
Comments: this http URL. (Ph.D) Thesis; April 1997; Technion, Haifa, Israel. 107 pages, Latex. The results of chapters 2-4 (security of QKD), and chapter 5 (QKD via quantum memory) appeared elsewhere in the quant-physics archive, and were published in journals (see ref. 15, 19, 20 and 21; ref 21 is now PRL, 79, p.4034, 1997). Chapter 6 contains the idea of quantum privacy amplification based on quantum error correction, and the surprising idea that ``quantum repeaters'' can be used for QKD. This chapter is a much improved version of quant-ph/9608025 and these results were not published
Subjects: Quantum Physics (quant-ph)
Cite as: arXiv:quant-ph/9906073
  (or arXiv:quant-ph/9906073v1 for this version)
  https://doi.org/10.48550/arXiv.quant-ph/9906073
arXiv-issued DOI via DataCite

Submission history

From: Tal Mor [view email]
[v1] Mon, 21 Jun 1999 07:18:12 UTC (95 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Quantum memory in quantum cryptography, by Tal Mor
  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 1999-06

References & Citations

  • INSPIRE HEP
  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack