5 citations · 9 across the 5 of their papers we have counts for
5 papers · 1 filter
Taming Quantum Time Complexity
Aleksandrs Belovs, Stacey Jeffery, Duyal Yolcu
Quantum query complexity has several nice properties with respect to composition. First, bounded-error quantum query algorithms can be composed without incurring log factors throug…
One Weird Trick Tightens the Quantum Adversary Bound, Especially for Success Probability Close to
Duyal Yolcu
The textbook adversary bound for function evaluation states that to evaluate a function with success probability in the quantum query model, one ne…
One-Way Ticket to Las Vegas and the Quantum Adversary
Aleksandrs Belovs, Duyal Yolcu
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…
The R-algebra of Quasiknowledge and Convex Optimization
Duyal Yolcu
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-…
The Adversary Bound Revisited: From Optimal Query Algorithms to Optimal Control
Duyal Yolcu
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 dua…