A polynomial quantum algorithm for approximating the Jones polynomial
From MaRDI portal
Publication:5891928
DOI10.1145/1132516.1132579zbMath1301.68129WikidataQ56386245 ScholiaQ56386245MaRDI QIDQ5891928
Vaughan F. R. Jones, Zeph A. Landau, Dorit Aharonov
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132579
approximation; unitary representation; knots; braids; Jones polynomial; Temperley-Lieb algebra; polynomial quantum algorithm
81P68: Quantum computation
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
68Q12: Quantum algorithms and complexity in the theory of computing
Related Items
Sized Types for Low-Level Quantum Metaprogramming, Low depth quantum circuits for Ising models, On upper bounds for toroidal mosaic numbers, On the degeneracy of \(SU(3)_k\) topological phases, Topological aspects of quantum entanglement, A permanent formula for the Jones polynomial, On the exact evaluation of certain instances of the Potts partition function by quantum computers, Quantum knots and mosaics, Quantum algorithm design: techniques and applications, Braiding, Majorana fermions, Fibonacci particles and topological quantum computing, Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups, Verification of quantum computation and the price of trust, Control aspects of quantum computing using pure and mixed states, Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$, Optimised resource construction for verifiable quantum computation, Measurement-Based and Universal Blind Quantum Computation
