Title | Citations | PageRank | Year |
---|---|---|---|
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems | 1 | 0.35 | 2014 |
Resources required for preparing graph states | 7 | 0.72 | 2006 |
Quantum search on bounded-error inputs | 50 | 2.26 | 2003 |
Simplified proof of the Fourier Sampling Theorem | 1 | 0.72 | 2000 |
Parametric permutation routing via matchings | 1 | 0.35 | 1998 |
Quantum cryptanalysis of hash and claw-free functions | 56 | 4.86 | 1997 |