Quantum mechanical algorithms for the nonabelian hidden subgroup problem
From MaRDI portal
Publication:705722
DOI10.1007/s00493-004-0009-8zbMath1057.81009OpenAlexW2611247211MaRDI QIDQ705722
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
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (17)
Random measurement bases, quantum state distinction and applications to the hidden subgroup problem ⋮ Structural identifiability in low-rank matrix factorization ⋮ Exhaustion 2-subsets in dihedral groups of order 2p ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ On statistics, computation and scalability ⋮ Sample complexity of hidden subgroup problem ⋮ On the Complexity of the Hidden Subgroup Problem ⋮ Computational indistinguishability between quantum states and its cryptographic application ⋮ Quantum algorithm design: techniques and applications ⋮ Experiments with LAGRASP heuristic for set \(k\)-covering ⋮ ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM ⋮ Complexity classes of equivalence problems revisited ⋮ Efficient distributed approximation algorithms via probabilistic tree embeddings ⋮ Quantum algorithms for algebraic problems ⋮ Query complexity of generalized Simon's problem ⋮ Extending the Promise of the Deutsch–Jozsa–Høyer Algorithm for Finite Groups ⋮ Deterministic algorithms for the hidden subgroup problem
This page was built for publication: Quantum mechanical algorithms for the nonabelian hidden subgroup problem
