497 citations · 1.6k across the 74 of their papers we have counts for
3 papers · 2 filters
Efficiently stable presentations from error-correcting codes
Michael Chapman, Thomas Vidick, Henry Yuen
We introduce a notion of \emph{efficient stability} for finite presentations of groups. Informally, a finite presentation using generators and relations is \emph{stable} if…
Computational Entanglement Theory
Rotem Arnon, Zvika Brakerski, Thomas Vidick
We initiate a rigorous study of computational entanglement theory, inspired by the emerging usefulness of ideas from quantum information theory in computational complexity. We defi…
Simple Tests of Quantumness Also Certify Qubits
Zvika Brakerski, Alexandru Gheorghiu, Gregory D. Kahanamoku-Meyer +2
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain templ…