A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Quantum weakly nondeterministic communication complexity
2013
Theoretical Computer Science
In this paper, we study a weak version of quantum nondeterministic communication complexity, corresponding to the most natural generalization of classical nondeterminism, in which a classical proof has to be checked with probability one by a quantum protocol. Another stronger definition of quantum nondeterminism has already been extensively studied, corresponding to the view of quantum nondeterminism as unbounded-error one-sided quantum computation, but, although being mathematically
doi:10.1016/j.tcs.2012.12.015
fatcat:fs6sk76p5zf2fapaenpq4jfzca