Deutsch-Jozsa algorithm as a test of quantum computation
Quantum Physics
2009-10-31 v1
Abstract
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.
Cite
@article{arxiv.quant-ph/9807012,
title = {Deutsch-Jozsa algorithm as a test of quantum computation},
author = {David Collins and K. W. Kim and W. C. Holton},
journal= {arXiv preprint arXiv:quant-ph/9807012},
year = {2009}
}
Comments
10 pages, 2 figures, RevTex, Approved for publication in Phys Rev A