New Approaches to Nuclear Pairing Problem through the Pfaffian and Grassmann Algebra(Research)

Vladimir Zelevinsky, Alexander Volya

Christof Gattringer, Sebastian Jaimungal A, Gordon Walter Semenoff

Starting from the known representation of the partition function of the 2- and 3-D Ising models as an integral over Grassmann variables, we perform a hopping expansion of the corresponding Pfaffian. We show that this expansion is an exact, algebraic representation of the loop- and surface expansions (with intrinsic geometry) of the 2- and 3-D Ising models. Such an algebraic calculus is much simpler to deal with than working with the geometrical objects. For the 2-D case we show that the algebra of hopping generators allows a simple algebraic treatment of the geometry factors and counting problems, and as a result we obtain the corrected loop expansion of the free energy. We compute the radius of convergence of this expansion and show that it is determined by the critical temperature. In 3-D the hopping expansion leads to the surface representation of the Ising model in terms of surfaces with intrinsic geometry. Based on a representation of the 3-D model as a product of 2-D models coupled to an auxiliary field, we give a simple derivation of the geometry factor which prevents overcounting of surfaces and provide a classification of possible sets of surfaces to be summed over. For 2- and 3-D we derive a compact formula for 2n-point functions in loop (surface) representation.

Alexander Volya, Vladimir Zelevinsky, B. ALEX BROWN

German Baumgärtner

Jin‐Yi Cai, Vinay Choudhary, Pinyan Lu

Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this new theory. We give a set of algebraic identities which completely characterizes these objects for arbitrary numbers of inputs and outputs. These identities are derived from Grassmann-Plücker identities. The 4 by 4 matchgate character matrices are of particular interest. These were used in Valiant's classical simulation of a fragment of quantum computations. For these 4 by 4 matchgates, we use Jacobi's theorem on compound matrices to prove that the invertible matchgate matrices form a multiplicative group. Our results can also be expressed in the theory of Holographic Algorithms in terms of realizable standard signatures. These results are useful in establishing limitations on the ultimate capabilities of Valiant's theory of matchgate computations and Holographic Algorithms.

T. Tomoda, Alpar Sevgen