Relaxations of graph isomorphism
We introduce a nonlocal game that captures and extends the notion of graph isomorphism. This game can be won in the classical case if and only if the two input graphs are isomorphic. Thus, by considering quantum strategies we are able to define the notion of quantum isomorphism. We also consider the...
Saved in:
Main Authors: | Mančinska, Laura, Šámal, Robert, Severini, Simone, Varvitsiotis, Antonios, Roberson, David E. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/88428 http://hdl.handle.net/10220/45783 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Quantum and non-signalling graph isomorphisms
by: Atserias, Albert, et al.
Published: (2020) -
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) -
A program on tree isomorphism (tree isomorphism detection program)
by: Velez, Jeremiah-Jose N.
Published: (1997) -
Graph isomorphism detection program
by: Torres, Emmanuel Ronald
Published: (1993)