Quantum dual adversary for hidden subgroups and beyond

DOI10.1007/978-3-030-19311-9_4MaRDI QIDQ2326799zbMATH OpenOpenAlexFDO

Authors Aleksandrs Belovs

Publication date 10 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-19311-9_4

zbMATH Keywords

hidden subgroup problemisomorphism testingproperty testingquantum algorithmsquantum aversary bound

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• The quantum query complexity of the hidden subgroup problem is polynomial
• On the complexity of the hidden subgroup problem
• On the Complexity of the Hidden Subgroup Problem
• The quantum query complexity of the abelian hidden subgroup problem
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

Cited in

(2)

• Multidimensional quantum walks
• Mind the gap: achieving a super-Grover quantum speedup by jumping to the end

This page was built for publication: Quantum dual adversary for hidden subgroups and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2326799)