Quantum algorithms for fixed points and invariant subgroups

DOI10.1515/GCC.2011.013MaRDI QIDQ2884692zbMATH OpenOpenAlexFDO

Authors Marianna Bonanome, Stephen Majewicz

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 algorithmquantum computationGrover algorithmfixed-point-free automorphism

Mathematics Subject Classification ID

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

Recommendations

• Quantum algorithms for solvable groups
• Theoretical Computer Science
• Quantum algorithms for a set of group theoretic problems
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• Hidden subgroup quantum algorithms for a class of semi-direct product groups

Cites work

• Endomorphisms of free groups and their fixed points
• FINITE GROUPS WITH FIXED-POINT-FREE AUTOMORPHISMS OF PRIME ORDER
• Finite Groups Admitting a Fixed-Point-Free Automorphism of Order 4
• HIERARCHICAL QUANTUM SEARCH
• Secure assisted quantum computation
• 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
• Solubility of finite groups admitting a fixed-point-free automorphism of order rst. IV

Cited in

(3)

• Exact Quantum Algorithms for the Leader Election Problem
• Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
• Grover's algorithm and the secant varieties

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

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