We numerically investigate the two-dimensional q-state quantum Potts model on the infinite square lattice by using the infinite projected entangled-pair state (iPEPS) algorithm. We show that the quantum fidelity, defined as an overlap measurement between an arbitrary reference state and the iPEPS ground state of the system, can detect q-fold degenerate ground states for the Z_{q} broken-symmetry phase. Accordingly, a multiple bifurcation of the quantum ground-state fidelity is shown to occur as the transverse magnetic field varies from the symmetry phase to the broken-symmetry phase, which means that a multiple-bifurcation point corresponds to a critical point. A (dis)continuous behavior of quantum fidelity at phase transition points characterizes a (dis)continuous phase transition. Similar to the characteristic behavior of the quantum fidelity, the magnetizations, as order parameters, obtained from the degenerate ground states exhibit multiple bifurcation at critical points. Each order parameter is also explicitly demonstrated to transform under the Z_{q} subgroup of the symmetry group of the Hamiltonian. We find that the q-state quantum Potts model on the square lattice undergoes a discontinuous (first-order) phase transition for q=3 and q=4 and a continuous phase transition for q=2 (the two-dimensional quantum transverse Ising model).
We study the critical behavior of the q-state Potts model with random ferromagnetic couplings. Working with the cluster representation the partition sum of the model in the large-q limit is dominated by a single graph, the fractal properties of which are related to the critical singularities of the random-Potts model. The optimization problem of finding the dominant graph, is studied on the square lattice by simulated annealing and by a combinatorial algorithm. Critical exponents of the magnetization and the correlation length are estimated and conformal predictions are compared with numerical results.
I present a generalization of the Newman-Ziff algorithm, a standard technique in numerical percolation, to the random cluster model. The new method is straightfoward to implement, works for real
q>0, and is completely free of the critical slowdown problem. By using the method to sample the critical polynomial, accurate estimates of Potts critical points can be found using relatively small lattice sizes. Furthermore, results for all values of
q can be found at once within a single simulation. I demonstrate its utility here by computing critical points for non-integer values of
q on the square lattice to compare with the exact solution, and on the non-planar square matching lattice.