Sam Gunn

Sam Gunn

Auto-generated profile, based on publicly available information

Sam Gunn

University of California at Berkeley, Berkeley, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 August 2024
Verified
Book Chapter
Closed access
PDF file
MCMiranda Christ
Miranda Christ
SGSam Gunn
Sam Gunn

10 June 2024
Verified
Conference Paper
Open access
ACAndrea Coladangelo
Andrea Coladangelo
SGSam Gunn
Sam Gunn
Quantum copy protection, introduced by Aaronson, enables giving out a quantum program-description that cannot be meaningfully duplicated. Despite over a decade of study, copy protection is only known to be possible for a very limited class of programs. As our first contribution, we show how to achieve "best-possible" copy protection for all programs. We do this by introducing quantum state indistinguishability obfuscation (qsiO), a notion of obfuscation for quantum descriptions of classical programs. We show that applying qsiO to a program immediately achieves best-possible copy protection. Our second contribution is to show that, assuming injective one-way functions exist, qsiO is concrete copy protection for a large family of puncturable programs --- significantly expanding the class of copy-protectable programs. A key tool in our proof is a new variant of unclonable encryption (UE) that we call coupled unclonable encryption (cUE). While constructing UE in the standard model remains an important open problem, we are able to build cUE from one-way functions. If we additionally assume the existence of UE, then we can further expand the class of puncturable programs for which qsiO is copy protection. Finally, we construct qsiO relative to an efficient quantum oracle.

10 June 2024
Verified
Conference Paper
Open access
TBThiago Bergamaschi
Thiago Bergamaschi
LGLouis Golowich
Louis Golowich
SGSam Gunn
Sam Gunn
It is well known that no quantum error correcting code of rate R can correct adversarial errors on more than a (1−R)/4 fraction of symbols. But what if we only require our codes to approximately recover the message? In this work, we construct efficiently-decodable approximate quantum codes against adversarial error rates approaching the quantum Singleton bound of (1−R)/2, for any constant rate R. Specifically, for every R ∈ (0,1) and γ>0, we construct codes of rate R, message length k, and alphabet size 2O(1/γ5), that are efficiently decodable against a (1−R−γ)/2 fraction of adversarial errors and recover the message up to inverse-exponential error 2−Ω(k). At a technical level, we use classical robust secret sharing and quantum purity testing to reduce approximate quantum error correction to a suitable notion of quantum list decoding. We then instantiate our notion of quantum list decoding by (i) introducing folded quantum Reed-Solomon codes, and (ii) applying a new, quantum version of distance amplification.

15 June 2025
Verified
Conference Paper
Open access
OAOmar Alrabiah
Omar Alrabiah
PAPrabhanjan Ananth
Prabhanjan Ananth
MCMiranda Christ
Miranda Christ
YDYevgeniy Dodis
Yevgeniy Dodis
SGSam Gunn
Sam Gunn

15 June 2025
Verified
Conference Paper
Open access
SGSam Gunn
Sam Gunn
YKYael Tauman Kalai
Yael Tauman Kalai
ANAnand Natarajan
Anand Natarajan
ÁVÁgi Villányi
Ági Villányi

17 August 2025
Verified
Book Chapter
Open access
PDF file
SGSam Gunn
Sam Gunn
RMRamis Movassagh
Ramis Movassagh
The meteoric rise in power and popularity of machine learning models dependent on valuable training data has reignited a basic tension between the power of running a program locally and the risk of exposing details of that program to the user. At the same time, fundamental properties of quantum states offer new solutions to data and program security that can require strikingly few quantum resources to exploit, and offer advantages outside of mere computational run time. In this work, we demonstrate such a solution with quantum one-time tokens. A quantum one-time token is a quantum state that permits a certain program to be evaluated exactly once. One-time security guarantees, roughly, that the token cannot be used to evaluate the program more than once. We propose a scheme for building quantum one-time tokens for any randomized classical program, which include generative AI models. We prove that the scheme satisfies an interesting definition of one-time security as long as outputs of the classical algorithm have high enough min-entropy, in a black box model. Importantly, the classical program being protected does not need to be implemented coherently on a quantum computer. In fact, the size and complexity of the quantum one-time token is independent of the program being protected, and additional quantum resources serve only to increase the security of the protocol. Due to this flexibility in adjusting the security, we believe that our proposal is parsimonious enough to serve as a promising candidate for a near-term useful demonstration of quantum computing in either the NISQ or early fault tolerant regime.