Related papers: Topological Quantum Computation with the universal…
The paper introduces the application of information geometry to describe the ground states of Ising models by utilizing parity-check matrices of cyclic and quasi-cyclic codes on toric and spherical topologies. The approach establishes a…
Topological quantum states of matter, both Abelian and non-Abelian, are characterized by excitations whose wavefunctions undergo non-trivial statistical transformations as one excitation is moved (braided) around another. Topological…
We construct finite $R$-matrices for the first fundamental representation $V$ of two-parameter quantum groups $U_{r,s}(\mathfrak{g})$ for classical $\mathfrak{g}$, both through the decomposition of $V\otimes V$ into irreducibles…
It is shown that anisotropic spin chains with gapped bulk excitations and magnetically ordered ground states offer a promising platform for quantum computation, which bridges the conventional single-spin-based qubit concept with recently…
A unitary operator that satisfies the constant Yang-Baxter equation immediately yields a unitary representation of the braid group B n for every $n \ge 2$. If we view such an operator as a quantum-computational gate, then topological…
We define quantum determinants in Quantum Matrix Algebras, related to couples of compatible braidings following the scheme from [G]. We establish relations between these determinants and the so-called column-(row-)determinants, often used…
We demonstrate how quantum field theory problems can be embedded on quantum annealers. The general method we use is a discretisation of the field theory problem into a general Ising model, with the continuous field values being encoded into…
We provide an elementary introduction to topological quantum computation based on the Jones representation of the braid group. We first cover the Burau representation and Alexander polynomial. Then we discuss the Jones representation and…
We formulate quantum group Riemannian geometry as a gauge theory of quantum differential forms. We first develop (and slightly generalise) classical Riemannian geometry in a self-dual manner as a principal bundle frame resolution and a dual…
It is fundamental to view unitary braiding operators describing topological entanglements as universal quantum gates for quantum computation. This paper derives a unitary solution of the Quantum Yang--Baxter equation via Yang--Baxterization…
We observe a general structure theorem for quantum cohomology rings, a non-homogeneous version of the usual cohomology ring encoding information about (almost holomorphic) rational curves. An application is the rigorous computation of the…
We compute the braided groups and braided matrices $B(R)$ for the solution $R$ of the Yang-Baxter equation associated to the quantum Heisenberg group. We also show that a particular extension of the quantum Heisenberg group is dual to the…
Harnessing non-abelian statistics of anyons to perform quantum computational tasks is getting closer to reality. While the existence of universal anyons by braiding alone such as the Fibonacci anyon is theoretically a possibility,…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…
A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…
We study a three-dimensional (3D) classical Ising model that is exactly solvable when some coupling constants take certain imaginary values. The solution combines and generalizes the Onsager-Kaufman solution of the 2D Ising model and the…
Quantum contextuality, a fundamental feature distinguishing quantum theory from classical models, is investigated via algebraic and topological structures inherent in modular tensor categories. This work rigorously demonstrates that braid…
We show that a topological quantum computer based on the evaluation of a Witten-Reshetikhin-Turaev TQFT invariant of knots can always be arranged so that the knot diagrams with which one computes are diagrams of hyperbolic knots. The…
One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor…
Schemes for topological quantum computation are usually based on the assumption that the system is initially prepared in a specific state. In practice, this state preparation is expected to be challenging as it involves non-topological…