### Abstract

Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Knot mosaic theory was introduced by Lomonaco and Kauffman in the paper ‘Quantum knots and mosaics’ to give a precise and workable definition of quantum knots, intended to represent an actual physical quantum system. This paper is inspired by an open question about the knot mosaic enumeration suggested by them. A knot (m, n)-mosaic is an m× n array of 11 mosaic tiles representing a knot or a link diagram by adjoining properly. The total number D_{m}_{,}_{n} of knot (m, n)-mosaics, which indicates the dimension of the Hilbert space of the quantum knot system, is known to grow in a quadratic exponential rate. Recently, the first author showed the existence of the knot mosaic constant δ=limm,n→∞(Dm,n)1mn and proved 4≤δ≤5+132=4.302⋯ by developing an algorithm producing the exact enumeration of knot mosaics, which uses a recursion formula of state matrices. In this paper, we give a simpler proof of the lower bound and improve the upper bound of the knot mosaic constant as4≤δ≤4.113⋯by introducing two new concepts: quasimosaics and cling mosaics.

Original language | English |
---|---|

Article number | 238 |

Journal | Quantum Information Processing |

Volume | 18 |

Issue number | 8 |

DOIs | |

Publication status | Published - 2019 Aug 1 |

### Fingerprint

### Keywords

- Knot mosaic
- Mosaic growth rate
- Quantum knot

### ASJC Scopus subject areas

- Electronic, Optical and Magnetic Materials
- Statistical and Nonlinear Physics
- Theoretical Computer Science
- Signal Processing
- Modelling and Simulation
- Electrical and Electronic Engineering

### Cite this

*Quantum Information Processing*,

*18*(8), [238]. https://doi.org/10.1007/s11128-019-2353-z