Related papers: A route to quantum computing through the theory of…
The Clifford hierarchy is a foundational concept for universal quantum computation (UQC). It was introduced to show that UQC can be realized via quantum teleportation, given access to certain standard resources. While the full structure of…
Diagrammatic techniques for reasoning about monoidal categories provide an intuitive understanding of the symmetries and connections of interacting computational processes. In the context of categorical quantum mechanics, Coecke and…
Quantum Graphity is an approach to quantum gravity based on a background independent formulation of condensed matter systems on graphs. We summarize recent results obtained on the notion of emergent geometry from the point of view of a…
The quantum cohomology algebra of the (full) flag manifold is a fundamental example in quantum cohomology theory, with connections to combinatorics, algebraic geometry, and integrable systems. Using a differential geometric approach, we…
We bring together in one place some of the main results and applications from our recent works in quantum information theory, in which we have brought techniques from operator theory, operator algebras, and graph theory for the first time…
In recent years, new neural network architectures designed to operate on graph-structured data have pushed the state-of-the-art in the field. A large set of these architectures utilize a form of classical random walks to diffuse…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and the vectors modeling qubit states grow exponentially with an increase in the number of qubits. However, by using a…
This is a systematic introduction for physicists to the theory of algebras and groups with braid statistics, as developed over the last three years by the author. There are braided lines, braided planes, braided matrices and braided groups…
We give a notion of branching systems on ultragraphs. From this we build concrete representations of ultragraph C*-algebras on the bounded linear operators of Hilbert spaces. To each branching system of an ultragraph we describe the…
We introduce higher-rank analogues of the Leavitt path algebras, which we call the Kumjian-Pask algebras. We prove graded and Cuntz-Krieger uniqueness theorems for these algebras, and analyze their ideal structure.
In this note we define one more way of quantization of classical systems. The quantization we consider is an analogue of classical Jordan-Schwinger (J.-S.) map which has been known and used for a long time by physicists. The difference,…
We introduce the notion of a topological higher-rank graph, a unified generalization of the higher-rank graph and the topological graph. Using groupoid techniques, we define the Toeplitz and Cuntz-Krieger algebras of topological higher-rank…
One particular approach to quantum groups (matrix pseudo groups) provides the Manin quantum plane. Assuming an appropriate set of non-commuting variables spanning linearly a representation space one is able to show that the endomorphisms on…
We present an operator-algebraic approach to the quantization and reduction of lattice field theories. Our approach uses groupoid C*-algebras to describe the observables and exploits Rieffel induction to implement the quantum gauge…
Every directed graph defines a Hilbert space and a family of weighted shifts that act on the space. We identify a natural notion of periodicity for such shifts and study their C*-algebras. We prove the algebras generated by all shifts of a…
In this paper we give a complete description of K-theory groups for Cuntz-Krieger C*-algebras associated to general locally-finite (topologically connected) graphs via Bass-Hashimoto operator. Our result generalizes the one obtained by the…
Continuous-time quantum walks (CTQWs) play a crucial role in quantum computing, especially for designing quantum algorithms. However, how to efficiently implement CTQWs is a challenging issue. In this paper, we study implementation of CTQWs…
The growing variety of quantum hardware technologies, each with unique peculiarities such as connectivity and native gate sets, creates challenges when selecting the best platform for executing a specific quantum circuit. This selection…
Photons are a natural resource in quantum information, and the last decade showed significant progress in high-quality single photon generation and detection. Furthermore, photonic qubits are easy to manipulate and do not require…