Quantum algorithms for finding extrema with unary predicates
We study the problem of finding the maximum or the minimum of a given set S = {x₀, X₁, ... X n₋₁}, each element X i drawn from some finite universe [Unary] of real numbers. We assume that the inputs are abstracted within an oracle O where we can only gain information through unary comparisons in the...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2011
|
| Online Access: | http://hdl.handle.net/2429/31586 |