Graph homomorphisms for quantum players
A homomorphism from a graph X to a graph Y is an adjacency preserving mapping f:V(X) -> V(Y). We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph X admits a homomorphism to Y. This is a generalization of the well-studied graph coloring...
Saved in:
Main Authors: | , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2018
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/87672 http://hdl.handle.net/10220/46786 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
成為第一個發表評論!