LIPIcs.TQC.2014.110.pdf
- Filesize: 365 kB
- 8 pages
Document
Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups
Authors
-
Part of:
Volume:
9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2014-12-11
Cite AsGet BibTex
Wim van Dam and Siladitya Dey. Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups. In 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 27, pp. 110-117, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/LIPIcs.TQC.2014.110
https://doi.org/10.4230/LIPIcs.TQC.2014.110
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.
Keywords
- quantum algorithms
- quantum complexity theory
- computational group theory
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads