Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion
In this work we consider the role of entanglement assistance in quantum communication protocols, focusing, in particular, on whether the type of shared entangled state can affect the quantum communication complexity of a function. This question is interesting because in some other settings in quantu...
Main Author: | Harrow, Aram W. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Physics |
Format: | Article |
Language: | English |
Published: |
Schloss Dagstuhl, Leibniz Center for Informatics
2020
|
Online Access: | https://hdl.handle.net/1721.1/128238 |
Similar Items
-
Limitations of Semidefinite Programs for Separable States and Entangled Games
by: Harrow, Aram W., et al.
Published: (2020) -
Expected Communication Cost of Distributed Quantum Tasks
by: Anshu, Anurag, et al.
Published: (2020) -
Algebraic ER=EPR and complexity transfer
by: Engelhardt, Netta, et al.
Published: (2024) -
Lower Bound on Expected Communication Cost of Quantum Huffman Coding
by: Anshu, Anurag, et al.
Published: (2017) -
Are entangled particles connected by wormholes? Evidence for the ER = EPR conjecture from entropy inequalities
by: Gharibyan, Hrant, et al.
Published: (2014)