On quantum algorithms for noncommutative hidden subgroups

DOI10.1007/3-540-49116-3_45MaRDI QIDQ4251065zbMATH OpenFDO

Authors Mark Ettinger, Peter Høyer

Publication date 8 December 1999

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

Full work available at URL https://doi.org/10.1007/3-540-49116-3_45

zbMATH Keywords

dihedral groupsgenerating setshidden subgroupsquantum algorithms

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Subgroup theorems; subgroup growth (20E07) Numerical methods for discrete and fast Fourier transforms (65T50) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• On quantum algorithms for noncommutative hidden subgroups
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• Quantum hidden subgroup algorithms: an algorithmic toolkit
• Hidden subgroup quantum algorithms for a class of semi-direct product groups
• scientific article; zbMATH DE number 2103528
• Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
• Quantum algorithms for the hidden subgroup problem on some semi-direct product groups by reduction to abelian cases

Cited in

(27)

• Graph matching using the interference of continuous-time quantum walks
• Quantum computing -- facts and folklore
• Quantum algorithm design: techniques and applications
• On the quantum complexity of the continuous hidden subgroup problem
• Quantum security analysis of CSIDH
• Is Grover's algorithm a quantum hidden subgroup algorithm?
• Algorithmic methods in non-commutative algebra: applications to quantum groups
• Harmonic analysis on finite groups, number theory and efficient quantum cryptographic algorithms.
• Quantum computation: where does the speed-up come from?
• Quantum computation vs. firewalls
• Normal subgroup reconstruction and quantum computation using group representations
• Quantum computaton from a quantum logical perspective
• scientific article; zbMATH DE number 5320411 (Why is no real title available?)
• Decomposing finite Abelian groups
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• Quantum algorithms
• scientific article; zbMATH DE number 2103528 (Why is no real title available?)
• Quantum computation of discrete logarithms in semigroups
• The hidden subgroup problem and eigenvalue estimation on a quantum computer
• Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
• Quantum hidden subgroup algorithms: an algorithmic toolkit
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• On quantum algorithms for noncommutative hidden subgroups
• Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Quantum mechanics on finite groups

This page was built for publication: On quantum algorithms for noncommutative hidden subgroups

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