Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum algorithms for solvable groups
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum Factoring, Discrete Logarithms, and the Hidden Subgroup Problem
Computing in Science and Engineering
Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract)
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Hidden translation and orbit coset in quantum computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum Computation and Lattice Problems
SIAM Journal on Computing
The quantum query complexity of the hidden subgroup problem is polynomial
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Quantum Algorithms for Some Hidden Shift Problems
SIAM Journal on Computing
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Decomposing finite Abelian groups
Quantum Information & Computation
Finding conjugate stabilizer subgroups in PSL(2; q) and related groups
Quantum Information & Computation
Quantum solution to the hidden subgroup problem for poly-near-hamiltonian groups
Quantum Information & Computation
How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem
Quantum Information & Computation
Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups
Quantum Information & Computation
Solutions to the hidden subgroup problem on some metacyclic groups
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
| Hi-index | 0.00 |
We present a quantum algorithm for solving the hidden subgroup problem in the general linear group over a finite field where the hidden subgroup is promised to be a conjugate of the group of the invertible lower triangular matrices. The complexity of the algorithm is polynomial when size of the base field is not much smaller than the degree.