File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Unconditional security of quantum key distribution over arbitrarily long distances

TitleUnconditional security of quantum key distribution over arbitrarily long distances
Authors
Issue Date1999
PublisherAmerican Association for the Advancement of Science. The Journal's web site is located at http://sciencemag.org
Citation
Science, 1999, v. 283 n. 5410, p. 2050-2056 How to Cite?
AbstractQuantum key distribution is widely thought to offer unconditional security in communication between two users. Unfortunately, a widely accepted proof of its security in the presence of source, device, and channel noises has been missing. This long-standing problem is solved here by showing that, given fault-tolerant quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The proof is reduced from a noisy quantum scheme to a noiseless quantum scheme and then from a noiseless quantum scheme to a noiseless classical scheme, which can then be tackled by classical probability theory.
Persistent Identifierhttp://hdl.handle.net/10722/80966
ISSN
2023 Impact Factor: 44.7
2023 SCImago Journal Rankings: 11.902
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLo, HKen_HK
dc.contributor.authorChau, HFen_HK
dc.date.accessioned2010-09-06T08:12:15Z-
dc.date.available2010-09-06T08:12:15Z-
dc.date.issued1999en_HK
dc.identifier.citationScience, 1999, v. 283 n. 5410, p. 2050-2056en_HK
dc.identifier.issn0036-8075en_HK
dc.identifier.urihttp://hdl.handle.net/10722/80966-
dc.description.abstractQuantum key distribution is widely thought to offer unconditional security in communication between two users. Unfortunately, a widely accepted proof of its security in the presence of source, device, and channel noises has been missing. This long-standing problem is solved here by showing that, given fault-tolerant quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The proof is reduced from a noisy quantum scheme to a noiseless quantum scheme and then from a noiseless quantum scheme to a noiseless classical scheme, which can then be tackled by classical probability theory.en_HK
dc.languageengen_HK
dc.publisherAmerican Association for the Advancement of Science. The Journal's web site is located at http://sciencemag.orgen_HK
dc.relation.ispartofScienceen_HK
dc.titleUnconditional security of quantum key distribution over arbitrarily long distancesen_HK
dc.typeArticleen_HK
dc.identifier.emailChau, HF: hfchau@hku.hken_HK
dc.identifier.authorityChau, HF=rp00669en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1126/science.283.5410.2050en_HK
dc.identifier.scopuseid_2-s2.0-0033605546en_HK
dc.identifier.hkuros39839en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0033605546&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume283en_HK
dc.identifier.issue5410en_HK
dc.identifier.spage2050en_HK
dc.identifier.epage2056en_HK
dc.identifier.isiWOS:000079369800036-
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridLo, HK=7202085450en_HK
dc.identifier.scopusauthoridChau, HF=7005742276en_HK
dc.identifier.citeulike10023953-
dc.identifier.issnl0036-8075-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats