11 citations · 31 across the 5 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 6 cited
Breaking the n^(log n) Barrier for Solvable-Group Isomorphism
David Rosenbaum
We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for gro…
quant-ph2012★ 10 cited
Optimal Quantum Circuits for Nearest-Neighbor Architectures
David Rosenbaum
We show that the depth of quantum circuits in the realistic architecture where a classical controller determines which local interactions to apply on the kD grid Z^k where k >= 2 i…