ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM

DOI10.1142/S0129054113500305zbMath1291.68170OpenAlexW2053226561MaRDI QIDQ5168412

Yong Zhang, Stephen A. Fenner

Publication date: 4 July 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113500305

zbMATH Keywords

computational complexityquantum computinghidden subgroup problem

Mathematics Subject Classification ID

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

Related Items

The hidden subgroup problem and MKTP ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts

Cites Work

• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• A note on the graph isomorphism counting problem
• Efficient checkers for number-theoretic computations
• The quantum query complexity of the hidden subgroup problem is polynomial
• Quantum algorithms for algebraic problems
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• The Complexity of Decision Versus Search
• Designing programs that check their work
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• 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