Related papers: A Graphical Calculus for Quantum Computing with Mu…
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0\rangle$ computational basis. In addition, we allow the creation of a one-qubit ancilla in a…
This paper gives a new interpretation of the virtual braid group in terms of a strict monoidal category SC that is freely generated by one object and three morphisms, two of the morphisms corresponding to basic pure virtual braids and one…
Quantum gates built out of braid group elements form the building blocks of topological quantum computation. They have been extensively studied in $SU(2)_k$ quantum group theories, a rich source of examples of non-Abelian anyons such as the…
A scheme suitable for describing quantum nonultralocal models including supersymmetric ones is proposed. Braided algebras are generalised to be used through Baxterisation for constructing braided quantum Yang--Baxter equations.…
We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…
Braided doubles provide a unifying framework for classical and quantum universal enveloping algebras and rational Cherednik algebras. They are a class of algebras with triangular decomposition, arising from a deformation problem, the…
We consider a pair of independent scalar products, one scalar product on vectors, and another independent scalar product on dual space of co-vectors. The Clifford co-product of multivectors is calculated from the dual Clifford algebra. With…
Graph states are computationally powerful quantum states with many applications including use as resource states for measurement-based quantum computing (MBQC). We demonstrate construction of graph states on a Rydberg atom quantum analogue…
We construct a braiding operator in terms of the quantum dilogarithm function based on the quantum cluster algebra. We show that it is a q-deformation of the R-operator for which hyperbolic octrahedron is assigned. Also shown is that, by…
This paper presents an introduction to geometric representations of quantum states in which each distinct quantum state, pure and mixed, corresponds to a unique point in a Euclidean space. Beginning with a review of some underappreciated…
Twists are defects in the lattice which can be utilized to perform computations on encoded data. Twists have been studied in various classes of topological codes like qubit and qudit surface codes, qubit color codes and qubit subsystem…
This work has the purpose of applying the concept of Geometric Calculus (Clifford Algebras) to the Fibre Bundle description of Quantum Mechanics. Thus, it is intended to generalize that formulation to curved spacetimes [the base space of…
A many variable $q$-calculus is introduced using the formalism of braided covector algebras. Its properties when certain of its deformation parameters are roots of unity are discussed in detail, and related to fractional supersymmetry. The…
We give an algebraic formulation based on Clifford algebras and algebraic spinors for quantum information. In this context, logic gates and concepts such as chirality, charge conjugation, parity and time reversal are introduced and explored…
We consider two different types of deformations for the linear group $ GL(n)$ which correspond to using of a general diagonal R-matrix. Relations between braided and quantum deformed algebras and their coactions on a quantum plane are…
A decision diagram (DD) is a graph-like data structure for homomorphic compression of Boolean and pseudo-Boolean functions. Over the past decades, decision diagrams have been successfully applied to verification, linear algebra, stochastic…
We introduce a general notion of quantum universal enveloping algebroids (QUE algebroids), or quantum groupoids, as a unification of quantum groups and star-products. Some basic properties are studied including the twist construction and…
The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially…
In this work, we study the complexity of graph-state preparation. We consider general quantum algorithms consisting of Clifford operations acting on at most two qubits for graph-state preparations. We define the CZ-complexity of a graph…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…