Chris Lomont
Published 2004-11-04Version 1
An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it easier to absorb the background necessary to begin research on the Hidden Subgroup Problem. Proofs are provided which give very concrete algorithms and bounds for the finite abelian case with little outside references, and future directions are provided for the nonabelian case. This summary is current as of October 2004.
Comments: A thorough introduction to the HSP, with detailed proofs for many results, and an overview of the research literature through 2004. This is designed to bring more people to bear on the problem. 83 pages
An Improved Query for the Hidden Subgroup Problem
Quantum Communication: From Fundamentals to Recent Trends, Challenges and Open Problems
Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups
