Two Bit Quantum Protocol for a Three Party Modular Function

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.