Related papers: Topological quantum computation is hyperbolic
In this article, we give a rough, and so not complete yet, proof of Kashaev's conjecture, that is, the volume conjecture for hyperbolic knots, where the hyperbolicity equations associated to knot diagrams appear as the stationary phase…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
The hyperbolic structure on a 3-dimensional cone-manifold with a knot as singularity can often be deformed into a limiting Euclidean structure. In the present paper we show that the respective normalised Euclidean volume is always an…
Optical knots and links have attracted great attention because of their exotic topological characteristics. Recent investigations have shown that the information encoding based on optical knots could possess robust features against external…
Topological Quantum Field Theories (TQFTs) pertinent to some emergent low energy phenomena of condensed matter lattice models in 2+1 and 3+1D are explored. Many of our field theories are highly-interacting without free quadratic analogs.…
We modify the definition of spherical knotoids to include a framing, in analogy to framed knots, and define a further modification that includes a secondary 'coframing' to obtain 'biframed' knotoids. We exhibit topological spaces whose…
A knot theoretic algorithm is proposed to model `fragile topology' of quantum physics.
Topological quantum field theory (TQFT) is a powerful tool to describe homologies, which normally involve complexes and a variety of maps/morphisms, what makes a functional integration approach with a sum over a single kind of maps…
We present two paradigms relating algebraic, topological and quantum computational statistics for the topological model for quantum computation. In particular we suggest correspondences between the computational power of topological quantum…
Holonomic quantum computation makes use of non-abelian geometric phases, associated to the evolution of a subspace of quantum states, to encode logical gates. We identify a special class of subspaces, for which a sequence of rotations…
We determine when certain state cycles represent nontrivial Khovanov homology classes by analyzing features of the state graph. Using this method, we are able to produce hyperbolic knots with arbitrarily many diagonals containing nontrivial…
Knot theory is an active field of mathematics, in which combinatorial and computational methods play an important role. One side of computational knot theory, that has gained interest in recent years, both for complexity analysis and…
The topological framework of circuit topology has recently been introduced to complement knot theory and to help in understanding the physics of molecular folding. Naturally evolved linear molecular chains, such as proteins and nucleic…
Topological data analysis (TDA) has become an attractive area for the application of quantum computing. Recent advances have uncovered many interesting connections between the two fields. On one hand, complexity theoretic results show that…
We claim that HOMFLY polynomials for virtual knots, defined with the help of the matrix-model recursion relations, contain more parameters, than just the usual $q$ and $A = q^N$. These parameters preserve topological invariance and do not…
Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing…
We introduce an invariant of a hyperbolic knot which is a map $\alpha\mapsto \boldsymbol{\Phi}_\alpha(h)$ from $\mathbb{Q}/\mathbb{Z}$ to matrices with entries in $\overline{\mathbb{Q}}[[h]]$ and with rows and columns indexed by the…
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…
Given a data set with a notion of distance, such as a point cloud in Euclidean space, topological data analysis (TDA) uses techniques from algebraic topology and metric geometry to infer the topology of a hypothetical manifold from which…
While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and…