Quantum and non-signalling graph isomorphisms
We introduce the (G,H)-isomorphism game, a new two-player non-local game that classical players can win with certainty iff the graphs G and H are isomorphic. We then define quantum and non-signalling isomorphisms by considering perfect quantum and non-signalling strategies for this game. We prove th...
Saved in:
Main Authors: | Atserias, Albert, Mančinska, Laura, Roberson, David E., Šámal, Robert, Severini, Simone, Varvitsiotis, Antonis |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/143205 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Relaxations of graph isomorphism
by: Mančinska, Laura, et al.
Published: (2018) -
The intersection graph of isomorphic subgraphs of a graph
by: Garcia, Mark Anthony A., et al.
Published: (2008) -
On the intersection graph of isomorphic subgraphs of a graph
by: Lomibao, Bernadette G., et al.
Published: (2009) -
Graph isomorphism detection program
by: Torres, Emmanuel Ronald
Published: (1993) -
A program on tree isomorphism (tree isomorphism detection program)
by: Velez, Jeremiah-Jose N.
Published: (1997)