2 citations · 2 across the 3 of their papers we have counts for
4 papers
The Generalized Semi-Clifford Conjecture Holds at Level 4
Maxwell Marcus, Sathyawageeswar Subramanian, Marcel Dall'Agnol
The Clifford hierarchy was introduced by Gottesman and Chuang (arXiv:quant-ph/9908010) to characterize gates that admit fault-tol…
Streaming Zero-Knowledge Proofs
Graham Cormode, Marcel Dall'Agnol, Tom Gur +1
Streaming interactive proofs (SIPs) enable a space-bounded algorithm with one-pass access to a massive stream of data to verify a computation that requires large space, by communic…
Quantum Proofs of Proximity
Marcel Dall'Agnol, Tom Gur, Subhayan Roy Moulik +1
We initiate the systematic study of QMA algorithms in the setting of property testing, to which we refer as QMA proofs of proximity (QMAPs). These are quantum query algorithms that…
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
Marcel Dall'Agnol, Tom Gur, Oded Lachish
We prove a general structural theorem for a wide family of local algorithms, which includes property testers, local decoders, and PCPs of proximity. Namely, we show that the struct…