367 citations · 1.6k across the 63 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
math.QA2009
Denseness and Zariski denseness of Jones braid representations
Greg Kuperberg
Using various tools from representation theory and group theory, but without using hard classification theorems such as the classification of finite simple groups, we show that the…
quant-ph2009★ 69 cited
How hard is it to approximate the Jones polynomial?
Greg Kuperberg
Freedman, Kitaev, and Wang [arXiv:quant-ph/0001071], and later Aharonov, Jones, and Landau [arXiv:quant-ph/0511096], established a quantum algorithm to "additively" approximate the…
quant-ph2009
On the power of a unique quantum witness
Rahul Jain, Iordanis Kerenidis, Greg Kuperberg +3
In a celebrated paper, Valiant and Vazirani raised the question of whether the difficulty of NP-complete problems was due to the wide variation of the number of witnesses of their…