Related papers: Quantum and non-signalling graph isomorphisms
We construct a linear system non-local game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert space, or even with any tensor-product…
Graph states are well-entangled quantum states that are defined based on a graph. Of course, if two graphs are isomorphic their associated states are the same. Also, we know local operations do not change the entanglement of quantum states.…
Using a quantum processor to embed and process classical data enables the generation of correlations between variables that are inefficient to represent through classical computation. A fundamental question is whether these correlations…
Two signed graphs are called switching isomorphic if one of them is isomorphic to a switching equivalent of the other. To determine the number of switching non-isomorphic signed graphs on a specific graph, we will establish a method based…
We address the question of when quantum entanglement is a useful resource for information processing tasks by presenting a new class of nonlocal games that are simple, direct, generalizations of the Clauser Horne Shimony Holt game. For some…
An important topic in quantum information is the theory of error correction codes. Practical situations often involve quantum systems with states in an infinite dimensional Hilbert space, for example coherent states. Motivated by these…
A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding…
We study the faces of the set of quantum correlations, i.e., the Bell and noncontextuality inequalities without any quantum violation. First, we investigate the question whether every proper (tight) Bell inequality for two parties, other…
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many…
We propose a family of non-locality unique games for 2 parties based on a square lattice on an arbitrary surface. We show that, due to structural similarities with error correction codes of Kitaev for fault tolerant quantum computation, the…
To a given multivariable C*-dynamical system $(A, \al)$ consisting of *-automorphisms, we associate a family of operator algebras $\alg(A, \al)$, which includes as specific examples the tensor algebra and the semicrossed product. It is…
Our purpose is to focus attention on a new criterion for quantum schemes by bringing together the notions of quantum game and game isomorphism. A quantum game scheme is required to generate the classical game as a special case. Now, given a…
We study no-signalling correlations over Cantor spaces, placing the product of infinitely many copies of a finite non-local game in a unified general setup. We define the subclasses of local, quantum spatial, approximately quantum and…
Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $\Gamma_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…
Quantum theory can be regarded as a non-commutative generalization of classical probability. From this point of view, one expects quantum dynamics to be analogous to classical conditional probabilities. In this paper, a variant of the…
The quantum-classical isomorphism for self-consistent field theory, which allows quantum particles in space-time to be represented as classical one-dimensional threads embedded in a five dimensional thermal-space-time, is summarized and…
Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…
There are few explicit examples of two player nonlocal games with a large gap between classical and quantum value. One of the reasons is that estimating the classical value is usually a hard computational task. This paper is devoted to…