9909012v4

related topics
{algorithm, log, probability}
{time, systems, information}
{let, theorem, proof}
{phase, path, phys}
{operator, operators, space}
{cos, sin, state}

Analysis of Quantum Functions

Tomoyuki Yamakami

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.

oai_identifier:
oai:arXiv.org:quant-ph/9909012
categories:
quant-ph cs.CC
comments:
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
arxiv_id:
quant-ph/9909012
journal_ref:
International Journal of Foundations of Computer Science, Vol.14(5), pp.815-852, October 2003.
created:
1999-09-02
updated:
2003-08-07

Full article ▸

related documents
0509153v1
0510230v3
0408119v1
9910033v4
0603135v1
0703231v2
0510185v1
0504083v2
0206023v2
0408150v2
0008059v3
0612089v3
0607148v3
0410042v1
0403140v2
0304131v1
0010034v1
0210077v1
0207131v1
0504067v3
0511272v1
0505007v3
0201152v1
0206089v2
0302022v1