Related papers: Quantum Algorithms for the Jones Polynomial
The Jones polynomial and the Kauffman bracket are constructed, and their relation with knot and link theory is described. The quantum groups and tangle functor formalisms for understanding these invariants and their descendents are given.…
Optimization of unitary transformations in Variational Quantum Algorithms benefits highly from efficient evaluation of cost function gradients with respect to amplitudes of unitary generators. We propose several extensions of the…
We introduce several probabilistic quantum algorithms that overcome the normal unitary restrictions in quantum machine learning by leveraging the Linear Combination of Unitaries (LCU) method. Among our investigations are quantum native…
We present QUBO.jl, an end-to-end Julia package for working with QUBO (Quadratic Unconstrained Binary Optimization) instances. This tool aims to convert a broad range of JuMP problems for straightforward application in many physics and…
This paper is a next step in the project of systematic description of colored knot polynomials started in arXiv:1506.00339. In this paper, we managed to explicitly find the $\textit{inclusive}$ Racah matrices, i.e. the whole set of mixing…
Quantum neural networks (QNNs) are an analog of classical neural networks in the world of quantum computing, which are represented by a unitary matrix with trainable parameters. Inspired by the universal approximation property of classical…
Kauffman and Lomonaco explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In the work of G.…
A new approach to the implementation of a quantum computer by high-resolution nuclear magnetic resonance (NMR) is described. The key feature is that two or more line-selective radio-frequency pulses are applied simultaneously. A three-qubit…
In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of…
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solvers, while linear equations may be solved either by direct…
We motivate the use of quantum algorithms in particle physics and provide a brief overview of the most recent applications at high-energy colliders. In particular, we discuss in detail how a quantum approach reduces the complexity of jet…
Braid theories are applied to quantum computation processes, where to each crossing in the Braid diagram a unitary Yang-Baxter operator R is associated, representing either a Braiding matrix or a universal quantum gate. By operating with…
Nonlinear equations are challenging to solve due to their inherently nonlinear nature. As analytical solutions typically do not exist, numerical methods have been developed to tackle their solutions. In this article, we give a quantum…
We propose a gauge model of quantum electrodynamics (QED) and its nonabelian generalization from which we derive knot invariants such as the Jones polynomial. Our approach is inspired by the work of Witten who derived knot invariants from…
Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an…
In this article, we give the most genaral form of the quaternions algebra depending on 3-parameters. We define 3-parameter generalized quaternions (3PGQs) and study on various properties and applications. Firstly we present the definiton,…
A simple geometric way is suggested to derive the Ward identities in the Chern-Simons theory, also known as quantum $A$- and $C$-polynomials for knots. In quasi-classical limit it is closely related to the well publicized augmentation…
We address the question: Does there exist a non-trivial knot with a trivial Jones polynomial? To find such a knot, it is almost certainly sufficient to find a non-trivial braid on four strands in the kernel of the Burau representation. I…
The aim of the paper is to provide an method to obtain representations of the braid group through a set of quasitriangular Hopf algebras. In particular, these algebras may be derived from group algebras of cyclic groups with additional…
The AJ Conjecture relates a quantum invariant, a minimal order recursion for the colored Jones polynomial of a knot (known as the $\hat{A}$ polynomial), with a classical invariant, namely the defining polynomial $A$ of the $\psl$ character…