Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Yolcu, Duyal"'
Publikováno v:
Quantum 8, 1444 (2024)
Quantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors through error reduction (exactness). Second, through careful accounting (thr
Externí odkaz:
http://arxiv.org/abs/2311.15873
Autor:
Yolcu, Duyal
The textbook adversary bound for function evaluation states that to evaluate a function $f\colon D\to C$ with success probability $\frac{1}{2}+\delta$ in the quantum query model, one needs at least $\left( 2\delta -\sqrt{1-4\delta^2} \right) Adv(f)$
Externí odkaz:
http://arxiv.org/abs/2303.10244
Autor:
Belovs, Aleksandrs, Yolcu, Duyal
We propose a new definition of quantum Las Vegas query complexity. We show that it is exactly equal to the quantum adversary bound. This is achieved by a new and very simple way of transforming a feasible solution to the adversary optimisation proble
Externí odkaz:
http://arxiv.org/abs/2301.02003
Autor:
Yolcu, Duyal
This article develops a convex description of a classical or quantum learner's or agent's state of knowledge about its environment, presented as a convex subset of a commutative R-algebra. With caveats, this leads to a generalization of certain semid
Externí odkaz:
http://arxiv.org/abs/2212.04606
Autor:
Yolcu, Duyal
This note complements the paper "One-Way Ticket to Las Vegas and the Quantum Adversary" (arxiv:2301.02003). I develop the ideas behind the adversary bound - universal algorithm duality therein in a different form, using the same perspective as Barnum
Externí odkaz:
http://arxiv.org/abs/2211.16293
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.