A Generalization of Deutsch's Example
Quantum Physics
2007-05-23 v1
Abstract
Quantum parallelism is the main feature of quantum computation. In 1985 D. Deutsch showed that a single quantum computation may be sufficient to state whether a two-valued function of a two-valued variable is constant or not. Though the generalized problem with unconstrained domain and range size admits no deterministic quantum solution, a fully probabilistic quantum algorithm is presented in which quantum parallelism is harnessed to achieve a quicker exploration of the domain with respect to the classical ``sampling'' strategy.
Cite
@article{arxiv.quant-ph/9702020,
title = {A Generalization of Deutsch's Example},
author = {Giovanni Costantini and Fabrizio Smeraldi},
journal= {arXiv preprint arXiv:quant-ph/9702020},
year = {2007}
}
Comments
17 pages, LaTeX, 5 PostScript figures