The Deutsch-Jozsa Algorithm Can Be Used for Quantum Key Distribution

HTML  XML Download Download as PDF (Size: 264KB)  PP. 1-6  
DOI: 10.4236/oalib.1101798    1,528 Downloads   2,949 Views  Citations

ABSTRACT

We review the new type of Deutsch-Jozsa algorithm proposed in [K. Nagata and T. Nakamura, Int. J. Theor. Phys. 49, 162 (2010)]. We suggest that the Deutsch-Jozsa algorithm can be used for quantum key distribution. Alice sends input N 1 partite uncorrelated state to a black box. Bob measures output state. Now, Alice and Bob have promised to use a function f which is one of two kinds: either the value of f is constant or balanced. To Eve, it is secret. Alice’s and Bob’s goal is to determine with certainty whether they have chosen a constant or a balanced function. Alice and Bob get one bit if they determine the function f. The speed to get one bit improves by a factor of 2N. This may improve the speed to establish quantum key distribution by a factor of 2N.

Share and Cite:

Nagata, K. and Nakamura, T. (2015) The Deutsch-Jozsa Algorithm Can Be Used for Quantum Key Distribution. Open Access Library Journal, 2, 1-6. doi: 10.4236/oalib.1101798.
Journals Menu
Follow SCIRP
Contact us
+1 323-425-8868
customer@scirp.org
WhatsApp +86 18163351462(WhatsApp)
Click here to send a message to me 1655362766
Paper Publishing WeChat

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.