A polynomial quantum algorithm for approximating the Jones polynomial

DOI10.1145/1132516.1132579MaRDI QIDQ5891928zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Dorit Aharonov, V. F. R. Jones, Zeph A. Landau

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

zbMATH Keywords

approximationbraidsJones polynomialknotspolynomial quantum algorithmTemperley-Lieb algebraunitary representation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Quantum computation (81P68)

Recommendations

• A polynomial quantum algorithm for approximating the Jones polynomial
• The Jones polynomial: quantum algorithms and applications in quantum complexity theory
• Efficient quantum circuits for approximating the Jones polynomial
• AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
• scientific article; zbMATH DE number 2103527
• The BQP-hardness of approximating the Jones polynomial
• Quantum algorithms and approximating polynomials for composed functions with shared inputs
• Estimating Jones polynomials is a complete problem for one clean qubit
• Polynomials, quantum query complexity, and Grothendieck's inequality
• scientific article; zbMATH DE number 6820205

Cited in

(42)

• Quantum algorithm design: techniques and applications
• Braiding, Majorana fermions, Fibonacci particles and topological quantum computing
• Polynomial approximation of quantum Lipschitz functions
• 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
• How hard is it to approximate the Jones polynomial?
• Quantum circuits and low-degree polynomials over \(\mathbb{F}_2\)
• Optimised resource construction for verifiable quantum computation
• Low depth quantum circuits for Ising models
• Quantum geometry and quantum algorithms
• Efficient quantum circuits for approximating the Jones polynomial
• AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
• The Jones polynomial: quantum algorithms and applications in quantum complexity theory
• Measurement-Based and Universal Blind Quantum Computation
• On the quantum complexity of evaluating the Tutte polynomial
• Estimating Jones polynomials is a complete problem for one clean qubit
• scientific article; zbMATH DE number 5573021 (Why is no real title available?)
• On upper bounds for toroidal mosaic numbers
• On the degeneracy of \(SU(3)_k\) topological phases
• scientific article; zbMATH DE number 6820205 (Why is no real title available?)
• scientific article; zbMATH DE number 2103527 (Why is no real title available?)
• Hamming Distance Kernelisation via Topological Quantum Computation
• Topological quantum information, virtual Jones polynomials and Khovanov homology
• The BQP-hardness of approximating the Jones polynomial
• Sized Types for Low-Level Quantum Metaprogramming
• Approximate Counting and Quantum Computation
• The quantum complexity of computing Schatten p-norms
• A polynomial quantum algorithm for approximating the Jones polynomial
• The SWITCH test for discriminating quantum evolutions
• Variational quantum algorithms: fundamental concepts, applications and challenges
• Quantum algorithm for computing distances between subspaces
• On measuring the topological charge of anyons
• Topological aspects of quantum entanglement
• Finding eigenvectors with a quantum variational algorithm
• Partial blind quantum computation: a framework for selective circuit protection
• High-entanglement capabilities for variational quantum algorithms: the Poisson equation case
• Variational quantum eigensolvers with quantum Gaussian filters for solving ground-state problems in quantum many-body systems
• A permanent formula for the Jones polynomial
• Quantum realization of the finite element method
• On the exact evaluation of certain instances of the Potts partition function by quantum computers
• Quantum knots and mosaics

This page was built for publication: A polynomial quantum algorithm for approximating the Jones polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5891928)