Related papers: Quantum Computing and the Jones Polynomial
In this paper we analyze the structure of some subalgebras of quantized enveloping algebras corresponding to unipotent and solvable subgroups of a simple Lie group G. These algebras have the non--commutative structure of iterated algebras…
In this paper we discuss progress made in the study of the Jones polynomial from the point of view of quantum mechanics. This study reduces to the understanding of the quantization of the moduli space of flat SU(2)-connections on a surface…
The quantum deformation $CP_q(N)$ of complex projective space is discussed. Many of the features present in the case of the quantum sphere can be extended. The differential and integral calculus is studied and $CP_q(N)$ appears as a quantum…
We express the colored Jones polynomial as the inverse of the quantum determinant of a matrix with entries in the $q$-Weyl algebra of $q$-operators, evaluated at the trivial function (plus simple substitutions). The Kashaev invariant is…
Permutation and its partial transpose play important roles in quantum information theory. The Werner state is recognized as a rational solution of the Yang--Baxter equation, and the isotropic state with an adjustable parameter is found to…
The concept of qudit (a d-level system) cluster state is proposed by generalizing the qubit cluster state (Phys. Rev. Lett. \textbf{86}, 910 (2001)) according to the finite dimensional representations of quantum plane algebra. We…
It is shown that the canonical problem of classical statistical thermodynamics, the computation of the partition function, is in the case of +/-J Ising spin glasses a particular instance of certain simple sums known as quadratically signed…
Artificial neural networks have been proposed as potential algorithms that could benefit from being implemented and run on quantum computers. In particular, they hold promise to greatly enhance Artificial Intelligence tasks, such as image…
We investigate the braid group representations arising from categories of representations of twisted quantum doubles of finite groups. For these categories, we show that the resulting braid group representations always factor through finite…
Motivated by the recent rapid development of complexity theory applied to quantum mechanical processes we present the complete derivation of Nielsen's complexity of unitaries belonging to the representations of oscillator group. Our…
We introduce the Mixed-Integer Quadratically Constrained Quadratic Programming framework for the quantum compilation problem and apply it in the context of topological quantum computing. In this setting, quantum gates are realized by…
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…
A central problem in quantum computing is to identify computational tasks which can be solved substantially faster on a quantum computer than on any classical computer. By studying the hardest such tasks, known as BQP-complete problems, we…
We develop a generalised gauge theory in which the role of gauge group is played by a coalgebra and the role of principal bundle by an algebra. The theory provides a unifying point of view which includes quantum group gauge theory,…
We give a new definition of the Jones polynomial. Let L be an oriented knot or link obtained as the plat closure of a braid beta in B_{2n}. We define a covering space tilde{C} of the space of unordered n-tuples of distinct points in the…
Quantum superposition says that any physical system simultaneously exists in all of its possible states, the number of which is exponential in the number of entities composing the system. The strength of presence of each possible state in…
Quantum computations operate in the quantum world. For their results to be useful in any way, there is an intrinsic necessity of cooperation and communication controlled by the classical world. As a consequence, full formal descriptions of…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
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…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…