6533b834fe1ef96bd129cb3b

RESEARCH PRODUCT

Quantum Dual Adversary for Hidden Subgroups and Beyond

Aleksandrs Belovs

subject

Property testingDiscrete mathematicsPolynomialComputer scienceComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONQuantum algorithmDUAL (cognitive architecture)Dihedral angleAdversaryHidden subgroup problemQuantum

description

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.

yearjournalcountryeditionlanguage
2019-01-01
https://doi.org/10.1007/978-3-030-19311-9_4