Quantum mechanical algorithms for the nonabelian hidden subgroup problem

DOI10.1007/S00493-004-0009-8MaRDI QIDQ705722zbMATH OpenOpenAlexFDO

Authors J. Schulman, Michelangelo Grigni, Monica Vazirani, Umesh V. Vazirani

Publication date 14 February 2005

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-004-0009-8

zbMATH Keywords

quantum computer, subgroup problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68)

Recommendations

• The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups
• On quantum algorithms for noncommutative hidden subgroups
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• scientific article; zbMATH DE number 1304334
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM

Cited in

(31)

• Quantum algorithms for algebraic problems
• On the complexity of the hidden subgroup problem
• How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
• Deterministic algorithms for the hidden subgroup problem
• Quantum algorithm design: techniques and applications
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups
• Structural identifiability in low-rank matrix factorization
• scientific article; zbMATH DE number 1406124 (Why is no real title available?)
• Sample complexity of hidden subgroup problem
• scientific article; zbMATH DE number 5320411 (Why is no real title available?)
• Complexity classes of equivalence problems revisited
• Exhaustion 2-subsets in dihedral groups of order \(2 p\)
• Quantum mechanics on finite groups
• Extending the Promise of the Deutsch–Jozsa–Høyer Algorithm for Finite Groups
• On the Complexity of the Hidden Subgroup Problem
• scientific article; zbMATH DE number 1304334 (Why is no real title available?)
• On quantum algorithms for noncommutative hidden subgroups
• The quantum query complexity of the abelian hidden subgroup problem
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
• Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
• Computational indistinguishability between quantum states and its cryptographic application
• Practical post-quantum signature schemes from isomorphism problems of trilinear forms
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• Automata, Languages and Programming
• Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
• Experiments with LAGRASP heuristic for set \(k\)-covering
• Query complexity of generalized Simon's problem
• Efficient distributed approximation algorithms via probabilistic tree embeddings
• On statistics, computation and scalability
• Hidden symmetry detection on a quantum computer

This page was built for publication: Quantum mechanical algorithms for the nonabelian hidden subgroup problem

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