Abstract
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. We prove that, in the framework of communication complexity, even the weak version of quantum nondeterminism is strictly stronger than classical nondeterminism. More precisely, we show the first 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aaronson, S.: Quantum Certificate Complexity. In: Proceedings of 18th Annual IEEE Conference on Computational Complexity, pp. 171–178 (2003)
Aaronson, S., Ambainis, A.: Quantum Search of Spatial Regions. Theory of Computing 1, 47–79 (2005)
Adleman, L.M., DeMarrais, J., Huang, M.A.: Quantum Computability. SIAM Journal on Computing 26(5), 1524–1540 (1997)
Babai, L., Snevily, H., Wilson, R.M.: A New Proof of Several Inequalities on Codes and Sets. Journal of Combinatorial Theory, Series A 71, 146–153 (1995)
Bar-Yossef, Z., Jayram, T.S., Kerenidis, I.: Exponential Separation of Quantum and Classical One-way Communication Complexity. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 128–137 (2004)
Bernstein, E., Vazirani, U.: Quantum Complexity Theory. SIAM Journal on Computing 26(5), 1411–1473 (1997)
Buhrman, H.: Quantum Computing and Communication Complexity. Bulletin of the EATCS, pp. 131–141 (2000)
Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. Classical Communication and Computation. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 63–68 (1998)
Buhrman, H., Fortnow, L., Newman, I., Röhrig, H.: Quantum Property Testing. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 480–488 (2003)
Delsarte, P.: An Algebraic Approach to the Association Schemes of Coding Theory. Philips Res. Suppl. 10 (1973)
Delsarte, P.: The Association Schemes of Coding Theory. In: In “Combinatorics; Proceedings of the NATO Advanced Study Institute, Breukelen, Part 1, Math. Centre Tracts, Math. Centrum, No 55, Amsterdam, pp. 139–157 (1974)
Deutsch, D., Jozsa, R.: Rapid Solution of Problems by Quantum Computation. Proceedings of the Royal Society of London Series A 439, 553–558 (1992)
Fenner, S., Green, F., Homer, S., Pruim, R.: Determining Acceptance Probability for a Quantum Computation is Hard for the Polynomial Hierarchy. Proceedings of the Royal Society of London Series A 455, 3953–3966 (1999)
Fortnow, L., Rogers, J.: Complexity Limitations on Quantum Computation. Journal of Computern and System Sciences 59(2), 240–252 (1999)
Frankl, P.: Orthogonal Vectors in the n-dimensional Cube and Codes with Missing Distance. Combinatorica 6, 279–285 (1986)
Høyer, P., de Wolf, R.: Improved Quantum Communication Complexity Bounds for Disjointness and Equality. In: Proceedings of the 19th International Symposium of Theoretical Aspects of Computer Science, pp. 299–310 (2002)
Yu Kitaev, A.: Quantum NP. In: Public Talk at the 2nd Workshop on Algorithms in Quantum Information Processing (1999)
Klauck, H.: On Quantum and Probabilistic Communication: Las Vegas and One-way protocols. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 644–651 (2000)
Klauck, H.: Quantum Communication Complexity. In: Proceedings of the Workshop on Boolean Functions and Applications at the 27th International Colloquium on Automata, Languages and Programming, pp. 241–252 (2000)
Hromkovič, J.: Communication Complexity and Parallel Computation. Springer, Heidelberg (1997)
Knill, E.: Quantum Randomness and Nondeterminism. Los-Alamos e-print archive, quant-ph/9610012 (1996)
Massar, S., Bacon, D., Cerf, N., Cleve, R.: Classical Simulation of Quantum Entanglement without Local Hidden Variables. Physics Reviews A 63, 052305 (2001)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Raz, R.: Exponential Separation of Quantum and Classical Communication Complexity. In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pp. 358–367 (1999)
Raz, R., Shpilka, A.: On the Power of Quantum Proofs. In: Proceedings of 19th Annual IEEE Conference on Computational Complexity, pp. 260–274 (2004)
Watrous, J.: Succint Quantum Proofs for Properties of Finite Groups. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pp. 537–546 (2000)
de Wolf, R.: Quantum Communication and Complexity. Theoretical Computer Science 287(1), 337–353 (2002)
de Wolf, R.: Nondeterministic Quantum Query and Communication Complexity. SIAM Journal on Computing 32(3), 681–699 (2003)
Yamakami, T., Yao, A.C.-C.: NQP C = co − C = P. Information Processing Letters 71, 63–69 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le Gall, F. (2006). Quantum Weakly Nondeterministic Communication Complexity. In: Královič, R., Urzyczyn, P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11821069_57
Download citation
DOI: https://doi.org/10.1007/11821069_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37791-7
Online ISBN: 978-3-540-37793-1
eBook Packages: Computer ScienceComputer Science (R0)