DeepAI AI Chat
Log In Sign Up

The Adversary Bound Revisited: From Optimal Query Algorithms to Optimal Control

by   Duyal Yolcu, et al.

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-Saks-Szegedy in which query algorithms are defined as sequences of feasible reduced density matrices rather than sequences of unitaries. This form may be faster to understand for a general quantum information audience: It avoids defining the "unidirectional relative γ_2-bound" and relating it to query algorithms explicitly. This proof is also more general because the lower bound (and universal query algorithm) apply to a class of optimal control problems rather than just query problems. That is in addition to the advantages to be discussed in Belovs-Yolcu, namely the more elementary algorithm and correctness proof that avoids phase estimation and spectral analysis, allows for limited treatment of noise, and removes another Θ(log(1/ϵ)) factor from the runtime compared to the previous discrete-time algorithm.


page 1

page 2

page 3

page 4


Morse index and determinant of block Jacobi matrices via optimal control

We describe the relation between block Jacobi matrices and minimization ...

On Query-to-Communication Lifting for Adversary Bounds

We investigate query-to-communication lifting theorems for models relate...

One Weird Trick Tightens the Quantum Adversary Bound, Especially for Success Probability Close to 1/2

The textbook adversary bound for function evaluation states that to eval...

Quantum Lower Bounds by Sample-to-Query Lifting

We propose a quantum sample-to-query lifting theorem. It reveals a quadr...

Robust and Space-Efficient Dual Adversary Quantum Query Algorithms

The general adversary dual is a powerful tool in quantum computing becau...

A Note on Quantum Divide and Conquer for Minimal String Rotation

Lexicographically minimal string rotation is a fundamental problem on st...