An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups

DOI10.1007/s00453-010-9467-0zbMath1236.68071arXiv0707.1260MaRDI QIDQ2428678

Miklos Santha, Luc Sanselme, Gábor Ivanyos

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.1260

zbMATH Keywords

nilpotent group; quantum computing; efficient algorithm; hidden subgroup problem

Mathematics Subject Classification ID

81P68: Quantum computation

20D15: Finite nilpotent groups, (p)-groups

68Q12: Quantum algorithms and complexity in the theory of computing

Related Items

Zero sum subsequences and hidden subgroups, Solving systems of diagonal polynomial equations over finite fields, On Solving Systems of Diagonal Polynomial Equations Over Finite Fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Collection from the left and other strategies
• On total functions, existence theorems and computational complexity
• Orbit-stabilizer problems and computing normalizers for polycyclic groups.
• Efficient collection in infinite polycyclic groups.
• Hidden translation and orbit coset in quantum computing
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
• Symbolic Collection using Deep Thought
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Computation and Lattice Problems
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Deterministic equation solving over finite fields
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM