6 citations · 12 across the 7 of their papers we have counts for
5 papers · 1 filter
Two-Sided Product Expanding Codes via Rademacher Matrices
Eshan Chattopadhyay, Noam Ringach, Nicholas Spooner
We give a proof of the existence of two-sided product expanding codes which, unlike the earlier result of Kalachev and Panteleev (FOCS, 2025), does not rely on explicit constructio…
Computational Bounds for -Routing
Oren Renard, Nicholas Spooner
The -routing protocol is a leading candidate for quantum position verification (Kent, Munro, and Spiller, 2011), but security guarantees for explicit functions remain limited. W…
Tight Post-Quantum Parallel Repetition for Private-Coin Arguments
Zvika Brakerski, Andrew Huang, Yael Tauman Kalai +1
We show that assuming the existence of homomorphic encryption, parallel repetition of all interactive arguments (after being run under homomorphic encryption) reduces the soundness…
Frustration Free Stoquastic Local Hamiltonian with Sub-Constant Gap is in NP
Eshan Chattopadhyay, Oren Renard, Nicholas Spooner
We continue the study of the Stoquastic Local Hamiltonian problem, a physically motivated restriction of the QMA-complete Local Hamiltonian problem (Kitaev, Shen, and Vyalyi, 2002)…
On Removing Interaction from Quantum Proofs
Nicholas Spooner, Max Tromanhauser
An important open question in quantum cryptography is the construction of publicly-verifiable NIZKs for QMA. Classically, one can construct NIZKs for NP in the random oracle model…