140 citations · 464 across the 29 of their papers we have counts for
29 papers
Debate is efficient with your time
Jonah Brown-Cohen, Geoffrey Irving, Simon C. Marshall +3
AI safety via debate uses two competing models to help a human judge verify complex computational tasks. Previous work has established what problems debate can solve in principle,…
On the Brittleness of LLMs: A Journey around Set Membership
Lea Hergert, Gábor Berend, Mario Szegedy +2
Large language models (LLMs) achieve superhuman performance on complex reasoning tasks, yet often fail on much simpler problems, raising concerns about their reliability and interp…
Quantum advantage for combinatorial optimization problems, Simplified
Mario Szegedy
We observe that fault-tolerant quantum computers have an optimal advantage over classical computers in approximating solutions to many NP optimization problems. This observation ho…
Generating EPR-pairs from an -party resource state
Sergey Bravyi, Yash Sharma, Mario Szegedy +1
Motivated by quantum network applications over classical channels, we initiate the study of -party resource states from which LOCC protocols can create EPR-pairs between any …
Quantum Locally Testable Code with Constant Soundness
Andrew Cross, Zhiyang He, Anand Natarajan +2
In this paper, we present two constructions of quantum locally testable codes (QLTC) with constant soundness. In the first approach, we introduce an operation called check product,…
Repeated Averages on Graphs
Ramis Movassagh, Mario Szegedy, Guanyang Wang
Sourav Chatterjee, Persi Diaconis, Allan Sly and Lingfu Zhang, prompted by a question of Ramis Movassagh, renewed the study of a process proposed in the early 1980s by Jean Bourgai…