Authors: Koji Nagata, Tadao Nakamura
We review the new type of Deutsch-Jozsa algorithm proposed in {[K. Nagata and T. Nakamura, Int. J. Theor. Phys. {\bf 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 has promised to use a function $f$ which is of 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 $2^{N}$. This may improve the speed to establish quantum key distribution by a factor of $2^{N}$.
Comments: 4 Pages. Open Access Library Journal, Volume 2, e1798.
Download: PDF
[v1] 2015-03-03 05:41:04
[v2] 2015-08-14 00:11:03
Unique-IP document downloads: 191 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.