The Hidden Subgroup Problem - Review and Open Problems
read the original abstract
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
$\mathcal{O}(n)$ alternative to Quantum Fourier Transform with efficient neural net classical post-processing
HP-1 circuits achieve O(n) depth while preserving shift invariance and exponentially growing Fisher information, enabling numerical replacement of the QFT in Shor's algorithm with neural net classical post-processing.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.