Analysis of Quantum Functions
Abstract
This paper initiates a systematic study of quantum functions, which are (partial) functions defined in terms of quantum mechanical computations. Of all quantum functions, we focus on resource-bounded quantum functions whose inputs are classical bit strings. We prove complexity-theoretical properties and unique characteristics of these quantum functions by recent techniques developed for the analysis of quantum computations. We also discuss relativized quantum functions that make adaptive and nonadaptive oracle queries.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 1999
- DOI:
- 10.48550/arXiv.quant-ph/9909012
- arXiv:
- arXiv:quant-ph/9909012
- Bibcode:
- 1999quant.ph..9012Y
- Keywords:
-
- Quantum Physics;
- Computer Science - Computational Complexity
- E-Print:
- The complete version of the conference paper appeared in the Proceedings of the 19th International Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Springer-Verlag, Vol.1738, pp.407-419, 1999