scientific article; zbMATH DE number 7564420

DOI10.4230/LIPIcs.CCC.2019.20MaRDI QIDQ5091771

Matthew Coudron, Aram W. Harrow

Publication date: 27 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

entanglementquantum communication complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution
• A Communication-Efficient Nonlocal Measurement With Application to Communication Complexity and Bipartite Gate Capacities

This page was built for publication: