Violating the Shannon capacity of metric graphs with entanglement

DOI10.1073/pnas.1203857110zbMath1292.81015arXiv1207.1779OpenAlexW2130940102WikidataQ37353214 ScholiaQ37353214MaRDI QIDQ5170983

Dion C. Gijswijt, Harry Buhrman, Jop Briët

Publication date: 25 July 2014

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distance in graphs (05C12) Measures of information, entropy (94A17) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (2)

Exclusivity structures and graph representatives of local complementation orbits ⋮ Quantum homomorphisms

Cites Work

• Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
• Intersection theorems with geometric consequences
• Coloring an Orthogonality Graph
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?

This page was built for publication: Violating the Shannon capacity of metric graphs with entanglement