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

Beth, Thomas; Roetteler, Martin

research

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

Authors: Thomas Beth
Martin Roetteler
Publication date: 1 January 1998
Publisher

Abstract

We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.Comment: 16 pages, LaTeX2e, 3 figure

Similar works

Full text

Open in the Core reader

Download PDF

Available Versions

arXiv.org e-Print Archive

oai:arXiv.org:quant-ph/9812070

Last time updated on 13/04/2012