Normal subgroup reconstruction and quantum computation using group representations

DOI10.1145/335305.335392MaRDI QIDQ3192035zbMATH OpenOpenAlexWikidataFDO

Authors Sean Hallgren, Alexander Russell, 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 algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups
• Quantum algorithms for Simon's problem over general groups
• scientific article; zbMATH DE number 1304334

Cited in

(20)

• The quantum query complexity of the hidden subgroup problem is polynomial
• Is Grover's algorithm a quantum hidden subgroup algorithm?
• Convergence rates of random walk on irreducible representations of finite groups
• Discrete quantum walks hit exponentially faster
• Quantum algorithms for Simon's problem over nonabelian groups
• Quantum algorithms for Simon's problem over general groups
• Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups
• The independence of reduced subgroup-state
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• scientific article; zbMATH DE number 7561742 (Why is no real title available?)
• The hidden subgroup problem for universal algebras
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• On quantum algorithms for noncommutative hidden subgroups
• 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
• Applications of finite non-abelian simple groups to cryptography in the quantum era
• Quantum complexity for discrete logarithms and related problems
• Finer-grained hardness of kernel density estimation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192035)