Bounds on entanglement-assisted source-channel coding via the Lovász ϑ number and its variants
We study zero-error entanglement-assisted source-channel coding (communication in the presence of side information). Adapting a technique of Beigi, we show that such coding requires existence of a set of vectors satisfying orthogonality conditions related to suitably defined graphs G and H. Such vec...
Saved in:
Main Authors: | Cubitt, Toby, Mancinska, Laura, Roberson, David E., Severini, Simone, Stahlke, Dan, Winter, Andreas |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/103786 http://hdl.handle.net/10220/24586 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
by: Sotirov, R., et al.
Published: (2012) -
Zero-error communication via quantum channels and a quantum Lovász script v sign-function
by: Duan, R., et al.
Published: (2014) -
Relaxations of graph isomorphism
by: Mančinska, Laura, et al.
Published: (2018) -
Improved lower bounds on genuine-multipartite-entanglement concurrence
by: Chen, Z.-H., et al.
Published: (2014) -
Quantum and non-signalling graph isomorphisms
by: Atserias, Albert, et al.
Published: (2020)