Related papers: Atom graph, partial Boolean algebra and quantum co…
We consider an algebraic formulation of Quantum Theory and develop a combinatorial model of the Heisenberg-Weyl algebra structure. It is shown that by lifting this structure to the richer algebra of graph operator calculus, we gain a simple…
Contextuality, the impossibility of assigning a single random variable to represent the outcomes of the same measurement procedure under different experimental conditions, is a central aspect of quantum mechanics. Thus defined, it appears…
Chromatic quantum contextuality is a criterion of quantum nonclassicality based on (hyper)graph coloring constraints. If a quantum hypergraph requires more colors than the number of outcomes per maximal observable (context), it lacks a…
The Kochen-Specker no-go theorem established that hidden-variable theories in quantum mechanics necessarily admit contextuality. This theorem is formally stated in terms of the partial Boolean algebra structure of projectors on a Hilbert…
A central result in the foundations of quantum mechanics is the Kochen-Specker theorem. In short, it states that quantum mechanics is in conflict with classical models in which the result of a measurement does not depend on which other…
Quantum contextuality supports quantum computation and communication. One of its main vehicles is hypergraphs. The most elaborated are the Kochen-Specker ones, but there is also another class of contextual sets that are not of this kind.…
This paper presents the quantum Moebius-Escher-Penrose hypergraph, drawing inspiration from paradoxical constructs such as the Moebius strip and Penrose's `impossible objects'. The hypergraph is constructed using faithful orthogonal…
Graph-theoretic structures play a central role in the description and analysis of quantum systems. In this work, we introduce a new class of quantum states, called $A_\alpha$-graph states, which are constructed from either unweighted or…
In this thesis we develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
We study hypergraphs which represent finite quantum event structures. We contribute to results of graph theory, regarding bounds on the number of edges, given the number of vertices. We develop a missing one for 3-graphs of girth 4. As an…
Alternative partial Boolean structures, implicit in the discussion of classical representability of sets of quantum mechanical predictions, are characterized, with definite general conclusions on the equivalence of the approaches going back…
We investigate a graph-theoretic approach to the problem of distinguishing quantum product states in the fundamental quantum communication framework called local operations and classical communication (LOCC). We identify chordality as the…
Within the framework of quantum contextuality, we discuss the ideas of extracontextuality and extravalence, that allow one to relate Kochen-Specker's and Gleason's theorems. We emphasize that whereas Kochen-Specker's is essentially a no-go…
Using von Neumann algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space.
Graph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a…
Quantum contextuality, a fundamental feature distinguishing quantum theory from classical models, is investigated via algebraic and topological structures inherent in modular tensor categories. This work rigorously demonstrates that braid…
A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…