Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TQC.2014.110
URN: urn:nbn:de:0030-drops-48117
URL: https://drops.dagstuhl.de/opus/volltexte/2014/4811/
van Dam, Wim ; Dey, Siladitya
Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups
| pdf-format: |
|
Abstract
A quantum algorithm for the Hidden Subgroup Problem over the group Z/p^{r}Z \rtimes Z/q^{s}Z is presented. This algorithm, which for certain parameters of the group qualifies as 'efficient', generalizes prior work on related semi-direct product groups.
BibTeX - Entry
@InProceedings{vandam_et_al:LIPIcs:2014:4811,
author = {Wim van Dam and Siladitya Dey},
title = {{Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups}},
booktitle = {9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)},
pages = {110--117},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-73-6},
ISSN = {1868-8969},
year = {2014},
volume = {27},
editor = {Steven T. Flammia and Aram W. Harrow},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2014/4811},
URN = {urn:nbn:de:0030-drops-48117},
doi = {10.4230/LIPIcs.TQC.2014.110},
annote = {Keywords: quantum algorithms, quantum complexity theory, computational group theory}
}
| Keywords: | quantum algorithms, quantum complexity theory, computational group theory | |
| Seminar: | 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014) | |
| Issue date: | 2014 | |
| Date of publication: | 11.12.2014 |
