Universality of EPR pairs in entanglement-assisted communication complexity, and the communication cost of state conversion

DOI10.4230/LIPICS.CCC.2019.20MaRDI QIDQ5091771zbMATH OpenFDO

Authors Matthew Coudron, Aram W. Harrow

Publication date 27 July 2022

Full work available at URL https://arxiv.org/abs/1902.07699

zbMATH Keywords

entanglementquantum communication complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

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

• scientific article; zbMATH DE number 6096706 (Why is no real title available?)
• scientific article; zbMATH DE number 6292749 (Why is no real title available?)
• A Communication-Efficient Nonlocal Measurement With Application to Communication Complexity and Bipartite Gate Capacities
• A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution
• Large violation of Bell inequalities with low entanglement
• Private vs. common random bits in communication complexity
• Quantum state transformations and the Schubert calculus
• The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels

Cited in

(1)

• scientific article; zbMATH DE number 7087310 (Why is no real title available?)

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)