Journal article icon

Journal article

The complexity of approximating the complex-valued Potts model

Abstract:

We study the complexity of approximating the partition function of the q-state Potts model and the closely related Tutte polynomial for complex values of the underlying parameters. Apart from the classical connections with quantum computing and phase transitions in statistical physics, recent work in approximate counting has shown that the behaviour in the complex plane, and more precisely the location of zeros, is strongly connected with the complexity of the approximation problem, even for ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1007/s00037-021-00218-x

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
ORCID:
0000-0003-1879-6089
Publisher:
Springer
Journal:
Computational Complexity More from this journal
Volume:
31
Issue:
2021
Article number:
2
Publication date:
2022-02-03
Acceptance date:
2021-11-23
DOI:
EISSN:
1420-8954
ISSN:
1016-3328
Language:
English
Keywords:
Pubs id:
1217339
Local pid:
pubs:1217339
Deposit date:
2021-12-03

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP