@inproceedings{8d54091c2a9a4edda30b605b6b8cf31d,
title = "Quantum Dual Adversary for Hidden Subgroups and Beyond",
abstract = "An explicit quantum dual adversary for the S-isomorphism problem is constructed. As a consequence, this gives an alternative proof that the query complexity of the dihedral hidden subgroup problem is polynomial.",
keywords = "Hidden subgroup problem, Isomorphism testing, Property testing, Quantum algorithms, Quantum aversary bound",
author = "Aleksandrs Belovs",
note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.; 18th International Conference on Unconventional Computation and Natural Computation, UCNC 2019 ; Conference date: 03-06-2019 Through 07-06-2019",
year = "2019",
doi = "10.1007/978-3-030-19311-9\_4",
language = "English",
isbn = "9783030193102",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "30--36",
editor = "Shinnosuke Seki and Ian McQuillan",
booktitle = "Unconventional Computation and Natural Computation - 18th International Conference, UCNC 2019, Proceedings",
address = "Germany",
}