| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants | Daniel A. Lidar
; | Date: |
8 Sep 2003 | Journal: | New J. Phys. 6 (2004) 167 DOI: 10.1088/1367-2630/6/1/167 | Subject: | Quantum Physics; Mathematical Physics | quant-ph cond-mat math-ph math.MP | Affiliation: | Center for Quantum Information and Quantum Control, University of Toronto | Abstract: | 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. | Source: | arXiv, quant-ph/0309064 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |