[PDF] Quantum Separation of Local Search and Fixed Point Computation
citeseerx.ist.psu.edu › document
In this paper, we give a lower bound of Ω(n(d−1)/2) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d.
Feb 25, 2009 · More significantly, our result provides a quantum separation of local search and fixed point computation over [n]d, for d≥4. Aaronson's local ...
Our result demonstrates a strict separation of fixed point computation and local search in the quantum query model, resolving an open question posed in [1] ...
We give a lower bound of Ω (n (d − 1)/2) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [n]d.
strictly separates these three fundamental search problems: Global optimization is harder than fixed-point computation,. and fixed-point computation is harder ...
We give a lower bound of Ω (n (d − 1)/2) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [n] d .
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 ...
Quantum Separation of Local Search and Fixed Point Computation. 作者：Chen Xi*; Sun Xiaoming; Teng Shang Hua. 来源：Algorithmica, 2010, 56(3): 364-382. DOI ...
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 ...
May 2, 2005 · A fixed point quantum search algorithm has been discovered, referred to as the Phase-\pi/3 search algorithm, which gets around this limitation.
Missing: Separation Local