相关论文: Fast Khovanov Homology Computations
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
We construct an arithmetic analogue of the quantum local systems on the moduli of curves, and study its basic structure. Such an arithmetic local system gives rise to a uniform way of assigning a Galois cohomology class of the first…
Besides offering a friendly introduction to knot homologies and quantum curves, the goal of these lectures is to review some of the concrete predictions that follow from the physical interpretation of knot homologies. In particular, this…
This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
We introduce a Bredon motivic cohomology theory for smooth schemes defined over a field and equipped with an action by a finite group. These cohomology groups are defined for finite dimensional representations as the hypercohomology of…
In this paper we discuss a pair of polynomial knot invariants $\Theta=(\Delta,\theta)$ which is: * Theoretically and practically fast: $\Theta$ can be computed in polynomial time. We can compute it in full on random knots with over 300…
Quantum algorithms can potentially solve a handful of problems more efficiently than their classical counterparts. In that context, it has been discussed that Markov chains problems could be solved significantly faster using quantum…
Khovanov homology for knots has generated a flurry of activity in the topology community. This paper studies the Khovanov type cohomology for graphs with a special attention to torsions. When the underlying algebra is $\mathbb{Z}[x]/(x^2)$,…
Khovanov--Rozansky's HOMFLY homology is determined for all prime knots with up to 11 crossings by direct computations.
We calculate the singular instanton homology with local coefficients for the simplest n-strand braids in $S^1 \times S^2$ for all odd n, describing these homology groups and their module structures in terms of the coordinate rings of…
The purpose of this paper is to construct and study equivariant Khovanov homology - a version of Khovanov homology theory for periodic links. Since our construction works regardless of the characteristic of the coefficient ring it…
We define a class of spaces on which one may generalise the notion of compactness following motivating examples from higher-dimensional number theory. We establish analogues of several well-known topological results (such as Tychonoff's…
Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian…
Recently, there has been a surge of interest for quantum computation for its ability to exponentially speed up algorithms, including machine learning algorithms. However, Tang suggested that the exponential speed up can also be done on a…
Quantum Markov networks are a generalization of quantum Markov chains to arbitrary graphs. They provide a powerful classification of correlations in quantum many-body systems---complementing the area law at finite temperature---and are…
We show that Khovanov homology and Hochschild homology theories share common structure. In fact they overlap: Khovanov homology of a $(2,n)$-torus link can be interpreted as a Hochschild homology of the algebra underlining the Khovanov…
Probabilistic models often have parameters that can be translated, scaled, permuted, or otherwise transformed without changing the model. These symmetries can lead to strong correlation and multimodality in the posterior distribution over…
Simulation of quantum chemistry is expected to be a principal application of quantum computing. In quantum simulation, a complicated Hamiltonian describing the dynamics of a quantum system is decomposed into its constituent terms, where the…
A spectral sequence is established, from Bar-Natan's variant of Khovanov homology to a deformation of instanton homology for knots and links. This spectral sequence arises as a specialization of a spectral sequence from a characteristic-2…