A lower bound on the quantum query complexity of read-once functions-Reference-Cited by-同舟云学术

A lower bound on the quantum query complexity of read-once functions

Published:2004-09 Issue:2 Volume:69 Page:244-258
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Barnum Howard,Saks Michael

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference15 articles.

1. A. Ambainis, Quantum lower bounds by quantum arguments, Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing (STOC), 2000, pp. 636–643.

2. H. Barnum, M. Saks, M. Szegedy, Quantum decision trees and semidefinite programming, Proceedings of the 18th IEEE Annual Conference on Computational Complexity (COMPLEXITY ’03), 2003, pp. 179–193.

3. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, FOCS ’98, 1998, pp. 352–361.

4. Strengths and weaknesses of quantum computing;Bennett;SIAM J. Comput.,1997

5. Complexity measures and decision tree complexity;Buhrman;Theoret. Comput. Sci.,2002

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum Algorithm for Lexicographically Minimal String Rotation;Theory of Computing Systems;2023-10-24

2. Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

3. Explicit relation between all lower bound techniques for quantum query complexity;International Journal of Quantum Information;2015-06

4. Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas;Theory of Quantum Computation, Communication, and Cryptography;2014

5. Query Complexity of Matroids;Lecture Notes in Computer Science;2013