Related papers: A route to quantum computing through the theory of…
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate…
Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a…
Topological quivers are generalizations of directed graphs in which the sets of vertices and edges are locally compact Hausdorff spaces. Associated to such a topological quiver Q is a C*-correspondence, and from this correspondence one may…
This dissertation concerns the classification of groupoid and higher-rank graph C*-algebras and has two main components. Firstly, for a groupoid it is shown that the notions of strength of convergence in the orbit space and…
We study, from a combinatorial viewpoint, the quantized coordinate ring of mxn matrices over an infinite field K (also called quantum matrices) and its torus-invariant prime ideals. The first part of this paper shows that this algebra,…
Quantum machine learning is a fast-emerging field that aims to tackle machine learning using quantum algorithms and quantum computing. Due to the lack of physical qubits and an effective means to map real-world data from Euclidean space to…
We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
We define the relative Cuntz-Krieger algebras associated to finitely aligned higher-rank graphs. We prove versions of the gauge-invariant uniqueness theorem and the Cuntz-Krieger uniqueness theorem for relative Cuntz-Krieger algebras.
The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…
We explore the concept of a graph homomorphism through the lens of C$^*$-algebras and operator systems. We start by studying the various notions of a quantum graph homomorphism and examine how they are related to each other. We then define…
We consider the higher-rank graphs introduced by Kumjian and Pask as models for higher-rank Cuntz-Krieger algebras. We describe a variant of the Cuntz-Krieger relations which applies to graphs with sources, and describe a local convexity…
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…
This survey article is concerned with the modeling of the kinematical structure of quantum systems in an algebraic framework which eliminates certain conceptual and computational difficulties of the conventional approaches. Relying on the…
We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…
One learned from Gottesman-Knill theorem that the Clifford model of quantum computing \cite{Clark07} may be generated from a few quantum gates, the Hadamard, Phase and Controlled-Z gates, and efficiently simulated on a classical computer.…
We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations…
Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves substantial speedups over existing simulators for a wide class of…
We systematise and develop a graphical approach to the investigations of quantum integrable vertex statistical models and the corresponding quantum spin chains. The graphical forms of the unitarity and various crossing relations are…
In this work, we develop a graphical calculus for multi-qudit computations with generalized Clifford algebras, building off the algebraic framework developed in our prior work. We build our graphical calculus out of a fixed set of graphical…