Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups

van Dam, Wim; Dey, Siladitya

doi:10.4230/LIPIcs.TQC.2014.110

Document

Hidden Subgroup Quantum Algorithms for a Class of Semi-Direct Product Groups

Authors Wim van Dam, Siladitya Dey

Part of: Volume: 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: 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

PDF

File

PDF

LIPIcs.TQC.2014.110.pdf

Filesize: 365 kB
8 pages

Document Identifiers

DOI: 10.4230/LIPIcs.TQC.2014.110
URN: urn:nbn:de:0030-drops-48117

Subject Classification

Keywords

quantum algorithms
quantum complexity theory
computational group theory

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get 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

Author Details

Wim van Dam

Siladitya Dey

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail