Corpus ID: 2593558

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}
}
  • Dmitry Gavinsky
  • Published 2008
  • Mathematics, Physics, Computer Science
  • ArXiv
  • 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
    Structure, randomness and complexity in quantum computation
    The Power of Unentanglement
    60
    The Power of Unentanglement
    11
    Explorer The Power of Unentanglement
    On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems
    30
    Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement
    11

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES