The Hidden Subgroup Problem and Quantum Computation Using Group Representations
From MaRDI portal
Publication:4706239
DOI10.1137/S009753970139450XzbMath1029.81015WikidataQ62398483 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 complexity; finite groups; quantum algorithms; representation theory; Simon's algorithm; Shor's factoring
81P68: Quantum computation
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
A public key cryptosystem based on data complexity under quantum environment, ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM, TOWARDS A QUANTUM ALGORITHM FOR THE PERMANENT, Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling, Computational indistinguishability between quantum states and its cryptographic application, Solving systems of diagonal polynomial equations over finite fields, Random measurement bases, quantum state distinction and applications to the hidden subgroup problem, 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, 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, Implementation of group-covariant positive operator valued measures by orthogonal measurements, Quantum algorithms for algebraic problems, On Solving Systems of Diagonal Polynomial Equations Over Finite Fields, On the Complexity of the Hidden Subgroup Problem, Rapid solution of problems by quantum computation
