Quantum Randomness and Nondeterminism
作者： E. Knill
DOI:
关键词:
摘要: Does the notion of a quantum randomized or nondeterministic algorithm make sense, and if so, does randomness nondeterminism add power? Although reasonable random sources do not computational power, discussion naturally leads to several definitions complexity states. Unlike classical string complexity, both deterministic state complexities are interesting. A \emph{total nondeterminism} is introduced for decision problems. This may be proper extension nondeterminism.
arxiv.org
harvard.edu参考文章(0)