scientific article

zbMath1297.68077MaRDI QIDQ2921784

Aner Shalev, Julia Kempe

Publication date: 13 October 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Symmetric groups (20B30) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items

Sample complexity of hidden subgroup problem ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ On the Complexity of the Hidden Subgroup Problem ⋮ Computational indistinguishability between quantum states and its cryptographic application ⋮ Convergence rates of random walk on irreducible representations of finite groups ⋮ Graph matching using the interference of continuous-time quantum walks ⋮ Query complexity of generalized Simon's problem ⋮ The hidden subgroup problem and MKTP ⋮ Deterministic algorithms for the hidden subgroup problem