Estimating Jones polynomials is a complete problem for one clean qubit

zbMath1236.81069arXiv0707.2831MaRDI QIDQ3602386

Peter W. Shor, Stephen P. Jordan

Publication date: 12 February 2009

Full work available at URL: https://arxiv.org/abs/0707.2831

zbMATH Keywords

Jones polynomialone clean qubit

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (14)

Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit ⋮ On upper bounds for toroidal mosaic numbers ⋮ Benchmarking quantum processors with a single qubit ⋮ Anyons in geometric models of matter ⋮ An improved method for quantum matrix multiplication ⋮ Unnamed Item ⋮ The BQP-hardness of approximating the Jones polynomial ⋮ Quantum knots and mosaics ⋮ Quantum knots and the number of knot mosaics ⋮ Quantum circuits cannot control unknown operations ⋮ Growth rate of quantum knot mosaics ⋮ Period and toroidal knot mosaics ⋮ Enumeration on graph mosaics ⋮ Complexity classes as mathematical axioms. II

This page was built for publication: Estimating Jones polynomials is a complete problem for one clean qubit