Paper 2018/249
Analysis of Deutsch-Jozsa Quantum Algorithm
Zhengjun Cao and Lihua Liu
Abstract
The Deutsch-Jozsa quantum algorithm is of great importance to modern quantum computation, but we find it is flawed. It confuses two unitary transformations: one is performed on a pure state, and the other on a superposition. In the past decades, no constructive specification on the unitary operator performed on involved superposition has been found, and no experimental test on the algorithm has been practically carried out. We think it needs more constructive specifications on the algorithm so as to confirm its correctness.
Note: We revised and formatted the submission.
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- quantum computationShor's factoring algorithm
- Contact author(s)
- liulh @ shmtu edu cn
- History
- 2022-01-21: revised
- 2018-03-07: received
- See all versions
- Short URL
- https://ia.cr/2018/249
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2018/249, author = {Zhengjun Cao and Lihua Liu}, title = {Analysis of Deutsch-Jozsa Quantum Algorithm}, howpublished = {Cryptology {ePrint} Archive, Paper 2018/249}, year = {2018}, url = {https://eprint.iacr.org/2018/249} }