中文
相关论文

相关论文: The Jones polynomial: quantum algorithms and appli…

200 篇论文

Twisted links are obtained from a base link by starting with a $n$-braid representation, choosing several ($m$) adjacent strands, and applying one or more twists to the set. Various restrictions may be applied, e.g. the twists may be…

几何拓扑 · 数学 2011-08-23 David Emmes

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…

量子物理 · 物理学 2020-09-01 Pramod Padmanabhan , Fumihiko Sugino , Diego Trancanelli

Braided groups and braided matrices are novel algebraic structures living in braided or quasitensor categories. As such they are a generalization of super-groups and super-matrices to the case of braid statistics. Here we construct braided…

高能物理 - 理论 · 物理学 2009-10-22 Shahn Majid

The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…

符号计算 · 计算机科学 2016-11-10 Victor Y. Pan , Elias P. Tsigaridas , Vitaly Zaderman , Liang Zhao

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.…

几何拓扑 · 数学 2018-08-01 Louis H. Kauffman , Eshan Mehrotra

Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…

几何拓扑 · 数学 2007-05-23 Ki Hyoung Ko , Jang Won Lee

The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the…

量子物理 · 物理学 2016-10-25 Sevag Gharibian , Julia Kempe

Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…

量子物理 · 物理学 2014-12-10 Roberto Santana , Ross B. McDonald , Helmut G. Katzgraber

A sequence $f_n(q)$ is $q$-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in $q$ and $q^n$. Our main theorems state that $q$-holonomicity is preserved under twisting, i.e., replacing $q$ by $\omega q$…

几何拓扑 · 数学 2012-05-17 Stavros Garoufalidis , Christoph Koutschan

This paper will be an exposition of the Kauffman bracket polynomial model of the Jones polynomial, tangle methods for computing the Jones polynomial, and the use of these methods to produce non-trivial links that cannot be detected by the…

几何拓扑 · 数学 2014-11-21 Daniel Amankwah

In this manuscript we introduce a method to measure entanglement of curves in 3-space that extends the notion of knot and link polynomials to open curves. We define the bracket polynomial of curves in 3-space and show that it has real…

几何拓扑 · 数学 2021-04-28 Eleni Panagiotou , Louis H. Kauffman

We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by…

几何拓扑 · 数学 2017-11-17 Kyungyong Lee , Ralf Schiffler

We propose a new non-commutative generalization of the representation variety and the character variety of a knot group. Our strategy is to reformulate the construction of the algebra of functions on the space of representations in terms of…

几何拓扑 · 数学 2022-12-01 Jun Murakami , Roland van der Veen

We continue our study of the degree of the colored Jones polynomial under knot cabling started in "Knot Cabling and the Degree of the Colored Jones Polynomial" (arXiv:1501.01574). Under certain hypothesis on this degree, we determine how…

几何拓扑 · 数学 2015-01-20 Efstratia Kalfagianni , Anh T. Tran

In this paper we discuss an approach to calculate knot polynomials on a photonic processor. Calculations of knot polynomials is a computationally difficult problem and therefore it is interesting to use new advanced calculation methods to…

量子物理 · 物理学 2024-05-07 Ivan Dyakonov , Ilya Kondratyev , Sergey Mironov , Andrey Morozov

This paper computes the Jones polynomial and the invariants obstructing cosmetic surgery which are derived from it for two infinite families of knots, proving they satisfy the Purely Cosmetic Surgery Conjecture. Both the method of…

几何拓扑 · 数学 2026-01-13 F. M. Brady

The Harer-Zagier (HZ) transform maps the HOMFLY-PT polynomial into a rational function. For some special knots and links, the latter admits a simple factorised form, which is referred to as HZ factorisation. This property is preserved under…

数学物理 · 物理学 2025-01-23 Andreani Petrou , Shinobu Hikami

We propose an algorithm which allows to derive the generalized Alexander polynomial invariants of knots and links with the help of the q,p-numbers, appearing in bosonic two-parameter quantum algebra. These polynomials turn into HOMFLY ones…

几何拓扑 · 数学 2015-10-23 Anatoliy M. Pavlyuk

The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…

综合数学 · 数学 2021-09-09 Yitzchak Shmalo

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

数论 · 数学 2021-06-08 J. Maurice Rojas , Yuyu Zhu