1 citations · 1 across the 9 of their papers we have counts for
5 papers · 1 filter
Verifiable Quantum Advantage and Computation via Quantum Circuit Obfuscation
Alexandru Gheorghiu, Aparna Gupte, Vojtěch Havlíček +1
We construct protocols for classically verifiable quantum advantage and classical verification of computations using \emph{quantum indistinguishability obfuscation}…
A Fourier-Label Information-Loss Barrier for Dihedral Coset Algorithms
Aparna Gupte, Seyoon Ragavan, Mark Zhandry
We establish a no-go theorem for a broad class of quantum algorithms for the dihedral coset problem (DCP). We consider the Fourier-sampling and subset-sum-measurement template prop…
Marton's conjecture in polynomial time
Srinivasan Arunachalam, Arkopal Dutt, Sabee Grewal +1
Gowers, Green, Manners, and Tao (Annals '25) recently resolved Marton's polynomial Freiman-Ruzsa conjecture. We give an algorithmic counterpart to their result: given uniform sampl…
Exponentially Fewer-Server PIR from Sparser -Decoding Polynomials
Aparna Gupte, Seyoon Ragavan
We show that under a plausible number-theoretic conjecture, for any constant there exists an -server private information retrieval (PIR) protocol that on an -bit database…
On Best-Possible One-Time Programs
Aparna Gupte, Jiahui Liu, Luowen Qian +3
One-time programs (OTPs) aim to let a user evaluate a program on a single input while revealing nothing else. Classical OTPs require hardware. Quantum measurement suggests a physic…