Skip to main content

Quantum communication complexity


Research objectives and content
We are interested in the following communication scenario: The parties possess some quantum bits, which have been initially prepared in an entangled state. Operations applied to one of them affect also the state of the other quantum bits. We know that these non-local effects cannot be used to transmit information between parties without physical communication. Thus it is surprising that these effects can help to carry out some computation with fewer bits of communication than are necessary in the classical case as has been shown recently.
We want to determine the communication complexity of some specific functions (like testing equality of numbers, st- connectivity, etc) in the quantum computational case and compare it with the classical complexity. The classical communication complexity is well characterized by the size of the minimal monochromatic partition of the value table. We would like to look if there is such a powerful and general tool for quantum communication complexity.
Training content (objective, benefit and expected impact)
Quantum communication gives an alternative approach to analyze quantum algorithms and to understand better what makes the power of quantum computers.
The study of EPR-pairs in the context of quantum computers gave a second birth of this area in Physics.
Links with industry / industrial relevance (22)

Funding Scheme

RGI - Research grants (individual fellowships)


The Hebrew University of Jerusalem - The Authority for Research and Development
Givat Ram
91905 Jerusalem