Adversary lower bounds for nonadaptive quantum algorithms
classification
💻 cs.CC
quant-ph
keywords
adversaryalgorithmsboundslowernonadaptivequantumambainiscomplexity
read the original abstract
We present general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Our results are based on the adversary method of Ambainis.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.