Quantum knots and the number of knot mosaics

DOI10.1007/S11128-014-0895-7zbMATH Open1311.81083arXiv1412.4460OpenAlexW2078799874MaRDI QIDQ2018200FDOQ2018200

Hwa Jeong Lee, Ho Lee, Kyungpyo Hong, Seungsang Oh

Publication date: 13 April 2015

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: Lomonaco and Kauffman developed a knot mosaic system to introduce a precise and workable definition of a quantum knot system. This definition is intended to represent an actual physical quantum system. A knot (m,n)-mosaic is an $mimesn$ matrix of mosaic tiles ($T_0$ through $T_{10}$ depicted in the introduction) representing a knot or a link by adjoining properly that is called suitably connected. $D^{(m,n)}$ is the total number of all knot (m,n)-mosaics. This value indicates the dimension of the Hilbert space of these quantum knot system. $D^{(m,n)}$ is already found for $m,nleq6$ by the authors. In this paper, we construct an algorithm producing the precise value of $D^{(m,n)}$ for $m,ngeq2$ that uses recurrence relations of state matrices that turn out to be remarkably efficient to count knot mosaics. ${\displaystyle }$ D^{(m,n)} = 2 , | (X_{m-2}+O_{m-2})^{n-2} | ${\displaystyle }$ where $2^{m-2}imes{2}^{m-2}$ matrices $X_{m-2}$ and $O_{m-2}$ are defined by ${\displaystyle }$ X_{k+1} = �egin{bmatrix} X_k & O_k \ O_k & X_k end{bmatrix} mbox{and } O_{k+1} = �egin{bmatrix} O_k & X_k \ X_k & 4 , O_k end{bmatrix} ${\displaystyle }$ for $k=0,1,cdots,m-3$, with $1imes1$ matrices $$ and $$. Here $|N|$ denotes the sum of all entries of a matrix $N$. For $n=2$, $(X_{m-2}+O_{m-2}{)}^0$ means the identity matrix of size $2^{m-2}imes{2}^{m-2}$.

Full work available at URL: https://arxiv.org/abs/1412.4460

Recommendations

• Small knot mosaics and partition matrices
• Upper bound on the total number of knot \(n\)-mosaics
• Period and toroidal knot mosaics
• Mosaic number of knots
• Quantum knot mosaics and the growth constant

zbMATH Keywords

enumerationknot mosaicquantum knot

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15)

Cites Work

• A polynomial invariant for knots via von Neumann algebras
• Hecke algebra representations of braid groups and link polynomials
• Estimating Jones polynomials is a complete problem for one clean qubit
• Small knot mosaics and partition matrices
• Quantum knot mosaics and the growth constant
• Upper bound on the total number of knot n-mosaics
• Mosaic number of knots
• Quantum knots and mosaics
• Knots and physics
• On upper bounds for toroidal mosaic numbers
• THE LOMONACO–KAUFFMAN CONJECTURE
• Title not available (Why is that?)
• Mirror-curves and knot mosaics
• Period and toroidal knot mosaics
• Enumeration on graph mosaics
• Title not available (Why is that?)

Cited In (14)

• Maximal independent sets on a grid graph
• Growth rate of quantum knot mosaics
• Counting dissections into integral squares
• Quantum knot mosaics and the growth constant
• Signed mosaic graphs and alternating mosaic number of knots
• Dimer coverings of 1-slab cubic lattices
• Enumeration on graph mosaics
• Period and toroidal knot mosaics
• Enumerating independent vertex sets in grid graphs
• Quantum knot mosaics and bounds of the growth constant
• Domino tilings of the expanded Aztec diamond
• Enumeration of 1-slab lattice links
• State matrix recursion method and monomer-dimer problem
• Number of dominating sets in cylindric square grid graphs

This page was built for publication: Quantum knots and the number of knot mosaics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018200)