TL;DR
This paper explores query-to-communication lifting theorems related to quantum and classical adversary bounds, establishing new lower bounds and connections between different complexity measures, with implications for quantum communication and query complexity.
Contribution
It introduces strong lifting theorems for classical and quantum adversary bounds, connecting them to secure quantum computation and establishing quadratic relations in query complexity.
Findings
Classical adversary bound lifts to randomized communication lower bounds with a constant-sized gadget.
Quantum adversary bounds relate to secure 2-party quantum computation impossibility.
Positive-weight quantum adversary is quadratically related to classical adversary and approximate degree.
Abstract
We investigate query-to-communication lifting theorems for models related to the quantum adversary bounds. Our results are as follows: 1. We show that the classical adversary bound lifts to a lower bound on randomized communication complexity with a constant-sized gadget. We also show that the classical adversary bound is a strictly stronger lower bound technique than the previously-lifted measure known as critical block sensitivity, making our lifting theorem one of the strongest lifting theorems for randomized communication complexity using a constant-sized gadget. 2. Turning to quantum models, we show a connection between lifting theorems for quantum adversary bounds and secure 2-party quantum computation in a certain "honest-but-curious" model. Under the assumption that such secure 2-party computation is impossible, we show that a simplified version of the positive-weight…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
On Query-to-Communication Lifting for Adversary Bounds· youtube
