Quantum mechanical algorithms for the nonabelian hidden subgroup problem

DOI10.1007/S00493-004-0009-8zbMATH Open1057.81009OpenAlexW2611247211MaRDI QIDQ705722FDOQ705722

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

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

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)

Cited In (31)

• 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 power of basis selection in Fourier sampling: hidden subgroup problems in affine groups
• The Hidden Subgroup Problem and Quantum Computation Using Group Representations
• Title not available (Why is that?)
• Structural identifiability in low-rank matrix factorization
• Sample complexity of hidden subgroup problem
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• On quantum algorithms for noncommutative hidden subgroups
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
• The quantum query complexity of the abelian hidden subgroup problem
• Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
• Computational indistinguishability between quantum states and its cryptographic application
• EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
• Practical post-quantum signature schemes from isomorphism problems of trilinear forms
• Automata, Languages and Programming
• Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
• Query complexity of generalized Simon's problem
• Experiments with LAGRASP heuristic for set \(k\)-covering
• Efficient distributed approximation algorithms via probabilistic tree embeddings
• On statistics, computation and scalability
• Hidden symmetry detection on a quantum computer
• On the complexity of the hidden subgroup problem
• Quantum algorithms for algebraic problems

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)