Abstract
In this brief chapter we present a quantum algorithm, which can be seen as a generalization of Shor’s algorithm. We can here explain, in a more structural manner, why quantum computers can speed up some computational problems. The so-called Simon’s hidden subgroup problem can be stated in a general form as follows [18]:
-
Input: A finite abelian group G and function ρ: G → R, where R is a finite set.
-
Promise: There exists a nontrivial subgroup H ≤ G such that ρ is constant and distinct on each coset of H.
-
Output: A generating set for H.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hirvensalo, M. (2004). Finding the Hidden Subgroup. In: Quantum Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-09636-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-09636-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07383-0
Online ISBN: 978-3-662-09636-9
eBook Packages: Springer Book Archive