Random Articles
Reseach Article
Two Bit Quantum Protocol for a Three Party Modular Function
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 35 - Number 10 |
| Year of Publication: 2011 |
| Authors: Bhagaban Swain, Sudipta Roy |
10.5120/4440-6195
|
Bhagaban Swain, Sudipta Roy . Two Bit Quantum Protocol for a Three Party Modular Function. International Journal of Computer Applications. 35, 10 ( December 2011), 47-50. DOI=10.5120/4440-6195
Abstract
Communicational complexity problem among three parties for the calculation of a three party inner product modular function is discussed, where each party possess some of the function’s input. Classical communicational complexity of this function can be evaluated by three classical bits. In classical theory, the three party modular function can’t be evaluated by two classical bits, but using quantum entanglement in quantum theory two classical bits are sufficient to calculate the three party problem.
References
- Einstein, A., Prodolsky, B., and Rosen, N. 1935. Can quantum mechanical description of physical reality be considered complete?
- Bell, J. S. 1964. On the einstein-podolsky-rosen paradox.
- Benne, C. H. and Wiesner, S. J. 1992. . Communication via one and two-particle operators on einstein-podolsky-rosen states.
- Buhrman, H., Cleve, R. and Dam, W. V. 1997. Quantum Entanglement and Communication Complexity, arxiv:quant-ph/9705033.
- Bruknerand , C., Zukowski, M. and Zeilinger, A. 2002 Quantum communication complexity protocol with two entangled qutrits.
- Cleve, R. and Buhrman, H. 1997. Substituting quantum entanglement for communication.
Index Terms
Keywords