Enregistré dans:
Détails bibliographiques
Auteurs principaux: Schmidhuber, Alexander, Reilly, Michele, Zanardi, Paolo, Lloyd, Seth, Lauda, Aaron
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:https://arxiv.org/abs/2501.12378
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909465053233152
author Schmidhuber, Alexander
Reilly, Michele
Zanardi, Paolo
Lloyd, Seth
Lauda, Aaron
author_facet Schmidhuber, Alexander
Reilly, Michele
Zanardi, Paolo
Lloyd, Seth
Lauda, Aaron
contents Khovanov homology is a topological knot invariant that categorifies the Jones polynomial, recognizes the unknot, and is conjectured to appear as an observable in $4D$ supersymmetric Yang--Mills theory. Despite its rich mathematical and physical significance, the computational complexity of Khovanov homology remains largely unknown. To address this challenge, this work initiates the study of efficient quantum algorithms for Khovanov homology. We provide simple proofs that increasingly accurate additive approximations to the ranks of Khovanov homology are DQC1-hard, BQP-hard, and #P-hard, respectively. For the first two approximation regimes, we propose a novel quantum algorithm. Our algorithm is efficient provided the corresponding Hodge Laplacian thermalizes in polynomial time and has a sufficiently large spectral gap, for which we give numerical and analytical evidence. Our approach introduces a pre-thermalization procedure that allows our quantum algorithm to succeed even if the Betti numbers of Khovanov homology are much smaller than the dimensions of the corresponding chain spaces, overcoming a limitation of prior quantum homology algorithms. We introduce novel connections between Khovanov homology and graph theory to derive analytic lower bounds on the spectral gap.
format Preprint
id arxiv_https___arxiv_org_abs_2501_12378
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A quantum algorithm for Khovanov homology
Schmidhuber, Alexander
Reilly, Michele
Zanardi, Paolo
Lloyd, Seth
Lauda, Aaron
Geometric Topology
Quantum Algebra
Quantum Physics
Khovanov homology is a topological knot invariant that categorifies the Jones polynomial, recognizes the unknot, and is conjectured to appear as an observable in $4D$ supersymmetric Yang--Mills theory. Despite its rich mathematical and physical significance, the computational complexity of Khovanov homology remains largely unknown. To address this challenge, this work initiates the study of efficient quantum algorithms for Khovanov homology. We provide simple proofs that increasingly accurate additive approximations to the ranks of Khovanov homology are DQC1-hard, BQP-hard, and #P-hard, respectively. For the first two approximation regimes, we propose a novel quantum algorithm. Our algorithm is efficient provided the corresponding Hodge Laplacian thermalizes in polynomial time and has a sufficiently large spectral gap, for which we give numerical and analytical evidence. Our approach introduces a pre-thermalization procedure that allows our quantum algorithm to succeed even if the Betti numbers of Khovanov homology are much smaller than the dimensions of the corresponding chain spaces, overcoming a limitation of prior quantum homology algorithms. We introduce novel connections between Khovanov homology and graph theory to derive analytic lower bounds on the spectral gap.
title A quantum algorithm for Khovanov homology
topic Geometric Topology
Quantum Algebra
Quantum Physics
url https://arxiv.org/abs/2501.12378