@InProceedings{belovs_et_al:LIPIcs.TQC.2018.3,
author = {Belovs, Aleksandrs and Rosmanis, Ansis},
title = {{Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems}},
booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-080-4},
ISSN = {1868-8969},
year = {2018},
volume = {111},
editor = {Jeffery, Stacey},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2018.3},
URN = {urn:nbn:de:0030-drops-92501},
doi = {10.4230/LIPIcs.TQC.2018.3},
annote = {Keywords: Adversary Bound, Dual Learning Graphs, Quantum Query Complexity, Representation Theory}
}