On the exact evaluation of certain instances of the Potts partition function by quantum computers

DOI10.1007/s00220-008-0438-0zbMath1200.82007arXivquant-ph/0703023MaRDI QIDQ926258

Daniel A. Lidar, Joseph Geraci

Publication date: 27 May 2008

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0703023

Mathematics Subject Classification ID

81P68: Quantum computation

82B23: Exactly solvable models; Bethe ansatz

82B20: Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics

94B15: Cyclic codes

Related Items

A new connection between quantum circuits, graphs and the Ising partition function, Classical spin systems and the quantum stabilizer formalism: General mappings and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting points on \(C_{ab}\) curves using Monsky-Washnitzer cohomology
• On knot invariants related to some statistical mechanical models
• Topological quantum field theory
• Exact Potts model partition function on strips of the triangular lattice
• Simulation of topological field theories by quantum computers
• Hasse-Davenport curves, Gauss sums, and weight distributions of irreducible cyclic codes
• A categorification of the Jones polynomial
• Quantum computation of zeta functions of curves
• On Some Polynomials Related to Weight Enumerators of Linear Codes
• q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION
• Is the class of cyclic codes asymptotically good?
• A polynomial invariant for knots via von Neumann algebras
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the computational complexity of the Jones and Tutte polynomials
• Topological quantum computation
• Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
• Weights of irreducible cyclic codes
• A polynomial quantum algorithm for approximating the Jones polynomial
• Coding and Cryptography