Related papers: Bigalois extensions and the graph isomorphism game
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…
In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…
In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
We address the problem of the construction of quantum walks on Cayley graphs. Our main motivation is the relationship between quantum algorithms and quantum walks. In particular, we discuss the choice of the dimension of the local Hilbert…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
This paper has two tightly intertwined aims: (i) To introduce an intuitive and universal graphical calculus for multi-qubit systems, the ZX-calculus, which greatly simplifies derivations in the area of quantum computation and information.…
Let $X$ be a smooth, projective, geometrically connected curve over a finite field $\mathbb{F}_q$, and let $G$ be a split semisimple algebraic group over $\mathbb{F}_q$. Its dual group $\hat{G}$ is a split reductive group over $\mathbb{Z}$.…
Isomorphic factorizations of complete graphs originate from the seminal work of Frank Harary and collaborators, who initiated the systematic study of decompositions of complete graphs into pairwise isomorphic spanning subgraphs. In this…
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems,…
A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…
For every simplicial complex X, we construct a locally CAT(0) cubical complex T_X, a cellular isometric involution i on T_X and a map t_X from T_X to X with the following properties: t_Xi = t_X; t_X is a homology isomorphism; the induced…
For time-reversal invariant graphs we prove the Bohigas-Giannoni-Schmit conjecture in its most general form: For graphs that are mixing in the classical limit, all spectral correlation functions coincide with those of the Gaussian…
We show that, under weak assumptions, the automorphism group of a ${\rm CAT(0)}$ cube complex $X$ coincides with the automorphism group of Hagen's contact graph $\mathcal{C}(X)$. The result holds, in particular, for universal covers of…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
Let F be a field, G a finite group, and Map(G,F) the Hopf algebra of all set-theoretic maps G->F. If E is a finite field extension of F and G is its Galois group, the extension is Galois if and only if the canonical map resulting from…
In the present paper we investigate the faithfulness of certain linear representations of groups of automorphisms of a graph $X$ in the group of symmetries of the Jacobian of $X$. As a consequence we show that if a $3$-edge-connected graph…
We study invariance of KMS states on graph C*-algebras coming from strongly connected and circulant graphs under the classical and quantum symmetry of the graphs. We show that the unique KMS state for strongly connected graphs is invariant…