A tight lower bound for non-coherent index erasure

Authors

Nathan Lindzey, College of Engineering and Applied Science
Ansis Rosmanis, Nagoya University

Abstract

Association schemes; General adversary method; Krein parameters; Quantum query complexity; Representation theory

Publication Title

Leibniz International Proceedings in Informatics Lipics

Recommended Citation

Lindzey, N., & Rosmanis, A. (2020). A tight lower bound for non-coherent index erasure. Leibniz International Proceedings in Informatics Lipics, 151 https://doi.org/10.4230/LIPIcs.ITCS.2020.59