Related papers: Enumeration on graph mosaics
A knot mosaic is a representation of a knot or link on a square grid using a collection of tiles that are either blank or contain a portion of the knot diagram. Traditionally, a piece of the knot on one tile connects to a piece of the knot…
This is a survey talk on one of the best known quantum knot invariants, the colored Jones polynomial of a knot, and its relation to the algebraic/geometric topology and hyperbolic geometry of the knot complement. We review several aspects…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
Entanglement has evolved from an enigmatic concept of quantum physics to a key ingredient of quantum technology. It explains correlations between measurement outcomes that contradict classical physics, and has been widely explored with…
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…
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 present a conceptually new approach to describe state-of-the-art photonic quantum experiments using Graph Theory. There, the quantum states are given by the coherent superpositions of perfect matchings. The crucial observation is that…
A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…
Knots, links and entangled filaments appear in many physical systems of interest in biology and engineering. Classifying knots and measuring entanglement is of interest both for advancing knot theory, as well as for analyzing large data…
We introduce and explore the notion of texture of an arbitrary quantum state, in a selected basis. In the first part of this letter we develop a resource theory and show that state texture is adequately described by an easily computable…
An elementary introduction to knot theory and its link to quantum field theory is presented with an intention to provide details of some basic calculations in the subject, which are not easily found in texts. Study of Chern-Simons theory…
We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by…
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
Graph states represent a significant class of multi-partite entangled quantum states with applications in quantum error correction, quantum communication, and quantum computation. In this work, we introduce a novel formalism called the…
We present an elementary introduction to one of the most important today knot theory approaches, which gives rise to a representation for a class of knot polynomials in terms of quantum groups. Historically, the approach was at the same…
In 2008, Kauffman and Lomonaco introduce the concepts of a knot mosaic and the mosaic number of a knot or link, the smallest integer $n$ such that a knot or link can be represented on an $n$-mosaic. In arXiv:1702.06462, the authors explore…
The repertoire of problems theoretically solvable by a quantum computer recently expanded to include the approximate evaluation of knot invariants, specifically the Jones polynomial. The experimental implementation of this evaluation,…
The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along…
The theory of bottom tangles is used to construct a quantum fundamental group. On the other hand, the skein module is considered as a quantum analogue of the $SL(2)$ representation of the fundamental group. Here we construct the skein…