8 citations · 12 across the 3 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
The hidden subgroup problem for infinite groups
Greg Kuperberg
Following the example of Shor's algorithm for period-finding in the integers, we explore the hidden subgroup problem (HSP) for discrete infinite groups. On the hardness side, we sh…
quant-ph2016★ 4 cited
The Computational Complexity of Ball Permutations
Scott Aaronson, Adam Bouland, Greg Kuperberg +1
Inspired by connections to two dimensional quantum theory, we define several models of computation based on permuting distinguishable particles (which we call balls), and character…