@InProceedings{bogdanov_et_al:LIPIcs.APPROX/RANDOM.2023.43,
author = {Bogdanov, Andrej and Cheung, Tsun Ming and Dinesh, Krishnamoorthy and Lui, John C. S.},
title = {{Classical Simulation of One-Query Quantum Distinguishers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {43:1--43:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.43},
URN = {urn:nbn:de:0030-drops-188684},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.43},
annote = {Keywords: Query complexity, quantum algorithms, hypothesis testing, Grothendieck’s inequality}
}