A polynomial quantum algorithm for approximating the Jones polynomial
From MaRDI portal
Publication:5891928
DOI10.1145/1132516.1132579zbMath1301.68129OpenAlexW2093786499WikidataQ56386245 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
approximationunitary representationknotsbraidsJones polynomialTemperley-Lieb algebrapolynomial quantum algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (19)
Hamming Distance Kernelisation via Topological Quantum Computation ⋮ Low depth quantum circuits for Ising models ⋮ Verification of quantum computation and the price of trust ⋮ On upper bounds for toroidal mosaic numbers ⋮ Control aspects of quantum computing using pure and mixed states ⋮ The SWITCH test for discriminating quantum evolutions ⋮ Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$ ⋮ Unnamed Item ⋮ On the degeneracy of \(SU(3)_k\) topological phases ⋮ Optimised resource construction for verifiable quantum computation ⋮ On the exact evaluation of certain instances of the Potts partition function by quantum computers ⋮ Quantum algorithm design: techniques and applications ⋮ Topological aspects of quantum entanglement ⋮ Quantum knots and mosaics ⋮ Braiding, Majorana fermions, Fibonacci particles and topological quantum computing ⋮ Measurement-Based and Universal Blind Quantum Computation ⋮ Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups ⋮ A permanent formula for the Jones polynomial ⋮ Sized Types for Low-Level Quantum Metaprogramming
This page was built for publication: A polynomial quantum algorithm for approximating the Jones polynomial
