Quantum graph isomorphism–strategy correspondence conjecture
Quantum graph isomorphism–strategy correspondence conjecture
Let and be irreflexive quantum graphs. The quantum graph isomorphism game is
with
A quantum graph isomorphism from to is the corresponding structure-preserving quantum map. Quantum graph isomorphism–strategy correspondence conjecture. There is a one-to-one correspondence between quantum graph isomorphisms from to and quantum tensor bistrategies realizing perfect bicorrelations, with respect to a cup state, for the quantum graph isomorphism game . The theorem preceding this conjecture establishes bisynchronicity, constructs perfect bicorrelations from quantum graph isomorphisms using quantum bistrategies and a cup state, and obtains quantum graph isomorphisms from perfect quantum commuting bistrategies; the full tensor-strategy correspondence remains unproved.
Sources & referencesView supporting material
Primary source
Adina Goldberg, “Quantum games and synchronicity”, arXiv:2408.15444 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.