4 citations · 6 across the 2 of their papers we have counts for
2 papers
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…
cond-mat.stat-mech2012★ 2 cited
A self-organized graph evolution model with preferential network random walk
S. Mehraban, M. R. Ejtehadi
We introduce a self-organized model of graph evolution associated with preferential network random walkers. The idea is developed by using two different types of walkers, the inter…