The Hidden Subgroup Problem and Quantum Computation Using Group Representations
From MaRDI portal
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
Cited in
(47)- Quantum algorithm to solve function inversion with time-space trade-off
- Quantum algorithm design: techniques and applications
- Query complexity of generalized Simon's problem
- Deterministic algorithms for the hidden subgroup problem
- On the quantum complexity of the continuous hidden subgroup problem
- The quantum query complexity of the abelian hidden subgroup problem
- The quantum query complexity of the hidden subgroup problem is polynomial
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
- Is Grover's algorithm a quantum hidden subgroup algorithm?
- Sample complexity of hidden subgroup problem
- Quantum algorithms for fixed points and invariant subgroups
- Harmonic analysis on finite groups, number theory and efficient quantum cryptographic algorithms.
- Quantum algorithms for Simon's problem over nonabelian groups
- Quantum algorithms for Simon's problem over general groups
- Classical and quantum algorithms for testing equivalence of group extensions
- Implementation of group-covariant positive operator valued measures by orthogonal measurements
- Quantum algorithms for algebraic problems
- An efficient quantum algorithm for some instances of the group isomorphism problem
- Normal subgroup reconstruction and quantum computation using group representations
- On solving systems of diagonal polynomial equations over finite fields
- On the Complexity of the Hidden Subgroup Problem
- Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups
- Decomposing finite Abelian groups
- How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
- Hidden translation and orbit coset in quantum computing
- Quantum Testers for Hidden Group Properties
- Rapid solution of problems by quantum computation
- Computational indistinguishability between quantum states and its cryptographic application
- Quantum Computation and Lattice Problems
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 2103528 (Why is no real title available?)
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- A public key cryptosystem based on data complexity under quantum environment
- Solving systems of diagonal polynomial equations over finite fields
- The hidden subgroup problem for universal algebras
- On the complexity of the hidden subgroup problem
- TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT
- Hidden translation and translating coset in quantum computing
- Quantum hidden subgroup algorithms: an algorithmic toolkit
- The power of basis selection in Fourier sampling: hidden subgroup problems in affine groups
- An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
- EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
- On quantum algorithms for noncommutative hidden subgroups
- Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- Random measurement bases, quantum state distinction and applications to the hidden subgroup problem
- Quantum mechanics on finite groups
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)
