# On the role of shared entanglement

@article{Gavinsky2008OnTR, title={On the role of shared entanglement}, author={Dmitry Gavinsky}, journal={ArXiv}, year={2008}, volume={abs/quant-ph/0604052} }

Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of the former. In particular, there is no known "entanglement analogue" for the famous theorem by Newman, saying that the number of shared random bits required for solving any communication problem can be at most logarithmic in the input length (i.e., using more than O(log n) shared random bits would not reduce the… CONTINUE READING

#### Topics from this paper.

19 Citations

Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

- Computer Science, Mathematics
- 2008

32

On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems

- Computer Science, Mathematics
- 2013

30

Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract

- Computer Science
- 2008

30

Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement

- Computer Science, Physics
- 2008

11

Direct Product Theorems for Communication Complexity via Subdistribution Bounds

- Mathematics, Computer Science
- 2007

18

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 18 REFERENCES

Tensor norms and the classical communication complexity of nonlocal quantum measurement

- Computer Science
- 2005

8

Exponential separation of quantum and classical one-way communication complexity

- Computer Science, Mathematics
- 2004

114

Public vs. private coin flips in one round communication games (extended abstract)

- Computer Science
- 1996

67

Bounded-error quantum state identification and exponential separations in communication complexity

- Mathematics, Physics
- 2006

37

Quantum and classical strong direct product theorems and optimal time-space tradeoffs

- Mathematics, Computer Science
- 2004

92

Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement

- Computer Science, Physics
- 2002

41