Quick Navigation
Topics
Quantum Simulation
Quantum State Preparation Representation
A quantum polylog algorithm for non-normal maximal cyclic hidden subgroups in the affine group of a finite field
arXiv
Authors: Nolan Wallach
Year
2013
Paper ID
33335
Status
Preprint
Abstract Read
~2 min
Abstract Words
53
Citations
N/A
Abstract
We give an algorithm to solve the quantum hidden subgroup problem for maximal cyclic non-normal subgroups of the affine group of a finite field (if the field has order q then the group has order q(q-1)) with probability 1-varepsilon with (polylog) complexity O\(log(q\)Rlog\(varepsilon\)2) where R<infty.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2013 reference point for readers tracking recent quantum research.
- We give an algorithm to solve the quantum hidden subgroup problem for maximal cyclic non-normal subgroups of the affine group of a finite field (if the field has order q then...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.