scientific article; zbMATH DE number 5573021

MaRDI QIDQ3636248zbMATH OpenFDO

Authors Stephen P. Jordan, Pawel Wocjan

Publication date 30 June 2009

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

zbMATH Keywords

HOMFLYJones polynomialone clean qubit

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum computation (81P68)

Recommendations

• Estimating Jones polynomials is a complete problem for one clean qubit
• Efficient quantum circuits for approximating the Jones polynomial
• A polynomial quantum algorithm for approximating the Jones polynomial
• A polynomial quantum algorithm for approximating the Jones polynomial
• scientific article; zbMATH DE number 2103527
• The Jones polynomial: quantum algorithms and applications in quantum complexity theory
• Estimation of pure qubits on circles
• AN EFFICIENT QUANTUM ALGORITHM FOR COLORED JONES POLYNOMIALS
• The Power of One Clean Qubit in Communication Complexity
• QUANTUM PHASE ESTIMATION WITH AN ARBITRARY NUMBER OF QUBITS

Cited in

(4)

• Complexity classes as mathematical axioms. II
• Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit
• Estimating Jones polynomials is a complete problem for one clean qubit
• On the degeneracy of \(SU(3)_k\) topological phases

This page was built for publication:

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