Abstract
We introduce a two-party communication complexity problem in which the probability of success by using a particular strategy allows the parties to detect with certainty whether or not some forbidden communication has taken place. We show that theprobability of success is bounded by nature; any conceivable method which gives a probability of success outside these bounds is impossible. Moreover, any conceivable method to solve the problem which gives a probability success within these bounds is possible in nature. This example suggests that a suitaby chosen set of communication complexity problems could be the basis of an information-theoretic axiomatization of quantum mechanics.
Similar content being viewed by others
References
Fuchs C.A., in Decoherence and its Implications in Quantum Computation and Information Transfer, Gonis A., and P. E. A. Turchi, eds. (IOS Press, Amsterdam, 2001).
Fuchs C.A., in Quantum Theory: Reconsideration of Foundations, Khrennikov A., ed. (Växjö University Press, Växjö, 2002).
Fuchs C.A. (2003). Notes on a Paulian Idea Fundational, Historical, Anecdotal and Forward-looking Thoughts on the Quantum. Selected Correspondence, 1995–2001. Växjö University Press, Växjö
Fuchs C.A. (2003). J. Mod. Opt. 50: 987
Wheeler J.A., in Complexity, Entropy, and the Physics of Information, Zurek W.H., ed. (Addison-Wesley, Redwood City, California, 1990), p. 1.
Wheeler J.A., in Quantum Coherence and Reality, Anandan J., and Safko J.L., eds. (World Scientific, Singapore, 1995).
Wheeler J.A., and Ford K.W. (1998). Geons, Black Holes, and Quantum Foam. Norton W.W., New York
Zeilinger A. (1999). Found. Phys 29:631
Fuchs C.A., Fortschr. Phys. 46, 535 (1998). Reprinted in Quantum Computation: Where Do We Want To Go Tomorrow?, S.L. Braunstein ed. (Wiley-VCH, Weinheim, 1999), p. 229.
Fuchs C.A., in Quantum Communication, Computing, and Measurement, Kumar P., G. M. D’Ariano, and O. Hirota eds. (Kluwer, Dordrecht, 2000), p. 1.
Fuchs C.A., and Jacobs K. (2001). Phys. Rev. A 63:062305
Brassard G., Comments during discussion at meeting “Quantum Foundations in the Light of Quantum Information and Cryptography,” Montreal, May 17–19, 2000.
Bennett C.H., and Brassard G. (1984). Proceedings of IEEE International Conference on Computers, Systems, and Signal Processing (Bangalore, India, 1984). IEEE, New York, p. 175
Lo H.-K., Chau H.F. (1999). Science 283:2050
Brassard G., and C. Crépeau, in Advances in Cryptology: Proccedings of Crypto’90 (Springer-Verlag, Berlin, 1991) p. 49.
Mayers D. (1997). Phys. Rev. Lett. 78:3414
Lo H.-K., Chau H.F. (1997). Phys. Rev. Lett 78:3410
Clifton R., Bub J., and Halvorson H. (2003). Found. Phys 33:1561
Smolin J.A. (2005). Quant. Inf. Comp. 5:161
Spekkens R.W., unpublished, reported in Ref. 19.
Halvorson H., and Bub J. (2005). Quant. Inf. Comp. 5:170
Bell J.S. (1964). Physics 1:195
Einstein A., Podolsky B., and Rosen N. (1935). Phys. Rev. 47:777
Bohm D. (1951). Quantum Theory. Prentice-Hall, Englewood Cliffs, New Jersey
Clauser J.F., Horne M.A., Shimony A., and Holt R.A. (1969). Phys. Rev. Lett. 23:880
Froissart M. (1981). Nuovo Cimento Soc. Ital. Fis. 64B:241
Fine A. (1982). Phys. Rev. Lett. 48:291
Fine A. (1982). J. Math. Phys. 23:1306
Popescu S., and Rohrlich D. (1994). Found Phys 24:379
Cleve R., and Buhrman H. (1997). Phys. Rev. A 56:1201
Buhrman H., Cleve R., and Wigderson A., in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (ACM Press, New York, 1998), p. 63.
Buhrman H., van Dam W., Høyer P., Tapp A. (1999). Phys. Rev. A 60:2737
Raz R., in Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (ACM Press, New York, 1999), p. 358.
Steane A.M., and van Dam W. (2000). Phys. Today 53(2):35
Buhrman H., Cleve R., and van Dam W. (2001). SIAM J. Comput 30:1829
Brassard G., Broadbent A., and Tapp A., in Algorithms and Data Structures: Proceedings of 8th International Workshop, WADS 2003, Lecture Notes in Computer Science 2748, Denne F., Sack J.R., and Smid M., eds. (Springer, New York, 2003), P.1.
Brassard G. (2003). Found. Phys 33:1593
Brassard G., Broadbent A., and Tapp A. (2005). Found. Phys 35:1877
Brassard G., Broadbent A., and Tapp A. (2005). Quant. Inf. Comp. 5:538
Brassard G., Méthot A.A., Tapp A. (2005). Quant. Inf. Comp 5:275
Mermin N.D. (1990). Phys. Today 43(6):9
Mermin N.D. (1990). Am. J. Phys 58:731
Mermin N.D. (1990). Phys. Rev. Lett. 65:3373
Greenberger D.M., Horne M.A., and Zeilinger A., in Bell’s Theorem, Quantum Theory, and Conceptions of the Universe, M. Kafatos ed. (Kluwer Academic, Dordrecht, 1989), p. 69.
Greenberger D.M., Horne M.A., Shimony A., and Zeilinger A. (1990). Am. J. Phys 58:1131
Cabello A. (2001). Phys. Rev. Lett. 86:1911
Cabello A. (2001). Phys. Rev. Lett. 87:010403
Aravind P.K. (2002). Found. Phys. Lett. 15:397
Aravind P.K. (2004). Am. J. Phys. 72:1303
Vaidman L. (2001). Phys. Lett. A 286:241
Brukner Č., Żukowski M., Pan J.W., Zeilinger A. (2004). Phys. Rev. Lett 92:127901
Tsirelson B.S., Zapiski LOMI 142, 174 (1985); English version: J. Soviet Math. 36, 557 (1987).
Landau L.J. (1988). Found. Phys 18:449
Tsirelson B.S. (1993). Hadronic. J. Suppl 8:329
Tsirelson B.S. (1980). Lett Math Phys 4:93
Khalfin L.A., and Tsirelson B.S., in Symposium on the Foundations of Modern Physics: 50 Years of the Einstein-Podolsky-Rosen Experiment, Lahti P., and Mittelstaedt P., eds. (World Scientific, Singapore, 1985), p. 441.
Landau L.J. (1987). Phys. Lett. A 120:54
Khalfin L.A., and Tsirelson B.S. (1992). Found. Phys 22:879
Mermin N.D. (1981). Am. J. Phys 49:940
Barrett J., Linden N., Massar S., Pironio S., Popescu S., and Roberts D. (2005). Phys. Rev. A 71:022101
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cabello, A. Communication Complexity as a Principle of Quantum Mechanics. Found Phys 36, 512–525 (2006). https://doi.org/10.1007/s10701-005-9029-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10701-005-9029-5
Keywords
- Bell’s inequalities
- communication complexity
- foundations of quantum mechanics
- quantum communication
- quantum correlations
- Tsirelson’s inequalities