114 citations · 339 across the 13 of their papers we have counts for
7 papers · 1 filter
On the impossibility of a quantum sieve algorithm for graph isomorphism: unconditional results
Cristopher Moore, Alexander Russell, Piotr Sniady
It is known that any quantum algorithm for Graph Isomorphism that works within the framework of the hidden subgroup problem (HSP) must perform highly entangled measurements across…
Upper bound on the characters of the symmetric groups for balanced Young diagrams and a generalized Frobenius formula
Amarpreet Rattan, Piotr Sniady
We study asymptotics of an irreducible representation of the symmetric group S_n corresponding to a balanced Young diagram λ(a Young diagram with at most C\sqrt{n} rows and columns…
Representations of Lie groups and random matrices
Benoit Collins, Piotr Sniady
We study the asymptotics of representations of a fixed compact Lie group. We prove that the limit behavior of a sequence of such representations can be described in terms of certai…
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
Cristopher Moore, Alexander Russell
It is known that any quantum algorithm for Graph Isomorphism that works within the framework of the hidden subgroup problem (HSP) must perform highly entangled measurements across…
Second Order Freeness and Fluctuations of Random Matrices, III. Higher order freeness and free cumulants
Benoit Collins, James A. Mingo, Piotr Sniady +1
We extend the relation between random matrices and free probability theory from the level of expectations to the level of all correlation functions (which are classical cumulants o…
Permutations without long decreasing subsequences and random matrices
Piotr Sniady
We study the shape of the Young diagram λassociated via the Robinson-Schensted-Knuth algorithm to a random permutation in S_n such that the length of the longest decreasing subsequ…