A Generalization of Deutsch's Example

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
17 pages, LaTeX, 5 PostScript figures

Keywords

Quantum Physics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/93355

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/quant-ph/9702020
 http://arxiv.org/abs/quant-ph/9702020

Collections

arXiv