The BQP-hardness of approximating the Jones Polynomial

@article{Aharonov2006TheBO,
  title={The BQP-hardness of approximating the Jones Polynomial},
  author={D. Aharonov and I. Arad},
  journal={ArXiv},
  year={2006},
  volume={abs/quant-ph/0605181}
}
  • D. Aharonov, I. Arad
  • Published 2006
  • Computer Science, Physics
  • ArXiv
  • A celebrated important result due to Freedman et al (2002 Commun. Math. Phys. 227 605–22) states that providing additive approximations of the Jones polynomial at the kth root of unity, for constant k=5 and k≥7, is BQP-hard. Together with the algorithmic results of Aharonov et al (2005) and Freedman et al (2002 Commun. Math. Phys. 227 587–603), this gives perhaps the most natural BQP-complete problem known today and motivates further study of the topic. In this paper, we focus on the… CONTINUE READING
    69 Citations
    How Hard Is It to Approximate the Jones Polynomial?
    • 53
    • PDF
    A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
    • 153
    • PDF
    Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane
    • 66
    • PDF
    BQP-complete Problems Concerning Mixing Properties of Classical Random Walks on Sparse Graphs
    • 12
    • PDF
    The Complexity of Approximating complex-valued Ising and Tutte partition functions
    • 37
    • PDF
    Estimating Jones polynomials is a complete problem for one clean qubit
    • 85
    • Highly Influenced
    • PDF
    A Simple PromiseBQP-complete Matrix Problem
    • 16
    • PDF
    The quantum FFT can be classically simulated
    • 41
    • PDF

    References

    SHOWING 1-10 OF 44 REFERENCES
    A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
    • 153
    • PDF
    The Jones polynomial: quantum algorithms and applications in quantum complexity theory
    • 77
    • PDF
    P/NP, and the quantum field computer
    • M. Freedman
    • Mathematics, Computer Science
    • Proc. Natl. Acad. Sci. USA
    • 1998
    • 117
    • PDF
    Inapproximability of the Tutte polynomial
    • 23
    • PDF
    Several natural BQP-Complete problems
    • 20
    • PDF
    Estimating Jones polynomials is a complete problem for one clean qubit
    • 85
    • PDF
    A Simple PromiseBQP-complete Matrix Problem
    • 16
    • PDF