On the Complexity of the Hidden Subgroup Problem

DOI10.1007/978-3-540-79228-4_6zbMath1139.68343OpenAlexW1580087386MaRDI QIDQ3502634

Yong Zhang, Stephen A. Fenner

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• A note on the graph isomorphism counting problem
• The quantum query complexity of the hidden subgroup problem is polynomial
• Graph Isomorphism is in SPP
• The Symmetric Group Defies Strong Fourier Sampling
• Hidden translation and orbit coset in quantum computing
• Designing programs that check their work
• Quantum Computation and Lattice Problems
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• Limitations of quantum coset states for graph isomorphism
• On quantum algorithms for noncommutative hidden subgroups
• A nonadaptive NC checker for permutation group intersection

This page was built for publication: On the Complexity of the Hidden Subgroup Problem