220 citations · 632 across the 9 of their papers we have counts for
Showing 2003 · quant-phShow all
3 papers · 2 filters
quant-ph2003★ 1 cited
A Lattice Problem in Quantum NP
Dorit Aharonov, Oded Regev
We consider coGapSVP_\sqrt{n}, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM\cap coNP but is not known to be in NP or in MA. We prove…
quant-ph2003★ 131 cited
A Simple Proof that Toffoli and Hadamard are Quantum Universal
Dorit Aharonov
Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It sho…
quant-ph2003★ 1 cited
Adiabatic Quantum State Generation and Statistical Zero Knowledge
Dorit Aharonov, Amnon Ta-Shma
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum sta…