The complexity of approximating complex-valued Ising and Tutte partition functions
We study the complexity of approximately evaluating the Ising and Tutte partition functions with complex parameters. Our re- sults are partly motivated by the study of the quantum complexity classes BQP and IQP. Recent results show how to encode quantum computations as evaluations of classical parti...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Springer Verlag
2017
|