corner
corner

Phys. Rev. A 68, 052301 (2003) [4 pages]

Scaling issues in ensemble implementations of the Deutsch-Jozsa algorithm

Download: PDF (49 kB) Buy this article Export: BibTeX or EndNote (RIS)

Arvind* and David Collins
Department of Physics, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213, USA

Received 24 July 2003; published 3 November 2003

We discuss the ensemble version of the Deutsch-Jozsa (DJ) algorithm which attempts to provide a “scalable” implementation on an expectation-value NMR quantum computer. We show that this ensemble implementation of the DJ algorithm is at best as efficient as the classical random algorithm. As soon as any attempt is made to classify all possible functions with certainty, the implementation requires an exponentially large number of molecules. The discrepancies arise out of the interpretation of mixed state density matrices.

© 2003 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevA.68.052301
DOI:
10.1103/PhysRevA.68.052301
PACS:
03.67.Lx

*Permanent address: Department of Physics, Guru Nanak Dev University, Amritsar 143005, India; Electronic address: xarvind@andrew.cmu.edu

Present address: Department of Physics, Bucknell University, Lewisburg, PA 17837, USA. Electronic address: dcollins@bucknell.edu