Related papers: Quantum Computing and the Jones Polynomial
We introduce a pentagon equation solver, available as part of SageMath, and use it to construct braid group representations associated to certain anyon systems. We recall the category-theoretic framework for topological quantum computation…
Governed by locality, we explore a connection between unitary braid group representations associated to a unitary $R$-matrix and to a simple object in a unitary braided fusion category. Unitary $R$-matrices, namely unitary solutions to the…
We propose models of quantum neural networks through Clifford algebras, which are capable of capturing geometric features of systems and to produce entanglement. Due to their representations in terms of Pauli matrices, the Clifford algebras…
This expository article supplies the mathematical background underpinning the braid representation calculator introduced in arXiv:2212.00831; those representations describe the sets of logic gates available to a topological quantum computer…
Some time ago it was conjectured that the coefficients of an expansion of the Jones polynomial in terms of the cosmological constant could provide an infinite string of knot invariants that are solutions of the vacuum Hamiltonian constraint…
This paper explores of the role of unitary braiding operators in quantum computing. We show that a single specific solution R (the Bell basis change matrix) of the Yang-Baxter Equation is a universal gate for quantum computing, in the…
Unitary braiding operators can be used as robust entangling quantum gates. We introduce a solution-generating technique to solve the $(d,m,l)$-generalized Yang-Baxter equation, for $m/2\leq l \leq m$, which allows to systematically…
The connection between braided Hopf algebra structure and the quantum group covariance of deformed oscillators is constructed explicitly. In this context we provide deformations of the Hopf algebra of functions on SU(1,1). Quantum subgroups…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
In this paper we will present a homological model for Coloured Jones Polynomials. For each colour $N \in \mathbb {N}$, we will describe the invariant $J_N(L,q)$ as a graded intersection pairing of certain homology classes in a covering of…
In the first 36 pages of this paper, we provide polynomial quantum algorithms for additive approximations of the Tutte polynomial, at any point in the Tutte plane, for any planar graph. This includes as special cases the AJL algorithm for…
In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2+1 dimensional space-time. In…
We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a…
In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…
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 pursuit of quantum advantage in simulating many-body quantum systems on quantum computers has gained momentum with advancements in quantum hardware. This work focuses on leveraging the symmetry properties of these systems, particularly…
We present a general theory of braided quantum groups in the C*-algebraic framework using the language of multiplicative unitaries. Starting with a manageable multiplicative unitary in the representation category of the quantum codouble of…
Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a…
Quantum computing allows for the potential of significant advancements in both the speed and the capacity of widely used machine learning techniques. Here we employ quantum algorithms for the Hopfield network, which can be used for pattern…
Presented is a topological representation of quantum logic that views entangled qubit spacetime histories (or qubit world lines) as a generalized braid, referred to as a superbraid. The crossing of world lines is purely quantum in nature,…