Analysis of Quantum Functions (Preliminary Version)

Authors:
Tomoyuki Yamakami
Affiliations:
-
Venue:
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
1999

Citing 9
Cited 1

Gap-definable counting classes

Journal of Computer and System Sciences
A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum Complexity Theory

SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing

SIAM Journal on Computing
Quantum Computability

SIAM Journal on Computing
A Foundation of Programming a Multi-tape Quantum Turing Machine

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Quantum Counting

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Complexity Limitations on Quantum Computation

COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Quantum circuit complexity

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

Quantum Optimization Problems

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quantum functions are functions that are defined in terms of quantum mechanical computation. Besides quantum computable functions, we study quantum probability functions, which compute the acceptance probability of quantum computation. We also investigate quantum gap functions, which compute the gap between acceptance and rejection probabilities of quantum computation.