Related papers: Homomorphisms of quantum hypergraphs
We introduce a new class of non-local games, and corresponding densities, which we call bisynchronous. Bisynchronous games are a subclass of synchronous games and exhibit many interesting symmetries when the algebra of the game is…
We show a general method of compiling any $k$-prover non-local game into a single-prover interactive game maintaining the same (quantum) completeness and (classical) soundness guarantees (up to negligible additive factors in a security…
For digital images, there is an established homotopy equivalence relation which parallels that of classical topology. Many classical homotopy equivalence invariants, such as the Euler characteristic and the homology groups, do not remain…
We consider supersymmetric quantum mechanical models with both local and nonlocal potentials. We present a nonlocal deformation of exactly solvable local models. Its energy eigenfunctions and eigenvalues are determined exactly. We observe…
This paper is a mathematical study of quantum correlation functions in quantum field theory within a homotopy algebraic framework motivated from the BV quantization scheme. We characterize quantum correlation functions by algebraic homotopy…
We show that the C*-algebras associated with synchronous games give rise to certain quantum families of maps between the input and output sets of the game. In particular situations (e.g. for graph endomorphism games) these quantum families…
We discuss various notions generalizing the concept of a homogeneous space to the setting of locally compact quantum groups. On the von Neumann algebra level we find an interesting duality for such objects. A definition of a quantum…
We study the graph isomorphism game that arises in quantum information theory from the perspective of bigalois extensions of compact quantum groups. We show that every algebraic quantum isomorphism between a pair of (quantum) graphs $X$ and…
We introduce a notion of strategies based on averaging for nonlocal games in quantum information theory. These so-called statistical strategies come in a commuting type and a more specific spatial type, which are respectively special cases…
Commutativity gadgets provide a technique for lifting classical reductions between constraint satisfaction problems to quantum-sound reductions between the corresponding nonlocal games. We develop a general framework for commutativity…
The model of local Turing machines is introduced, including classical and quantum ones, in the framework of matrix-product states. The locality refers to the fact that at any instance of the computation the heads of a Turing machine have…
We introduce the notion of nonlocal symmetry of a graph $G$, defined as a winning quantum correlation for the $G$-automorphism game that cannot be produced classically. Recent connections between quantum group theory and quantum information…
Homomorphic encryption is a form of encryption which allows computation to be carried out on the encrypted data without the need for decryption. The success of quantum approaches to related tasks in a delegated computation setting has…
We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…
We introduce a notion of quantum function, and develop a compositional framework for finite quantum set theory based on a 2-category of quantum sets and quantum functions. We use this framework to formulate a 2-categorical theory of quantum…
We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…
The notion of a quantum family of maps has been introduced in the framework of C*-algebras. As in the classical case, one may consider a quantum family of maps preserving additional structures (e.g. quantum family of maps preserving a…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
We investigate quantum correlations in time in different approaches. We assume that temporal correlations should be treated in an even-handed manner with spatial correlations. We compare the pseudo-density matrix formalism with several…
In this work, we present a novel method to express the stabilizer of a k-uniform complete hypergraph state as a linear combination of local operators. Quantum hypergraph states generalize graph states and exhibit properties that are not…