Quantum algorithms for fixed points and invariant subgroups

DOI10.1515/GCC.2011.013zbMath1253.68134OpenAlexW2151819055MaRDI QIDQ2884692

Stephen Majewicz, Marianna C. Bonanome

Publication date: 18 May 2012

Published in: Groups – Complexity – Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc.2011.013

zbMATH Keywords

quantum computationquantum algorithmGrover algorithmfixed-point-free automorphism

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Solubility of finite groups admitting a fixed-point-free automorphism of order rst. IV
• Solubility of finite groups admitting a fixed-point-free automorphism of order rst. II
• Solubility of finite groups admitting a fixed-point-free automorphism of order rst. III
• FINITE GROUPS WITH FIXED-POINT-FREE AUTOMORPHISMS OF PRIME ORDER
• HIERARCHICAL QUANTUM SEARCH
• Endomorphisms of free groups and their fixed points
• Finite Groups Admitting a Fixed-Point-Free Automorphism of Order 4

This page was built for publication: Quantum algorithms for fixed points and invariant subgroups