arXiv Analytics

Sign in

arXiv:quant-ph/9812070AbstractReferencesReviewsResources

Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups

Martin Roetteler, Thomas Beth

Published 1998-12-24Version 1

We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.

Comments: 16 pages, LaTeX2e, 3 figures
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:quant-ph/9903071 (Published 1999-03-20)
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
arXiv:1101.1053 [quant-ph] (Published 2011-01-05, updated 2012-03-21)
An Improved Query for the Hidden Subgroup Problem
arXiv:quant-ph/9909014 (Published 1999-09-03)
Wavelets and Wavelet Packets on Quantum Computers

Links

Toolbox