Analysis of Quantum Functions

Simple item page
dc.creatorYamakami, Tomoyuki
dc.date1999-09-02
dc.date2003-08-07
dc.date.accessioned2026-07-07T06:16:55Z
dc.date.available2026-07-07T06:16:55Z
dc.descriptionThis 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.
dc.descriptionThe 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
dc.identifierhttps://arxiv.org/abs/quant-ph/9909012
dc.identifierhttp://arxiv.org/abs/quant-ph/9909012
dc.identifierInternational Journal of Foundations of Computer Science, Vol.14(5), pp.815-852, October 2003.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94229
dc.subjectQuantum Physics
dc.subjectComputational Complexity
dc.titleAnalysis of Quantum Functions
dc.typetext

Files

Collections

arXiv