Estimating Jones and HOMFLY polynomials with One Clean Qubit

Representations of Groups

H. Boerner · 1963

Earlier work this paper cites.

A polynomial invariant for knots via von Neumann algebras

Vaughan F. R. Jones · 1985

Earlier work this paper cites.

Quantum field theory and the Jones polynomial

Edward Witten · 1989

Earlier work this paper cites.

On the computational complexity of the Jones and Tutte polynomials

F. Jaeger, D. L. Vertigan, and D. J. A. Welsh · 1990

Earlier work this paper cites.

Power of one bit of quantum information

E. Knill and R. Laflamme · 1998

Earlier work this paper cites.

The computational complexity of knot and link problems

Joel Hass, Jeffrey Lagarias, and Nicholas Pippenger · 1999

Earlier work this paper cites.

A modular functor which is universal for quantum computation

Michael Freedman, Michael Larsen, and Zhenghan Wang · 2000

Earlier work this paper cites.

Quantum Computation and Quantum Information

Michael A. Nielsen and Isaac L. Chuang · 2000

Cited alongside, same era.

Quantum computating and quadratically signed weight enumerators

E. Knill and R. Laflamme · 2001

Cited alongside, same era.

The two-eigenvalue problem and density of Jones representation of braid groups

M. H. Freedman, M. J. Larsen, and Z. Wang · 2002

Cited alongside, same era.

Simulation of topological field theories by quantum computers

Michael Freedman, Alexei Kitaev, and Zhenghan Wang · 2002

Cited alongside, same era.

Exponential speedup with a single bit of quantum information: Measuring the average fidelity decay

David Poulin, Robin Blume-Kohout, Raymond Laflamme, and Harold Ollivier · 2004

Cited alongside, same era.

Entanglement and the power of one qubit

Animesh Datta, Steven T. Flammia, and Carlton M. Caves · 2005

The BQP-hardness of approximating the Jones polynomial

Dorit Aharonov and Itai Arad · 2006

Later among the works it cites.

A polynomial quantum algorithm for approximating the Jones polynomial

Dorit Aharonov, Vaughan Jones, and Zeph Landau · 2006

Later among the works it cites.

Computing with highly mixed states

Andris Ambainis, Leonard Schulman, and Umesh Vazirani · 2006

Later among the works it cites.

Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane

Dorit Aharonov, Itai Arad, Elad Eban, and Zeph Landau · 2007

Later among the works it cites.

Estimating Jones polynomials is a complete problem for one clean qubit

Original

Peter W. Shor and Stephen P. Jordan · 2008

Closest in time.

The Jones polynomial: quantum algorithms and applications in quantum complexity theory