Estimating Jones polynomials is a complete problem for one clean qubit

zbMATH Open1236.81069arXiv0707.2831MaRDI QIDQ3602386FDOQ3602386

Authors: Peter W. Shor, Stephen P. Jordan 

Publication date: 12 February 2009

Abstract: It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maximally mixed state. One clean qubit computers are believed to be strictly weaker than standard quantum computers, but still capable of solving some classically intractable problems. Here we show that evaluating a certain approximation to the Jones polynomial at a fifth root of unity for the trace closure of a braid is a complete problem for the one clean qubit complexity class. That is, a one clean qubit computer can approximate these Jones polynomials in time polynomial in both the number of strands and number of crossings, and the problem of simulating a one clean qubit computer is reducible to approximating the Jones polynomial of the trace closure of a braid.

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

Recommendations

• scientific article
• The Jones polynomial: quantum algorithms and applications in quantum complexity theory
• 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?

zbMATH Keywords

Jones polynomialone clean qubit

Mathematics Subject Classification ID

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

Cited In (20)

• Power of quantum computation with few clean qubits
• Title not available (Why is that?)
• Growth rate of quantum knot mosaics
• Complexity classes as mathematical axioms. II
• Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit
• The BQP-hardness of approximating the Jones polynomial
• The Jones polynomial: quantum algorithms and applications in quantum complexity theory
• The quantum complexity of computing Schatten \(p\)-norms
• Quantum knots and mosaics
• Enumeration on graph mosaics
• Period and toroidal knot mosaics
• Approximate Counting and Quantum Computation
• A polynomial quantum algorithm for approximating the Jones polynomial
• Benchmarking quantum processors with a single qubit
• An improved method for quantum matrix multiplication
• Quantum knots and the number of knot mosaics
• Anyons in geometric models of matter
• On upper bounds for toroidal mosaic numbers
• Quantum knot mosaics and bounds of the growth constant
• Quantum circuits cannot control unknown operations

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

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