A Generalization of Deutsch's Example

Simple item page
dc.creatorCostantini, Giovanni
dc.creatorSmeraldi, Fabrizio
dc.date1997-02-07
dc.date.accessioned2026-07-07T06:14:09Z
dc.date.available2026-07-07T06:14:09Z
dc.descriptionQuantum 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.
dc.description17 pages, LaTeX, 5 PostScript figures
dc.identifierhttps://arxiv.org/abs/quant-ph/9702020
dc.identifierhttp://arxiv.org/abs/quant-ph/9702020
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93355
dc.subjectQuantum Physics
dc.titleA Generalization of Deutsch's Example
dc.typetext

Files

Collections

arXiv