Abstract
In this paper we study a weak version of quantum nondeterministic communication complexity, in which a classical proof has to be checked with probability one by a quantum protocol. We prove that, in the framework of communication complexity, even this weak version of quantum nondeterminism is strictly stronger than classical nondeterminism. More precisely, we show a separation, for a total function, of quantum weakly nondeterministic and classical nondeterministic communication complexity. This separation is quadratic and shows that classical proofs can be checked more efficiently by quantum protocols than by classical ones.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
