On the quantum complexity of evaluating the Tutte polynomial
From MaRDI portal
Recommendations
- The Jones polynomial: quantum algorithms and applications in quantum complexity theory
- How hard is it to approximate the Jones polynomial?
- On the computational complexity of the Jones and Tutte polynomials
- Approximate Counting and Quantum Computation
- A polynomial quantum algorithm for approximating the Jones polynomial
Cites work
- A modular functor which is universal for quantum computation
- A spanning tree expansion of the Jones polynomial
- Approximate Counting and Quantum Computation
- Hecke algebras of type \(A_ n\) and subfactors
- Inapproximability of the Tutte polynomial
- On the computational complexity of the Jones and Tutte polynomials
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
- q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION
- Simulation of topological field theories by quantum computers
Cited in
(5)- Polynomial degree vs. quantum query complexity
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- scientific article; zbMATH DE number 6351479 (Why is no real title available?)
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
This page was built for publication: On the quantum complexity of evaluating the Tutte polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581162)
