Related references
Note: Only part of the references are listed.Partial Boolean Functions With Exact Quantum Query Complexity One
Guoliang Xu et al.
ENTROPY (2021)
Characterization of exact one-query quantum algorithms
Weijiang Chen et al.
PHYSICAL REVIEW A (2020)
Separations in Query Complexity Based on Pointer Functions
Andris Ambainis et al.
JOURNAL OF THE ACM (2017)
Exact Quantum Query Complexity of EXACTk,ln
Andris Ambainis et al.
SOFSEM 2017: THEORY AND PRACTICE OF COMPUTER SCIENCE (2017)
On Exact Quantum Query Complexity
Ashley Montanaro et al.
ALGORITHMICA (2015)
Deterministic Communication vs. Partition Number
Mika Goos et al.
2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (2015)
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing
Scott Aaronson et al.
STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING (2015)
Complexity measures and decision tree complexity: a survey
H Buhrman et al.
THEORETICAL COMPUTER SCIENCE (2002)
Quantum lower bounds by polynomials
R Beals et al.
JOURNAL OF THE ACM (2001)
Share Paper
