The Hidden Subgroup Problem and Quantum Computation Using Group Representations
From MaRDI portal
Publication:4706239
DOI10.1137/S009753970139450XzbMath1029.81015OpenAlexW2054912210WikidataQ62398483 ScholiaQ62398483MaRDI QIDQ4706239
Alexander Russell, Sean Hallgren, 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
computational complexityfinite groupsquantum algorithmsrepresentation theorySimon's algorithmShor's factoring
Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (19)
A public key cryptosystem based on data complexity under quantum environment ⋮ Random measurement bases, quantum state distinction and applications to the hidden subgroup problem ⋮ TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT ⋮ On Solving Systems of Diagonal Polynomial Equations Over Finite Fields ⋮ Quantum algorithm to solve function inversion with time-space trade-off ⋮ Sample complexity of hidden subgroup problem ⋮ Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling ⋮ On the Complexity of the Hidden Subgroup Problem ⋮ Rapid solution of problems by quantum computation ⋮ An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups ⋮ Computational indistinguishability between quantum states and its cryptographic application ⋮ Quantum algorithm design: techniques and applications ⋮ Is Grover's algorithm a quantum hidden subgroup algorithm? ⋮ Solving systems of diagonal polynomial equations over finite fields ⋮ Implementation of group-covariant positive operator valued measures by orthogonal measurements ⋮ ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM ⋮ Quantum algorithms for algebraic problems ⋮ Query complexity of generalized Simon's problem ⋮ Deterministic algorithms for the hidden subgroup problem
This page was built for publication: The Hidden Subgroup Problem and Quantum Computation Using Group Representations