Quantum learning algorithms imply circuit lower bounds
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)(2021)
摘要
We establish the first general connection between the design of quantum algorithms and circuit lower bounds. Specifically, let $\mathfrak{C}$ be a class of polynomial-size concepts, and suppose that $\mathfrak{C}$ can be PAC-learned with membership queries under the uniform distribution with error $1/2 -\gamma$ by a time $T$ quantum algorithm. We prove t...
更多查看译文
关键词
Computer science,Quantum computing,Quantum algorithm,Quantum mechanics,Generators,Quantum circuit,Computational complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要