On the quantum computational complexity of the Ising spin glass partition function and of knot invariants

@article{Lidar2004OnTQ,
  title={On the quantum computational complexity of the Ising spin glass partition function and of knot invariants},
  author={D. Lidar},
  journal={New Journal of Physics},
  year={2004},
  volume={6},
  pages={167-167}
}
  • D. Lidar
  • Published 2004
  • Physics, Mathematics
  • New Journal of Physics
  • 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 certain QWGTs. This suggests a connection between the partition function estimation… CONTINUE READING

    Figures from this paper.

    On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
    • 27
    • PDF
    Quantum Commuting Circuits and Complexity of Ising Partition Functions
    • 16
    • PDF
    A new connection between quantum circuits, graphs and the Ising partition function
    • 9
    Efficient quantum processing of three–manifold topological invariants
    • 12
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 93 REFERENCES
    Statistics of Knots and Entangled Random Walks
    • 58
    • PDF
    Topological Quantum Computation
    • 326
    • PDF
    Quantum computing and quadratically signed weight enumerators
    • 36
    Sampling spin configurations of an Ising system
    • 39
    • PDF
    Knots And Physics
    • 648
    • Highly Influential
    Quantum Computing and the Jones Polynomial
    • 21
    • PDF