3 papers
quant-ph2023
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…
quant-ph2023
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…
quant-ph2022
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-…