On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants

Details On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants

2003-09-08

arxiv.org/abs/quant-ph/0309064v2

New J. Phys. 6 (2004) 167

Physics

Quantum Physics

8 pages, incl. 2 figures. v2: Substantially rewritten

Scientific paper

10.1088/1367-2630/6/1/167

It is shown that the canonical problem of classical statistical thermodynamics, the computation of the partition function, is in the case of +/-J Ising spin glasses a particular instance of certain simple sums known as quadratically signed weight enumerators (QWGTs). On the other hand it is known that quantum computing is polynomially equivalent to classical probabilistic computing with an oracle for estimating QWGTs. This suggests a connection between the partition function estimation problem for spin glasses and quantum computation. This connection extends to knots and graph theory via the equivalence of the Kauffman polynomial and the partition function for the Potts model.

Affiliated with

Also associated with

No associations

Rating

On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-47930