Quantum entanglement and the communication complexity of the inner product function

DOI10.1016/j.tcs.2012.12.012zbMath1278.81039OpenAlexW2571271130WikidataQ55193725 ScholiaQ55193725MaRDI QIDQ387020

Wim van Dam, Richard Cleve, Alain Tapp, Michael A. Nielsen

Publication date: 11 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.012

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (3)

Spherical optimization with complex variables for computing US-eigenpairs ⋮ Interferometric computation beyond quantum theory ⋮ Noisy Interactive Quantum Communication

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum Entanglement and Communication Complexity
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
• Quantum Complexity Theory
• Strengths and Weaknesses of Quantum Computing
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Communication Complexity
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?

This page was built for publication: Quantum entanglement and the communication complexity of the inner product function