Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion
From MaRDI portal
Publication:5091771
DOI10.4230/LIPICS.CCC.2019.20MaRDI QIDQ5091771FDOQ5091771
Authors: Matthew Coudron, Aram W. Harrow 
Publication date: 27 July 2022
Full work available at URL: https://arxiv.org/abs/1902.07699
Recommendations
- On the role of shared entanglement
- Quantum entanglement and communication complexity
- Quantum entanglement and the communication complexity of the inner product function
- Communication complexity of remote state preparation with entanglement
- A Lower Bound on Entanglement-Assisted Quantum Communication Complexity
Cites Work
- The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
- Private vs. common random bits in communication complexity
- Title not available (Why is that?)
- Large violation of Bell inequalities with low entanglement
- Quantum state transformations and the Schubert calculus
- A Communication-Efficient Nonlocal Measurement With Application to Communication Complexity and Bipartite Gate Capacities
- Title not available (Why is that?)
- A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution
Cited In (1)
This page was built for publication: Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091771)
