Related papers: On a recipe for quantum graphical languages
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations,…
We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using…
Graph Isomorphism is such an important problem in computer science, that it has been widely studied over the last decades. It is well known that it belongs to NP class, but is not NP-complete. It is thought to be of comparable difficulty to…
This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical…
With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an…
We employ an algebraic procedure based on quantum mechanics to propose a `quantum number theory' (QNT) as a possible extension of the `classical number theory'. We built our QNT by defining pure quantum number operators ($q$-numbers) of a…
A family of quantum cluster algebras is introduced and studied. In general, these algebras are new, but subclasses have been studied previously by other authors. The algebras are indexed by double partitions or double flag varieties.…
Quantum computing exploits quantum phenomena such as superposition and entanglement to realize a form of parallelism that is not available to traditional computing. It offers the potential of significant computational speed-ups in quantum…
This is a survey of our construction of current algebras, associated with complex curves and rational differentials. We also study in detail two classes of examples. The first is the case of a rational curve with differentials $z^n dz$;…
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a…
This is an introduction to quantum algebra, from a geometric perspective. The classical spaces $X$, such as the Lie groups, homogeneous spaces, or more general manifolds, are described by various algebras $A$, defined over various fields…
Quon language is a 3D picture language that we can apply to simulate mathematical concepts. We introduce the surface algebras as an extension of the notion of planar algebras to higher genus surface. We prove that there is a unique…
The quantum cohomology algebra of a projective manifold X is the cohomology H(X,Q) endowed with a different algebra structure, which takes into account the geometry of rational curves in X. We show that this algebra takes a remarkably…
Quantum computing (QC) is a new computational paradigm whose foundations relate to quantum physics. Notable progress has been made, driving the birth of a series of quantum-based algorithms that take advantage of quantum computational…
Quantum computers promise to efficiently solve important problems classical computers never will. However, in order to capitalize on these prospects, a fully automated quantum software stack needs to be developed. This involves a multitude…
We examine the relationship between the algebraic lambda-calculus, a fragment of the differential lambda-calculus and the linear-algebraic lambda-calculus, a candidate lambda-calculus for quantum computation. Both calculi are algebraic:…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
The quantum even-dimensional balls are defined as the $C^*$-algebras generated by certain graphs. We exhibit a polynomial algebra for each even-dimensional quantum ball, and classify the irreducible representations of it.
Qualitative spatial and temporal reasoning is based on so-called qualitative calculi. Algebraic properties of these calculi have several implications on reasoning algorithms. But what exactly is a qualitative calculus? And to which extent…
Hilbert space representations of cross product *-algebras of the Hopf *-algebras U_q(gl_2) with the coordinate algebras O(C^2_q) and O(R^3_q) of quantum vector spaces and U_q(su_2) with coordinate algebras O(SU_q(2)) and O(S^2_q) of…