Related papers: Stateless Quantum Structures and Extremal Graph Th…
Graphs are topological spaces that include broader objects than discretized manifolds, making them interesting playgrounds for the study of quantum phases not realized by symmetry breaking. In particular they are known to support anyons of…
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…
The graph state formalism is a useful abstraction of entanglement. It is used in some multipartite purification schemes and it adequately represents universal resources for measurement-only quantum computation. We focus in this paper on the…
The phase space for a system of $n$ qubits is a discrete grid of $2^{n} \times 2^{n}$ points, whose axes are labeled in terms of the elements of the finite field $\Gal{2^n}$ to endow it with proper geometrical properties. We analyze the…
Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the…
A novel no-go theorem is presented which sets a bound upon the extent to which '\Psi-epistemic' interpretations of quantum theory are able to explain the overlap between non-orthogonal quantum states in terms of an experimenter's ignorance…
We develop a possibilistic semantic formalism for quantum phenomena from an operational perspective. This semantic system is based on a Chu duality between preparation processes and yes/no tests, the target space being a three-valued set…
Recently, the work on quantum automorphism groups of graphs has seen renewed progress, which we expand in this paper. Quantum symmetry is a richer notion of symmetry than the classical symmetries of a graph. In general, it is non-trivial to…
We study the existence of quantum state transfer in $\mathcal{Q}$-graphs in this paper. The $\mathcal{Q}$-graph of a graph $G$, denoted by $\mathcal{Q}(G)$, is the graph derived from $G$ by plugging a new vertex to each edge of $G$ and…
Quantum graph neural networks offer a powerful paradigm for learning on graph-structured data, yet their explainability is complicated by measurement-induced stochasticity and the combinatorial nature of graph structure. In this paper, we…
Hypergraph states are multi-qubit states that form a subset of the locally maximally entangleable states and a generalization of the well--established notion of graph states. Mathematically, they can conveniently be described by a…
This article comprehensively explores matrices and their prerequisites for achieving positive semidefiniteness. The study delves into a series of theorems concerning pure quantum states in the context of weighted graphs. The main objective…
The program of understanding Shape Theory layer by layer topologically and geometrically -- proposed in Part I -- is now addressed for 4 points in 1-$d$. Topological shape space graphs are far more complex here, whereas metric shape spaces…
Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to…
We define a notion of quantum automorphism group of Graph C*-algebras for finite, connected graphs. Under the assumption that the underlying graph does not have any multiple edge or loop, the quantum automorphism group of underlying…
Let $\Gamma$ denote a finite, undirected, connected graph, with vertex set $X$. Fix a vertex $x \in X$. Associated with $x$ is a certain subalgebra $T=T(x)$ of ${\rm Mat}_X(\mathbb C)$, called the subconstituent algebra. The algebra $T$ is…
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…
We investigate which finite Cayley graphs admit a quantum ergodic eigenbasis, proving that this holds for any Cayley graph on a group of size $n$ for which the sum of the dimensions of its irreducible representations is $o(n)$, yet there…
We study quantum analogs of graph colorings and chromatic number. Initially defined via an interactive protocol, quantum colorings can also be viewed as a natural operator relaxation of graph coloring. Since there is no known algorithm for…
A fundamental problem in quantum information is to describe efficiently multipartite quantum states. An efficient representation in terms of graphs exists for several families of quantum states (graph, cluster, stabilizer states),…