The Jones polynomial: quantum algorithms and applications in quantum complexity theory
From MaRDI portal
Publication:3540809
Recommendations
- A polynomial quantum algorithm for approximating the Jones polynomial
- A polynomial quantum algorithm for approximating the Jones polynomial
- How hard is it to approximate the Jones polynomial?
- Estimating Jones polynomials is a complete problem for one clean qubit
- The BQP-hardness of approximating the Jones polynomial
Cited in
(24)- Doubled lattice Chern-Simons-Yang-Mills theories with discrete gauge group
- 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
- Complexity classes as mathematical axioms. II
- How hard is it to approximate the Jones polynomial?
- Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit
- Efficient quantum circuits for approximating the Jones polynomial
- AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
- On the quantum complexity of evaluating the Tutte polynomial
- Estimating Jones polynomials is a complete problem for one clean qubit
- Topology and Quantum Computing
- Unitary representations of the Artin braid groups and quantum algorithms for colored Jones polynomials and the Witten-Reshetikhin invariant
- scientific article; zbMATH DE number 5573021 (Why is no real title available?)
- On the degeneracy of \(SU(3)_k\) topological phases
- scientific article; zbMATH DE number 2103527 (Why is no real title available?)
- The BQP-hardness of approximating the Jones polynomial
- Quantum algorithms for classical lattice models
- Approximate Counting and Quantum Computation
- A polynomial quantum algorithm for approximating the Jones polynomial
- A polynomial quantum algorithm for approximating the Jones polynomial
- A permanent formula for the Jones polynomial
- Graph isomorphism and Gaussian boson sampling
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
This page was built for publication: The Jones polynomial: quantum algorithms and applications in quantum complexity theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540809)
