The Hidden Subgroup Problem and Quantum Computation Using Group Representations
DOI10.1137/S009753970139450XzbMATH Open1029.81015OpenAlexW2054912210WikidataQ62398483 ScholiaQ62398483MaRDI QIDQ4706239FDOQ4706239
Authors: Sean Hallgren, Alexander Russell, Amnon Ta-Shma 
Publication date: 19 June 2003
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753970139450x
Recommendations
- Normal subgroup reconstruction and quantum computation using group representations
- EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
- The hidden subgroup problem for universal algebras
- scientific article; zbMATH DE number 1304334
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
computational complexityfinite groupsquantum algorithmsrepresentation theorySimon's algorithmShor's factoring
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68)
Cited In (47)
- How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
- Title not available (Why is that?)
- Deterministic algorithms for the hidden subgroup problem
- Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
- Is Grover's algorithm a quantum hidden subgroup algorithm?
- Normal subgroup reconstruction and quantum computation using group representations
- Quantum Testers for Hidden Group Properties
- Hidden translation and translating coset in quantum computing
- Quantum algorithm design: techniques and applications
- The quantum query complexity of the hidden subgroup problem is polynomial
- Quantum algorithm to solve function inversion with time-space trade-off
- On solving systems of diagonal polynomial equations over finite fields
- The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups
- Title not available (Why is that?)
- On the quantum complexity of the continuous hidden subgroup problem
- Title not available (Why is that?)
- Quantum Computation and Lattice Problems
- Sample complexity of hidden subgroup problem
- Quantum hidden subgroup algorithms: an algorithmic toolkit
- Decomposing finite Abelian groups
- Classical and quantum algorithms for testing equivalence of group extensions
- Implementation of group-covariant positive operator valued measures by orthogonal measurements
- Harmonic analysis on finite groups, number theory and efficient quantum cryptographic algorithms.
- The hidden subgroup problem for universal algebras
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
- Quantum mechanics on finite groups
- On the Complexity of the Hidden Subgroup Problem
- On quantum algorithms for noncommutative hidden subgroups
- Quantum algorithms for fixed points and invariant subgroups
- An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
- The quantum query complexity of the abelian hidden subgroup problem
- Hidden translation and orbit coset in quantum computing
- TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT
- 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
- Quantum algorithms for Simon's problem over nonabelian groups
- A public key cryptosystem based on data complexity under quantum environment
- Query complexity of generalized Simon's problem
- An efficient quantum algorithm for some instances of the group isomorphism problem
- Solving systems of diagonal polynomial equations over finite fields
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- Quantum algorithms for Simon's problem over general groups
- Rapid solution of problems by quantum computation
- On the complexity of the hidden subgroup problem
- Quantum algorithms for algebraic problems
This page was built for publication: The Hidden Subgroup Problem and Quantum Computation Using Group Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706239)
