arXiv Analytics

Sign in

arXiv:quant-ph/9807012AbstractReferencesReviewsResources

Deutsch-Jozsa algorithm as a test of quantum computation

David Collins, K. W. Kim, W. C. Holton

Published 1998-07-03Version 1

A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of the use of entanglement between the qubits in the algorithm and provides criteria for deciding when the Deutsch-Jozsa algorithm constitutes a meaningful test of quantum computation.

Comments: 10 pages, 2 figures, RevTex, Approved for publication in Phys Rev A
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:0904.4209 [quant-ph] (Published 2009-04-27)
The 50% advanced information rule of the quantum algorithms
arXiv:quant-ph/9806010 (Published 1998-06-03)
Quantum computation based on particle statistics
arXiv:quant-ph/0309146 (Published 2003-09-19)
Entanglement Echoes in Quantum Computation