Normal subgroup reconstruction and quantum computation using group representations

DOI10.1145/335305.335392zbMath1296.68056OpenAlexW2055201875WikidataQ62398497 ScholiaQ62398497MaRDI QIDQ3192035

Alexander Russell, Sean Hallgren, Amnon Ta-Shma

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335392

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (9)

The quantum query complexity of the hidden subgroup problem is polynomial ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ Polynomial total positivity and high relative accuracy through Schur polynomials ⋮ Schur polynomials do not have small formulas if the determinant does not ⋮ The independence of reduced subgroup-state ⋮ Is Grover's algorithm a quantum hidden subgroup algorithm? ⋮ Convergence rates of random walk on irreducible representations of finite groups ⋮ Unnamed Item ⋮ Discrete quantum walks hit exponentially faster

This page was built for publication: Normal subgroup reconstruction and quantum computation using group representations