𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of Searching for a Maximum of a Function on a Quantum Computer

✍ Scribed by Maciej Goćwin

Book ID
106507757
Publisher
Springer US
Year
2006
Tongue
English
Weight
123 KB
Volume
5
Category
Article
ISSN
1570-0755

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the query complexity of finding a loc
On the query complexity of finding a local maximum point
✍ A.L. Rastsvetaev; L.D. Beklemishev 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 94 KB

We calculate the minimal number of queries sufficient to find a local maximum point of a function on a discrete interval, for a model with M parallel queries, M 1. Matching upper and lower bounds are obtained. The bounds are formulated in terms of certain Fibonacci type sequences of numbers.

On the complexity of finding a local max
On the complexity of finding a local maximum of functions on discrete planar subsets
✍ Anton Mityagin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 237 KB

We study how many values of an unknown integer-valued function f one needs to know in order to ÿnd a local maximum of f. We consider functions deÿned on ÿnite subsets of discrete plane. We prove upper bounds for functions deÿned on rectangles and present lower bounds for functions deÿned on arbitrar