Quantum Bounded Query Complexity
<|reference_start|>Quantum Bounded Query Complexity: We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of decision problems. Under traditional complexity assumptions, we obtain an exponential speedup between the quantum and the classical query complexity of function classes.   For decision problems and function classes we obtain the following results: o P_||^NP[2k] is included in EQP_||^NP[k] o P_||^NP[2^(k+1)-2] is included in EQP^NP[k] o FP_||^NP[2^(k+1)-2] is included in FEQP^NP[2k] o FP_||^NP is included in FEQP^NP[O(log n)] For sets A that are many-one complete for PSPACE or EXP we show that FP^A is included in FEQP^A[1]. Sets A that are many-one complete for PP have the property that FP_||^A is included in FEQP^A[1]. In general we prove that for any set A there is a set X such that FP^A is included in FEQP^X[1], establishing that no set is superterse in the quantum setting.<|reference_end|>
@article{buhrman1999quantum,
    title={Quantum Bounded Query Complexity},
    author={Harry Buhrman (CWI) and Wim van Dam (CQC and CWI)},
    journal={Proceedings of the 14th Annual IEEE Conference on Computational
  Complexity, pp. 149-156 (1999)},
    year={1999},
    doi={10.1109/CCC.1999.766273},
    archivePrefix={arXiv},
    eprint={quant-ph/9903035},
    primaryClass={quant-ph cs.CC}
}