Communication Tasks with Infinite Quantum-Classical Separation.

  title={Communication Tasks with Infinite Quantum-Classical Separation.},
  author={C. Perry and R. Jain and J. Oppenheim},
  journal={Physical review letters},
  volume={115 3},
  • C. Perry, R. Jain, J. Oppenheim
  • Published 2015
  • Computer Science, Physics, Medicine
  • Physical review letters
  • Quantum resources can be more powerful than classical resources-a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two parties' inputs can be done with exponentially less communication with quantum messages than with classical ones. Here we consider a task between two players, Alice and Bob where quantum resources are infinitely more powerful than their classical counterpart. Alice is given a string of length n, and Bob's… CONTINUE READING
    16 Citations

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Simple communication complexity separation from quantum state antidistinguishability
    • 3
    • PDF
    Conclusive exclusion of quantum states and aspects of thermo-majorization
    • 1
    • PDF
    Using quantum theory to simplify input–output processes
    • 26
    • PDF
    POVMs are equivalent to projections for perfect state exclusion of three pure states in three dimensions
    • 1
    • PDF
    Reality, causality, and quantum theory
    Not-Post-Peierls compatibility under noisy channels
    • 2
    • PDF


    Multiparty quantum communication complexity.
    • 105
    • PDF
    Quantum Entanglement and Communication Complexity
    • 109
    • PDF
    Substituting a qubit for an arbitrarily large number of classical bits.
    • 28
    • PDF
    Quantum communication
    • N. Gisin, H. Zbinden
    • Computer Science, Physics
    • 2017 Optical Fiber Communications Conference and Exhibition (OFC)
    • 2017
    • 489
    • PDF
    Quantum state targeting
    • 12
    • PDF
    Nondeterministic Quantum Query and Communication Complexities
    • R. Wolf
    • Computer Science, Mathematics
    • SIAM J. Comput.
    • 2003
    • 45
    • PDF
    How to Compress Interactive Communication
    • 97