Related papers: Enumeration on graph mosaics
Quantum computing (QC) is a new computational paradigm whose foundations relate to quantum physics. Notable progress has been made, driving the birth of a series of quantum-based algorithms that take advantage of quantum computational…
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…
We define and study a bigraded knot invariant whose Euler characteristic is the Alexander polynomial, closely connected to knot Floer homology. The invariant is the homology of a chain complex whose generators correspond to Kauffman states…
We discuss how basic notions of graph theory and associated graph polynomials define questions for algebraic geometry, with an emphasis given to an analysis of the structure of Feynman rules as determined by those graph polynomials as well…
Solutions to both the diffeomorphism and the hamiltonian constraint of quantum gravity have been found in the loop representation, which is based on Ashtekar's new variables. While the diffeomorphism constraint is easily solved by…
An open question akin to the slice-ribbon conjecture asks whether every ribbon knot can be represented as a symmetric union. Next to this basic existence question sits the question of uniqueness of such representations. Eisermann and Lamm…
The colored Jones function of a knot is a sequence of Laurent polynomials in one variable, whose n-th term is the Jones polynomial of the knot colored with the n-dimensional irreducible representation of SL(2). It was recently shown by TTQ…
Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…
In this work, we generalize the recently-introduced graph composition framework to the non-boolean setting. A quantum algorithm in this framework is represented by a hypergraph, where each hyperedge is adjacent to multiple vertices. The…
The asymptotic expansion of quantum knot invariants in complex Chern-Simons theory gives rise to factorially divergent formal power series. We conjecture that these series are resurgent functions whose Stokes automorphism is given by a pair…
The quantum density matrix generalises the classical concept of probability distribution to quantum theory. It gives the complete description of a quantum state as well as the observable quantities that can be extracted from it. Its…
We call Krawtchouk-Griffiths systems, or KG-systems, systems of multivariate polynomials orthogonal with respect to corresponding multinomial distributions. The original Krawtchouk polynomials are orthogonal with respect to a binomial…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
Certain quantum topological invariants of three manifolds can be written in the form of the Gaussian sum. It is shown that such topological invariants can be approximated efficiently by a quantum computer. The invariants discussed here are…
The colored Jones function of a knot is a sequence of Laurent polynomials that encodes the Jones polynomial of a knot and its parallels. It has been understood in terms of representations of quantum groups and Witten gave an intrinsic…
In this chapter (Chapter V) we present several results which demonstrate a close connection and useful exchange of ideas between graph theory and knot theory. These disciplines were shown to be related from the time of Tait (if not Listing)…
Quantum entanglement, a cornerstone of quantum mechanics, remains challenging to classify, particularly in multipartite systems. Here, we present a new interpretation of entanglement classification by revealing a profound connection to…
Studies on Quantum Computing have been developed since the 1980s, motivating researches on quantum algorithms better than any classical algorithm possible. An example of such algorithms is Grover's algorithm, capable of finding $k$ (marked)…
In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…