On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers

@article{Geraci2008OnTE,
  title={On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers},
  author={Joseph Geraci and D. Lidar},
  journal={Communications in Mathematical Physics},
  year={2008},
  volume={279},
  pages={735-768}
}
  • Joseph Geraci, D. Lidar
  • Published 2008
  • Mathematics, Physics
  • Communications in Mathematical Physics
    • We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is related to the evaluation of the Jones and Tutte polynomials. We consider the connection between the weight enumerator polynomial from coding theory and Z and exploit the fact that there exists a quantum algorithm for efficiently estimating Gauss sums in order to… CONTINUE READING
    View on Springer
    cds.cern.ch
    27 Citations
    Background Citations
    4
    Methods Citations
    1

    Figures from this paper

    Figures

    27 Citations
    Citation Type

    Citation Type

    A theorem on the quantum evaluation of Weight Enumerators for a certain class of Cyclic Codes with a note on Cyclotomic cosets
    • 2
    • PDF
    Classical Ising model test for quantum circuits
    • 20
    • PDF
    Quantum Algorithms Beyond the Jones Polynomial
    • 1
    • PDF
    On the study of the Potts model, Tutte and Chromatic Polynomials, and the Connections with Computation Complexity and Quantum Computing
    • PDF
    Quantum algorithms for classical lattice models
    • 28
    • PDF
    Low Depth Quantum Circuits for Ising Models
    • 9
    • PDF
    Quantum algorithms for spin models and simulable gate sets for quantum computation
    • 34
    • PDF
    Possible quantum algorithms for the Bollobas-Riordan-Tutte polynomial of a ribbon graph
    • 2
    Completeness of classical spin models and universal quantum computation
    • 14
    • PDF
    Classical spin systems and the quantum stabilizer formalism: General mappings and applications
    • 7
    • PDF

    References

    SHOWING 1-10 OF 61 REFERENCES
    Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane
    • 66
    • Highly Influential
    • PDF
    On the quantum computational complexity of the Ising spin glass partition function and of knot invariants
    • 22
    • PDF
    The Jones polynomial: quantum algorithms and applications in quantum complexity theory
    • 77
    • PDF
    On the Weights of Binary Irreducible Cyclic Codes
    • 18
    • PDF
    On Some Polynomials Related to Weight Enumerators of Linear Codes
    • A. Barg
    • Mathematics, Computer Science
    • SIAM J. Discret. Math.
    • 2002
    • 8
    • PDF
    Quantum computation of zeta functions of curves
    • 27
    • PDF
    A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
    • 153
    • PDF
    Topological Quantum Computation
    • 410
    • PDF
    $q$ - Deformed Spin Networks, Knot Polynomials and Anyonic Topological Quantum Computation
    • 74
    • PDF
    Exact Potts Model Partition Functions on Ladder Graphs
    • 59
    • Highly Influential
    • PDF