相关论文: Topological Quantum Computing and the Jones Polyno…
Topos theory has been suggested first by Isham and Butterfield, and then by Isham and Doering, as an alternative mathematical structure within which to formulate physical theories. In particular, it has been used to reformulate standard…
Quantum computing promises to revolutionize various fields, yet the execution of quantum programs necessitates an effective compilation process. This involves strategically mapping quantum circuits onto the physical qubits of a quantum…
This review paper surveys work by Isham, Butterfield, D\"oring, Landsman, Spitters, Heunen, and others on topos-theoretic analyses of quantum theory. It aims to provide a synthesized account of their various approaches.
The quantum approximate optimization algorithm (QAOA) applies two Hamiltonians to a quantum system in alternation. The original goal of the algorithm was to drive the system close to the ground state of one of the Hamiltonians. This paper…
This is the first article in a series devoted to the study of the asymptotic expansions of various quantum invariants related to the twist knots. In this paper, by using the saddle point method developed by Ohtsuki, we obtain an asymptotic…
We propose a new method for numerical calculation of link plynomials for knots given in 3 dimensions. We calculate derivatives of the Jones polynomial in a computational time proportional to $N^{\alpha}$ with respect to the system size $N$…
We prove the existence of topological quantum error correcting codes with encoding rates $k/n$ asymptotically approaching the maximum possible value. Explicit constructions of these topological codes are presented using surfaces of…
We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. Our methods are rooted in the bracket…
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…
We suggest a new construction for the Quantum Groups - Jones polynomials of torus knots in terms of the PBW theorem of DAHA for any root systems and weights (justified for type A). The main focus is on the DAHA super-polynomials, a stable…
This paper formulates a generalization of our work on quantum knots to explain how to make quantum versions of algebraic, combinatorial and topological structures. We include a description of previous work on the construction of Hilbert…
Harrow, Hassidim, and Lloyd showed that for a suitably specified $N \times N$ matrix $A$ and $N$-dimensional vector $\vec{b}$, there is a quantum algorithm that outputs a quantum state proportional to the solution of the linear system of…
The quantum approximate optimization algorithm (QAOA) is considered to be one of the most promising approaches towards using near-term quantum computers for practical application. In its original form, the algorithm applies two different…
We study a quantum version of the $n$-dimer model from statistical mechanics, based on the formalism from quantum topology developed by Reshetikhin and Turaev (the latter which, in particular, can be used to construct the Jones polynomial…
We consider the problem of pricing discretely monitored Asian options over $T$ monitoring points where the underlying asset is modeled by a geometric Brownian motion. We provide two quantum algorithms with complexity poly-logarithmic in $T$…
The Slope Conjecture relates a quantum knot invariant, (the degree of the colored Jones polynomial of a knot) with a classical one (boundary slopes of incompressible surfaces in the knot complement). The degree of the colored Jones…
We find a new quantum system associated with the Wilson Orthogonal Polynomial. In order to establish correspondence between the recent reformulation of quantum mechanic without potential function [1-2] and the convention quantum mechanics,…
This paper defines versions of the Jones polynomial and Khovanov homology by using several maps from the set of Gauss diagrams to its variant. Through calculation of some examples, this paper also shows that these versions behave…
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…
The SL_3 colored Jones polynomial of the trefoil knot is a $q$-holonomic sequence of two variables with natural origin, namely quantum topology. The paper presents an explicit set of generators for the annihilator ideal of this…