vix.ing · top · new · best · stats · spec

A Generalization of Deutsch's Example

1997/02/07 by Giovanni Costantini, Costantini, Giovanni, Fabrizio Smeraldi +1
Physics and Astronomy · #FOS: Physical sciences #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/9702020

17 pages, LaTeX, 5 PostScript figures

arxiv created 1997/02/07 · arxiv updated 2009/12/01

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.

Related