Lower Bounds for Parallel Quantum Counting
Quantum Physics
2019-11-01 v2 Computational Complexity
Abstract
We prove a generalization of the parallel adversary method to multi-valued functions, and apply it to prove that there is no parallel quantum advantage for approximate counting.
Cite
@article{arxiv.1910.04555,
title = {Lower Bounds for Parallel Quantum Counting},
author = {Paul Burchard},
journal= {arXiv preprint arXiv:1910.04555},
year = {2019}
}
Comments
added discussion