6 papers · 1 filter
On the Cryptographic Structure Required for Verifying Qubits
James Bartusek, Itay Shalit
Classically testing for the presence of anti-commuting operators on a quantum device is a critical tool underpinning recent progress in classical verification of quantum computatio…
A Modular Approach to Succinct Arguments for QMA
James Bartusek, Jiahui Liu, Giulio Malavolta
Succinct argument systems are of central importance to modern crytpography, enabling the efficient verification of computational claims. In the classical setting, Kilian (STOC 92)…
How To Track Qubits Through Space and Time (Or: Sailing in a Quantum Boat)
James Bartusek, Zikuan Huang, Leo Orshansky +1
While quantum position verification aims to certify a prover's location using quantum information, existing security definitions only guarantee that part of the successful adversar…
Classical Obfuscation of Quantum Circuits via Publicly-Verifiable QFHE
James Bartusek, Aparna Gupte, Saachi Mutreja +1
A classical obfuscator for quantum circuits is a classical program that, given the classical description of a quantum circuit , outputs the classical description of a functional…
A New Approach to Arguments of Quantum Knowledge
James Bartusek, Ruta Jawale, Justin Raizes +1
We construct a publicly-verifiable non-interactive zero-knowledge argument system for QMA with the following properties. 1. Transparent setup. Our protocol only requires a uniforml…
On the Power of Oblivious State Preparation
James Bartusek, Dakshita Khurana
We put forth Oblivious State Preparation (OSP) as a cryptographic primitive that unifies techniques developed in the context of a quantum server interacting with a classical client…