Approximate dual representation for Yang-Mills SU(2) gauge theory

An approximate dual representation for non-Abelian lattice gauge theories in terms of a new set of dynamical variables, the plaquette occupation numbers (PONs) that are natural numbers, is discussed. They are the expansion indices of the local series of the expansion of the Boltzmann factors for every plaquette of the Yang-Mills action. After studying the constraints due to gauge symmetry, the SU(2) gauge theory is solved using Monte Carlo simulations. For a PONs configuration the weight factor is given by Haar-measure integrals over all links whose integrands are products of powers of plaquettes. Herein, updates are limited to changes of the PON at a plaquette or all PONs on a coordinate plane. The Markov chain transition probabilities are computed employing truncated maximal trees and the Metropolis algorithm. The algorithm performance is investigated with different types of updates for the plaquette mean value over a large range of $\beta$s. Using a $12^4$ lattice very good agreement with a conventional heath bath algorithm is found for the strong and weak coupling limits. Deviations from the latter being below 0.1% for $2.5<\beta<3$. The mass of the lightest $J^{PC}=0^{++}$ glueball is evaluated and reproduces the results found in the literature.


Introduction
The computation of the properties of strongly-interacting matter directly from Quantum Chromodynamics (QCD) remains a challenging problem. For matter at zero baryon density, Monte Carlo lattice QCD simulations are currently used to address both zero and finite temperature [1]. On the other hand, the investigation of dense quark matter, as required for example to study the structure of atomic nuclei and neutron a e-mail: rrleme@ift.unesp.br b e-mail: orlando@teor.fis.uc.pt c e-mail: gkrein@ift.unesp.br stars, the quark-gluon plasma produced in heavy ion collisions, and the matter that existed in the early stages of the Universe, is still an open problem for lattice QCD simulations due to algorithmic limitations. Indeed, the investigation of such systems, e.g. in the grand canonical ensemble, demands the introduction of a finite chemical potential µ in the partition function of the theory. The baryon chemical potential turns the Euclidean action into a complex-valued function and the integration measure in the path integral of the partition function is no longer positive definite, giving rise to the so-called sign problems, and thereby limiting the use of Monte Carlo techniques with importance sampling. For sufficiently small values of µ, the study of dense systems can still rely on importance sampling when combined with re-weighting [2,3]. However, in general, the handling of complex actions requires the introduction of new sampling techniques as, for example, the direct sampling of the density of states or a mapping of the theory into new variables such that one recovers a positive Boltzmann factor; in this latter approach, the theory reformulated in terms of the new variables is called the dual theory -Ref. [4] provides a recent review on these methods for lattice field theories. The mapping of a given theory into its dual has been used to overcome sign problems appearing in different fields [5].
In lattice QCD in the strong coupling limit, sign problems can be avoided by mapping the theory into a dual representation, using new "dual variables", after the integration of the gauge fields prior to the integration of the fermion fields [6][7][8]. The gauge symmetry of the original theory imposes constraints on the new set of dual variables which, nevertheless, can be handled via generalizations of the original Prokof'ev-Svistunov worm algorithm [9].
Another example of a dual representation of QCD is the effective theory introduced in Ref. [10], where the fundamental degrees of freedom are the Polyakov loops defined in the group Z(3). This effective theory can be derived from QCD in the strong coupling limit, by restricting the non-Abelian gauge degrees of freedom to the center of the group SU(3), i.e. to the group Z(3), and performing a hopping expansion in the quark sector. The action of the Z(3) effective theory inherits a sign problem from QCD. However, after rewriting the original partition function in terms of dual variables, it becomes a sum of real and positive Boltzmann weights [11]. The dual variables are dimers, that are attached to the lattice links, and monomers, that are attached to the lattice sites. In the dual representation, the complex nature of the original action is washed out [11]. Symmetries of the original theory appear, again, as constraints on the dual variables of the reformulated theory that can be handled with the use of a generalized worm algorithm.
In recent years several other interesting QCD-related theories were studied using dual representations. Theories with O(N) and CP(N-1) symmetries, which, like QCD, are asymptotically free, were investigated with dual representations at zero [12,13] and finite density [14]. Strongly interacting fermionic theories, relevant for graphene [15] and also for particle physics, were investigated with the fermion bag approach [16][17][18][19], in which a dual representation can be built after a suitable integration of the fermionic degrees of freedom. By combining strong coupling and hopping-parameter expansions, an effective theory [20] in the dual representation free of sign problems is obtained. Scalar field theories have also been successfully mapped into dual representations, see e.g. Refs. [21][22][23][24][25].
In what concerns gauge field theories, dual representations were implemented for pure Abelian U(1) theory [26,27], Higgs-U(1) theory [28,29], and U(1) Abelian theory with fermion fields [30]. For pure SU(N) lattice gauge theory a dual representation was suggested recently in Ref. [31], where the dual variables are random Gaussian matrices introduced by recursive applications of the Hubbard-Stratonovich transformation [32]. Recently, a dual representation for non-Abelian gauge theories was suggested in Refs. [33][34][35], in which the partition function for the dual theory is given by a sum of positive and negative terms, which prevents the use of Monte Carlo simulations with importance sampling to solve the theory.
In the present work we discuss a new approximate dual representation for pure non-Abelian gauge theories. Starting from the partition function written in terms of the Wilson action, we expand the Boltzmann exponential factor of a single plaquette as a power series. The expansion indices of each plaquette, b µν (x) ∈ N 0 , where N 0 is the set of natural numbers, after integrating over the gauge fields, play the role of dynamical variables. The Boltzmann weights become functions of the dual variables b µν (x), and a Metropolis-type algorithm can be built. The transition probabilities of the corresponding Markov chain are ratios between these weights. In the new representation of the non-Abelian gauge theory, the weights are computed using the Haar-measure integrals involving the link variables. The integration over the links is a non-trivial problem per se as each link is coupled to all links in the entire lattice. For the numerical experiment, we make approximations in the integration over the link fields to estimate the transition probability defining the Markov chain and thus generate ensembles of the dual variables b µν (x) .
The work reported herein investigates the pure SU(2) Yang-Mills gauge theory. Although the boson sector of a gauge theory does not suffer from the sign problem, our goal is to test a new algorithm/representation of a gauge theory to study strong interactions. The natural development of the ideas discussed herein are both the inclusion of matter fields to simulate the full theory and the improvement in the approximations considered. The rationale used here to build a new dual representation can, in principle, be extended to the fermionic sector. The full theory requires the use of an enlarged set of dynamical variables, defined after the expansion of the partition function. Furthermore, the constraints in the corresponding dual theory due to the gauge symmetry are of the same type as those for the pure Yang-Mills theory. On the other hand, the integration over the link fields requires a new analysis.
We test our algorithm by computing the plaquette mean value, related to the energy density of the pure gauge system, over a large range of the lattice coupling constant β and the mass of the (expected) lightest scalar glueball state (J PC = 0 ++ ). Our results show that the plaquette mean value obtained with the algorithm developed here deviates, in the worst case, by less than 0.1% when compared with a standard heat bath simulation for β ∈ [0, 4.5]. The mass of the lightest glueball agrees well with previous lattice estimates [36][37][38][39][40][41][42] and also with estimates based on a gauge-gravity duality model [43].
Our paper is organized as follows. In the next section we present our approximate dual representation for the non-Abelian Yang-Mills theory. In Sec. 3 we discuss the constraints on the dual variables due to gauge symmetry which determine the types of updates that must be considered in a algorithm approach to solve the theory. In Sec. 4 we discuss the Monte Carlo algorithm used in our approach. We also present strategies to decouple a region from the entire lattice surrounding a dual variable to be updated locally. In the factorized region, the group integrals are done analytically. Still in Sec. 4 we show how to implement one possible type of nonlocal update. In Sec. 5 we show how to represent the observables to be measured in terms of the dual variables. In Sec. 6 we give the details of the simulations and report the numerical data for the observables measured. A summary in Sec. 7 completes the paper.

Approximate dual representation for lattice Yang-Mills theory
The lattice formulation of pure Yang-Mills theory uses as fundamental fields the link variables U µ (x), which belong to the gauge group SU(N). We consider the standard Wilson action [44]: with the plaquette U µν (x) given by the product of link variables where the spacetime indices µ and ν run from 1 to d, with d being the dimension of the Euclidean space, and x runs over the lattice volume V . The partition function of the theory is given by where DU = ∏ x,µ dU µ (x) is the Haar measure for the gauge links, C = exp −β N V p −1 is a normalization factor and V p is the number of plaquettes in the volume V . Given an operator O(U), its vacuum expectation value is represented by the functional integral In the traditional lattice approach, this expectation value is estimated by the average where the set of configurations U = {U (i) , i = 1, · · · , N con f }, distributed according to exp{−S[U]}, is produced with a Monte Carlo algorithm. The statistical error associated with such an estimate scales with the number of configurations as N −1/2 con f . The simulation of Yang-Mills theory with a dual representation demands rewriting the partition function in Eq. (3) in terms of a new set of dynamical variables other than the links. In order to be able to apply such a type of algorithm, let us expand the exponentials appearing in the partition function in powers of β where we have discarded for the moment the global factor C.
Performing the integration over the link variables, i.e. computing the integral´DU, Z can then be viewed as a function of the discrete set of variables b µν (x), which are natural numbers. Let us introduce the notation so that the partition function can be written as where , that complies with the principle of detailed balance and ensures the convergence of the Markov chain to the right probability distribution. Before dealing with the details of the update, let us discuss the constraints on b µν (x) due to the group integration over the link variables.
3 Constraints on the dual variables b µν (x) Herein we discuss the constraints on the b µν (x) when groupintegrating over the gauge links. The results and the group integrations discussed below can, in principle, be extended to SU(N) but we restrict our analysis to SU (2). The main properties and results for the group integration required to understand the current work are summarized in the Appendix A.
Let us consider the plaquette defined on the (µ 0 , ν 0 ) plane, see Fig. 1, where U l with l = 1, · · · , 4 stands for a generic link and l is a composite index taking values in the set: Let A i be the staple that together with the link variable U i defines a plaquette in the (µ 0 , ν 0 ) plane which shares with U µ 0 ν 0 (x 0 ) the link U i -see Fig. 1. In the following, to simplify the notation, we will write b l for the dynamical variable Fig. 1 Representation of the (µ 0 , ν 0 ) lattice plane. The gauge links are shown as arrows. The "central plaquette" U µ 0 ν 0 (x 0 ) = U 1 U 2 U 3 U 4 (in solid red arrows) and the plaquettes which contain any of the links appearing in U µ 0 ν 0 (x 0 ). A i are the staples (in non-solid black lines), defined in the (µ 0 , ν 0 ) plane, required to complete the neighboring plaquettes besides the links in the "central plaquette". that is associated with the plaquette containing the staple A l , i.e. the staple in the plane (µ 0 , ν 0 ) that is associated with the link U l . The weight function Q associated with the plaquettes represented in Fig. 1 is The properties of the group integration are such that most of the possible sets {b} have a null weight and do not contribute to the partition function. The non-vanishing contributions are those where a given link variable U l , with l = (µ, x), appears n l times in the integrand, with n l being a multiple of N, where N is the number of colors. Consider, for example, the link variable U 2 in Eq. (12): it appears b 0 + b 2 = n 2 times in the integrand, i.e.
and this gives a non-vanishing contribution to Q {U} [{b}] only if n 2 = b 0 + b 2 is a multiple of N. This implies that b 0 and b 2 are either multiples of N or their sum is a multiple of N, despite (b 0 mod N) = 0 and (b 2 mod N) = 0. In four dimensions, the link U 2 belongs to the plaquettes represented in Fig. 1 and also to plaquettes belonging to orthogonal planes not shown in the figure. Therefore, for a generic link U µ (x), it follows that the sum over the set {b µν (x)} that count the number of times U µ (x) appears in the integral in Eq. (12) is given by and only those {b µν (x)} configurations such that all {n µ (x)} are multiples of N contribute to the partition function, i.e.
This is a non trivial constraint that also simplifies the analysis of the possible sets of updates that can appear within a Markov chain.

Update Algorithm
A possible local update compatible with Eq. (15) replaces b µν (x) → b µν (x) ± ∆ , with ∆ being a multiple of N. In this way, if the original configuration {b µν (x)} verifies the constraint in Eq. (15), the new configuration is also compatible with Eq. (15). On the other hand, if (∆ mod N) = 0, then to fulfil Eq. (15) at all lattice points, one has to change the b values in the neighboring points accordingly and, therefore, in the next neighboring points and so on and so forth. The updates where ∆ is not an integer multiple of N requires a global update over a finite region of the lattice. An ergodic algorithm must access all possible b values and, therefore, requires the use of both local and nonlocal updates. If, for example, the Markov chain is initiated setting all PON such that (b µν (x) mod N) = 0 and only local updates are implemented, i.e. a given b is modified by adding an integer multiple of N, configurations where all PONs of a given plane are not multiples of N cannot be reached and, therefore, the update does not verify the ergodicity requirement.
To ensure convergence to the right probability distribution, one needs to set a detailed balance equation compatible with Eq. (15). Our implementation chooses randomly a b or a set of b's and proposes new values b . As usual in algorithms of this kind, the transition probability for accepting the new b is given by which is enough to ensure that the sampling reproduces the correct distribution probability [45]. The computation of the weight function Q requires integration over the link variables, for all possible PONs configurations, which per see is a difficult problem. The Haar measure for the group integration is invariant under gauge transformations and this allows rotating the links and, eventually, replace some of them by the identity in the evaluation of the Q[{b}] functions. In particular, a path in which the maximal number of links allowed by the group integration are rotated to the identity defines what is known as a "maximal tree" [46]. Our proposal consists in, given a b µν (x) variable to be updated, performing an exact integration of the gauge links in the neighborhood of the plaquette U µν (x). In order to be able to compute the transition probability p we set a small number of links to the identity matrix and, in this way, decouple a region with links "close" to the b µν (x) variable to be updated and a region with the remaining "distant" links. The transition probability for accepting the new value p is given by the ratio between weight functions and, therefore, the integration of the "distant" links cancels out and we need consider only the contributions of the links that are closer to the plaquette associated with b µν (x). The replacement of a small subset of link variables by the identity matrix is clearly an approximation, but it enables to perform group integrations analytically.

Local update
To illustrate our update scheme, let us start considering the crudest approximation possible in the local update of a given plaquette occupation number, say b µ 0 ν 0 (x 0 ), associated with the central plaquette represented in Fig. 1, i.e. replace all the staples that are connected with U ν 0 (x 0 ) (the link U 4 in the figure) by the identity. Then, the integration over U ν 0 (x 0 ) is decoupled from the integrations over the remaining links and where n 0 = n ν 0 (x 0 ) is calculated from Eq. (14), and Q {b} is independent of the link U ν 0 (x 0 ). In this way, the transition probability of the local update of the where To improve on the estimation of p, couplings of U ν 0 (x 0 ) to neighboring links need to be considered. A possible next level of approximation is to set all the staples associated with U ν 0 (x 0 ) to the identity with exception of g = U 1 U 2 U 3 (see Fig. 1), then where and Q {b} is the group integral over all the lattice links except for U ν 0 (x 0 ). Now, since Q {b} and the integral in Eq. (20) share the links U 1 , U 2 , and U 3 , they do not decouple and this would not allow us to obtain a number for the transition probability p. However, as we shall discuss in the next two subsections, one can still devise a strategy that allows us to integrate over U ν 0 (x 0 ) taking into account couplings with neighboring links, so that under a local update b old 0 → b new 0 , the transition probability is the positive real number given by where F contains through U a subset of all links U µ (x) of the lattice that are integrated, and B stands for the PONs associated with the PON b 0 which is being updated. The Monte Carlo updates considered in the present work approximate ratios of weight functions Q following the strategy just discussed. The integration of the functions F all give positive definite answers and, thus, the approximate ratio between the dual Boltzmann weights Q to estimate the transition probability p is also a positive real number.

Integration over a short path
Let us consider Fig. 1 and the central plaquette associated with the dual variable b 0 = b µ 0 ν 0 (x 0 ). The links belonging to this plaquette (solid red arrows) also contribute to the staples Recall that the aim is to update b 0 and compute the transition probability p.
A maximal tree can be built by rotating some, but not all, staples associated with the links U i in the plaquette U µ 0 ν 0 (x 0 ) to the identity matrix. However, assuming that all the links in A i can be set to the identity, the group integration can be factorized and one has to consider only the following integrating function with the integration measure given by The set U = {U 1 ,U 2 ,U 3 ,U 4 } contains the link variables to be integrated. The set B contains the PONs that couple the plaquette U µ 0 ν 0 (x 0 ) with the neighboring plaquettes and in two dimensions For a generic dimensionality, the set B contains the PONs that define the powers c i in Eq. (23), i.e.
Let us now discuss the integration of F 4 with the measure DU 4 defined in Eq. (24). The integration over the links of the central plaquette can be started by picking any of the links and for the function F 4 one can reduce the integration to where U and g are SU(2) matrices. Integrals of this type have been computed in Ref. [47]; they are given by For a non-vanishing result, the condition 2q = b + c must be fulfilled. The integral I 1 is a polynomial in Tr [g], i.e.
where min(b, c) stands for the minimum of b and c, and the coefficients Γ b,c q are given by and %2 returns the remainder of the integer division by 2. The Kronecker delta in Eq. (33) indicates that the polynomial in Eq. (32) contains only odd or even powers of q.
The evaluation of I 1 is a first step towards the evaluation of the weights Q. In our code the expression given in Eq. (32) was used directly. The routine to compute I 1 was checked against a numerical evaluation of I 1 for a number of cases and both results agreed within machine precision. The integral I 1 , given in Eq. (32), can be used recursively to perform the integration of Eq. (23): Once the coefficients Γ b,c q are known, one can get an approximate estimation for the weights Q and also for the transition probability p which is defined in the Markov chain.
In principle, the calculation of the weights can be improved by considering more complex integrations over the gauge links as, for example: However, the coding of this type of solutions in a Monte Carlo simulation is rather complex and will not be pursued here. Alternatively and keeping the same rationale as described so far, one can explore integrations over more complex paths on the lattice.

Integration over a long path
The method described in the previous section can be extended to more complex and longer lattice paths. From the practical point of view, one has to compromise the length and complexity of the path to perform the group integration with the coding of the outcome of group integration. Next, we consider an integration over the link variables which takes into account a larger set of links that are decoupled from the remaining lattice. In Fig. 2 we show, in color, the links to be integrated in the computation of the probability transition p. To avoid clutter, we do not draw all links to be integrated exactly. In particular, the links corresponding to the fourth dimension are not represented in the figure. For the path represented in Fig. 2, the links represented by solid red lines, which belong to the central plaquette U µ 0 ν 0 (x 0 ), are integrated exactly together with those represented by double blue lines and by triple green lines.
The links in double blue lines are in the same plane as U µ 0 ν 0 (x 0 ) and their integration involves terms which include the links of the central plaquette. For example, the integrals referring to the links belonging to the plaquettes U µ 0 ν 0 (x 0 ) and U µ 0 ν 0 (x 2 ) are not independent as these staples share U µ 0 (x 2 ). The same applies to the links belonging to the plaquettes U µ 0 ν 0 (x 3 ) and U µ 0 ν 0 (x 4 ), whose staples share . Also, the integration over the links in the (µ, ν 0 ) plane are not independent of the integration of links in parallel planes as those represented by triple green lines. In our integration over the longer path, we will consider four greentype paths which belong to the upper parallel plane shown in In the computation of the weights Q and of the probability transition p the link variables represented in red (central plaquette with solid lines), blue (double lines) and green (triple lines) in Fig. 2 are integrated exactly. Each of these link variables is coupled with 2 (d − 1) staples which belong to 2 (d − 1) plaquettes. With the exception of the red, blue, and green links, all staples associated with the links which are going to be integrated are rotated to the identity matrix. In Fig. 2 the solid lines in gray represent the link variables that are being fixed to the identity matrix in the plane (µ 0 , ν 0 ). As in the integration described in Sec. 4.1.1, we are not building an exact maximal tree. Indeed, there are closed paths whose links are all set to the identity. The approximation used to perform the group integrations factorizes a local region, which is decoupled from the remaining lattice, and, in this way, allows for an exact group integration in each of the regions considered. Furthermore, it factorizes the calculation of the weights Q, which enables an easy estimation of the transition probability p.
Let us now discuss on how to integrate over the link variables in color in Fig. 2. In principle one can choose to start the integration by considering any of the colored links. However, we found that starting the integration by the links in green or the links in blue and only then performing the integration of the links belonging to the central plaquette U µ 0 ν 0 (x 0 ) simplifies considerably the integration process. For the integration over a path that is coupled with the link U µ (x) of the central plaquette, one can rely on the result given in Eq. (32) applied recursively. The outcome is a polynomial whose coefficients λ k are combinations of the coefficients Γ and are functions of the plaquette occupation numbers of the region surrounding the integrated path. For the group integration, every link belonging to the central plaquette is coupled with two different paths, namely, the path in green which has four links and the path in blue with five links. The total number of links to be integrated is now forty and for this larger integration we define F 40 [U , B, b 0 ] as being the local function of the approximate weight function ratio, see Eq. (22). The set of links U contains all the forty gauge links to be integrated and the set of the plaquette occupation numbers B include the b µν (x) whose links are in the integrated paths. Recall that for the simpler integration discussed previously a similar situation is found. The formal expression for F 40 [U , B, b 0 ] includes the central plaquette U µ 0 ν 0 (x 0 ) and four polynomials, one for each link variable U l ∈ U µ 0 ν 0 (x 0 ), coming from the integration over the green and blue paths where L is the set of coordinates of the links associated with U µ 0 ν 0 (x 0 ), see Eq. (11). P B(l) [U l ] is the polynomial coming from the integration of the green and blue paths coupled to the link variable U l , i.e.
The polynomial P B G (l) is the outcome of the integration over a green path and P B B (l) the outcome of integration over a blue path. The set B G (l) includes the PONs of the plaquettes whose links belong to the integrated green path. The set B B (l) has the same meaning as B G (l) but related to a blue path. The union of B G (l) and B B (l) defines the set B (l). Finally, the set B, required to perform the group integration present in F 40 [U , B, b 0 ], is given by the union of the four sets B (l) together with the set of PONs of the plaquettes that share the links present in U µ 0 ν 0 (x 0 ). Before providing expressions for P B G (l) and P B B (l) let us have a closer look on the integrations leading to these polynomials. Fig. 3 Sublattice of the representation given in Fig. 2 with the links labeled.
In Fig. 3 the green path coupled to the link U 3 is shown in full detail. This path has four links {U 3a ,U 3b ,U 3c ,U 3d } and the integration over these links gives and the integration measure reads The plaquette occupation numbers The blue path associated with the link U 3 is shown in Fig. 4. The blue path associated with the link U 3 includes the plaquette occupation numbers associated with the first neighbor plaquette Tr[U † 3Ũ 3eŨ † 3d ] of U µ 0 ν 0 (x 0 ) and of its second neighbor Tr [Ũ 3aŨ3bŨ3cŨ3d ]. The group integration over the blue path is for an integration measure given by  Fig. 4 Another sublattice of the representation given in Fig. 2 with the links labeled.
As for the green path, expressions for the coefficientsc i ,b i are given in Appendix A. The polynomials coming from performing the integrations over the green and blue paths are computed in Appendix A. It follows that for the green path while the blue path the group integration gives In order to evaluate Eq. (38) for each link of the central plaquette U l ∈ {U 1 ,U 2 ,U 3 ,U 4 }, it remains to multiply Eqs. (43) and (44). Once the polynomials P B(l) [U l ] are evaluated, we can integrate F 40 , see Eq. (37), over the remaining linkŝ and estimate the ratio between the weights Q in order to evaluate the probability transition p.
For the particular case of a local update transition b 0 → b 0 ± ∆ , the polynomials P B(l) [U l ] contributing to F 40 do not depend on ∆ , i.e. on the update of the central plaquette and, therefore, they do not need to be evaluated twice to compute p. Note that the function F 40 defined in Eq. (37) is given by a sum of terms like F 4 given in Eq. (23). It follows that the solution of the group integration in Eq. (45) is a sum of the solutions that look like Eq. (34). Then, the group integration is reduced to the computation of factorial numbers and, it follows from the definition and the approximation used, that the transition probability is a real and positive definite number.

Nonlocal update
The Monte Carlo updates discussed in Secs. 4.1, 4.1.1 and 4.1.2 do not allow us to access all possible configurations for the plaquette occupation numbers. For example, those local updates are unable to change a given plaquette occupation number from an odd natural number to an even natural number or vice-versa. As discussed in Sec. 3, the introduction of a global or a nonlocal update can improve the algorithm in the sense that it enlarges the space sampled by the algorithm.
A nonlocal update can be implemented via a simultaneous transformation of all the plaquette occupation numbers over a plane surface, where each of the PONs is changed accordingly to b µν (x) → b µν (x) ± ∆ , where ∆ is not necessarily a multiple of N. For this update, the number of links to be integrated increases with the lattice size. Recall that for the updates discussed previously, the number of links integrated to compute the weights depends only on the type of update and is fixed a priori for each of the updates. Although by enlarging the size of the space sampled by the algorithm, this nonlocal update might not be enough to guarantee full ergodicity of the algorithm, but it certainly helps in approaching an ergodic update. Of course, one can introduce other types of nonlocal updates as, for example, an update of the PONs attached to a cube. The updating process where a plane surface is filled with PONs that are not multiples of N can not generate a configuration where the PONs that are not multiples of N are attached to the cube surface. In addition to the so-called planar update, and to comply with full ergodicity, one should also implement the cube type of update. However, its implementation is rather complex and its impact on the performance of the algorithm will be the object of a future report.
Let us now discuss the group integration to compute the transition probability p. In Fig. 5 we show the surface over which the plaquette occupation numbers are to be updated. In order to perform the group integration, the links represented by solid lines are set to the identity matrix and those represented by doted lines are to be integrated exactly for the weight evaluation. In d > 2 dimensions and in what respects the group integration, the links in Fig. 5 are coupled with staples in perpendicular planes. In the integration to compute the transition probability for this nonlocal update, all those staples are set to the identity matrix. Again, we are not building an exact maximal tree but the approximation allows us to get relatively simple expressions in the calculus of the transition probability p.
The local function F p , associated with the update over a 5 × 5 plane represented in Fig. 5, contains 24 link variables and is given by where all b i are plaquette occupation numbers belonging to the plane where the nonlocal update takes place, the c i are related to the integrated link U i and are given by a sum of plaquette occupation numbers belonging to the plaquettes that share U i in other planes than the updated plane. Starting the group integration by the link labelled 1 in Fig. 5, the integration function is of the same type as that defined in Eq. (30) and whose solution is given in Eq. (32). The integration leads to a polynomial of the trace of the link with label 2. For the integration of the link labelled 2 one uses the solution in Eq. (32) and repeat the process to the subsequent links, as for the integration of the green and blue paths in the local update associated with Fig. 2.

Observables
We implemented the algorithm to compute the mean value of the plaquette and the mass of the J PC = 0 ++ glueball. The mean value of the plaquette is easily computed in terms of the plaquette occupation numbers. In the partition function given by Eq. (3), the plaquette U µν (x) comes associated with the factor β . Formally, one can identify a different β with each of the plaquettes and make the replacement β → β µν (x). Ignoring the constant C in Eq.
where W [U] is the Boltzmann weight factor in the standard representation of the partition function. Performing the same operations with the partition function written in the new representation, given by Eqs. (8) and (9), it follows that and, therefore, the plaquette expectation value is given by the average of the dual variables b µν (x) The average of the plaquette expectation value over the lattice volume, called plaquette mean value u, reads The value of u estimated with our algorithm will be compared with the output of a conventional heat bath Monte Carlo method. In this exploratory work besides the mean value of the plaquette we also compute the mass of the scalar glueball with quantum numbers J PC = 0 ++ . This requires the building of an interpolating field Φ with the right quantum numbers and writing Φ in terms of the dual variables b µν (x). A first step toward the computation of the mass of the scalar glueball is the evaluation of the correlation function Setting y fixed at the origin of the lattice, then the zero momentum Euclidean space Green's function reads where m is the mass of the glueball ground state and the last line is the result of making the change of variable p 2 + m 2 = z 2 m 2 in the first line. The integration over z is given in terms of the K 1 Bessel: where the second expression holds for large values of t.
The lattice version of the operator Φ is constructed by mapping the continuum symmetries and therefore the quantum numbers of the corresponding particle into the hypercubic group [40]. For the ground state and for the channel J PC = 0 ++ , the simplest operator is given by i.e., the sum of spacelike plaquettes. With the use of Eq. (49), the operator Φ can be mapped into the new representation and is given in terms of b µν (x) as The estimation of the glueball masses from correlation functions of type given in Eq. (53) with smaller statistical errors is not an easy task. Indeed, given that G(t) decays exponentially with Euclidean time, the signal to noise ratio decreases speedily for large Euclidean time and, therefore, on the lattice one can only rely on a limited number of time slices to estimate m. Although there are a number of techniques to improve the signal to noise ratio, as e.g. the use of anisotropic lattices or the use of smeared operators [36,38,39], we will take the interpolating operator as given in Eq. (54), with the representation given in Eq. (55), to test the algorithm.
In practice, for estimating the scalar glueball mass, a number of uncorrelated configurations will be generated and the operator Φ will be computed using Eq. (55). From the interpolating field we evaluate the scalar glueball connected Green function where T is the lattice time length and the second term on the right hand side in Eq. (56) removes the vacuum contribution to the signal. The mass of the J PC = 0 ++ glueball is measured fitting the lattice estimation in Eq. (56) to the functional form given in Eq. (53).

Results
In the simulations we start the Markov chain with a cold start, where all b µν (x) = 0, and the Monte Carlo updates use both the local and nonlocal updates. For the local updates, a given PON b µν (x) is chosen randomly and a change by ±2 is proposed with the sign being chosen randomly. This process is repeated V p times, where V p is the total number of lattice plaquettes. To this set of updates we call one Monte Carlo step or full sweep for the local update. For the nonlocal update, a two dimensional surface is chosen randomly on the lattice and for each PON b µν (x) on the surface a change by ±1 is proposed randomly. The process is repeated N p times, where N p is the number of two dimensional surfaces on the lattice. To this set of updates we call one Monte Carlo step or full sweep for the nonlocal surface update.

Sampling and the mean value of the plaquette
For the evaluation of the mean value of the plaquette given in terms of the dual variables, as given in Eq. (50), we simulate two different lattice volumes, 6 4 and 12 4 , for various values of β . For each of the simulations, after discarding 10 3 combined Monte Carlo steps for thermalization, we consider 10 4 configurations separated by 10 combined Monte Carlo steps. Our numerical experiments have shown that a separation of 10 combined Monte Carlo sweeps is enough to decorrelate the observables measured in the current work.
In Fig. 6 we compare the results obtained with the present algorithm with the results obtained with the heat bath algorithm (also for the standard Wilson action) implemented with the library Chroma [48]. The results shown for the heat bath algorithm refer to simulations performed on a 10 4 lattice, for an ensemble with 10 4 configurations, separated by 5 Monte Carlo steps.
In the top panel of Fig. 6 we show the plaquette mean value obtained in simulations of a 12 4 lattice combining the local and nonlocal updates against the results of the standard Wilson action using a heat bath simulation. As can be seen, there is good agreement between the results obtained with our algorithm, using any of the local updates, and with those obtained with the heat bath simulation in the strong coupling limit. The data also suggest that in the weak coupling limit the present algorithm prediction for u converges to the value given by the heat bath algorithm.
In what concerns the β dependence of the results, the present prediction for u starts to deviate from the heat bath result for β ∼ 1.5 up to β ∼ 3, but its maximal deviation is about 0.1% and occurs for β ∼ 2.3. Interestingly, in this range the local algorithm which takes into account the smaller number of integrations, see Sec. 4.1.1, is closer to the results of the heat bath simulation. However, as one approaches the continuum limit, i.e. for β 3, it is the algorithm which uses the other local update, see Sec. 4.1.2, which is closer to the heat bath outcome. Indeed, for the algorithm whose local update takes into account the larger number of group integrations the deviations from the heat bath result are marginal for β 3.
The volume dependence of the algorithm can be seen in the lower panel of Fig. 6, where the sampling of u is investigated for two different lattice volumes. Recall that the full Monte Carlo update is defined by a combination of local and nonlocal updates. The data show no or only a mild dependence on the lattice volume.
In Fig. 7 we show the relative deviation of the present estimation of u with respect to the heat bath results for dif-ferent lattice volumes. The deviations are negligible in the strong coupling limit and are very small when the continuum limit is approached. The maximal deviations 0.1% occur for intermediate values of the coupling around β ∼ 2.3. From the figure one can also read the improvement of considering F 40 instead of F 4 ; recall that F 40 takes into account forty Haar integrals in the evaluation of p while F 4 takes only four Haar integrals. In particular, for the largest lattice, the data show a notorious improvement on the values of the mean value of the plaquette relative to the heat bath numbers when using F 40 . Indeed, in the continuum limit, when one uses F 40 to estimate p, the deviations are about ∼ 50% smaller compared to computations using F 4 .
The numerical simulations performed show that our approach is a good approximation in the strong and weak coupling limits. Given that Boltzmann weights are proportional to powers β , in the strong coupling limit, i.e. for small β values, most likely the dual variables are zero or close to zero and setting the link variables to the identity matrix is essentially an irrelevant operation. As β increases the dual variables start to deviate from zero, the previous argument no longer applies, and one can expect deviations from the exact result. This seems to be the case for β values in the range 2.5 < β < 3. Although one would expect that integrating more links is always better, one should recall that the integration is not exact. While it is true that the F 40 updates take into account more link variables, it also sets a large number of link variables to the identity matrix and, therefore, at some stage it can become less accurate than the F 4 update. On the other hand, as the continuum limit is approached, the link variables approach the identity and, in this case, our approximation reproduces faithfully the theoretical expectations.
The performance of our algorithm for different β values and different volumes can be understood looking at the update efficiency E , defined as its acceptance rate in the Markov chain. As can be seen in the top panel of Fig. 8, the nonlocal update has an essentially vanishing E , with the exception of the smaller lattice and over a narrow range of β values. Note, however, that the region where the simulations using the two volumes give different values for u, see the lower panel in Fig. 6, is precisely the region of β where the efficiency associated with the nonlocal update has its maximum value. Furthermore, the results of Figs. 6 and 8 suggest that the nonlocal update plays an important role. Indeed, for the smaller lattice volume and for β in the range 2.5 − 3, the efficiency E is maximal and non negligible for the nonlocal update, which makes the estimation of u by the present algorithm closer to the values provided by the heat bath method. The deviations of our estimation for u relative to the heat bath result for the smaller volumes are milder for β in the range 2.5 − 3, as can be seen from Fig. 7. For the larger volumes, E is always residual and the our estimation of u shows larger deviations which are, nonetheless, less than 0.1% relative to the heat bath numbers. Herein, we considered a single type of nonlocal update but many other possibilities can be explored to achieve a better and more complete sampling of the dynamical range of values allowed for the plaquette occupation number space. Within the rationale considered in this work, the building of a algorithm, i.e. the implementation of other types of nonlocal updates, implies a compromise between a given geometrical setting, i.e. the definition of a given set of links over a large region of the lattice, and the ability of being able to perform the group integration over the corresponding sublattices. Recall that, within our framework, the local updates do not sample the entire {b} space. For example, for the local updates the {b} remain either in the subset of odd or even natural numbers. The nonlocal updates were built to allow for a better dynamical range, allowing for transitions in Markov chain where the PONs could become either odd or even natural numbers. The search for other nonlocal types of updates is one of the features that we aim to explore in a future work.
Another way of reading the results in Fig. 8 is that one should improve the efficiency E of the non local update. Indeed, for the local updates its acceptance rate is always ∼ 10% or above, reaching a value of about 50% as the continuum limit is approached. On the other hand, the nonlocal update defined in Sec. 4.2, has an extremely low E , with has a maximum of ∼ 0.25% for β ∼ 2.7 for the smaller lattice and being always residual for the larger lattice. The low values for the efficiency associated with the nonlocal update mean that the plaquette occupation numbers are essentially trapped into the subset of the odd or the even natural numbers which is sampled by the local Monte Carlo updates.
The local updates change, in a single update, a fixed number of b µν (x) and, in principle, are not so sensitive to volume effects as the nonlocal updates which are affected by surface effects. For the conversion of the glueball mass into physical units, we rely on Ref. [49] which uses the string tension √ σ = 440 MeV and assumes where the first two terms are the predictions of 2-loop perturbation theory and the remaining terms parameterize higherorder effects. The parameters c = 4.38 (9) and d = 1.66 (4) were set by fitting the lattice data for the string tension using simulations with β ∈ [2.3, 2.85]. For β = 3.01, the above relation estimates a ≈ 0.02 fm for the lattice spacing. The glueball mass is evaluated from the asymptotic expression for the two-point correlation function Our lattice estimations for G(t) use ∼ 10 7 configurations and the correlation function can be seen in Fig. 9. Despite using a large ensemble, our Monte Carlo code is not parallelized. However, the ensembles were built running the code on various independent standalone machines. For t 6 the lattice two point correlation function becomes negative and compatible with zero within one standard deviation and, therefore, lattice Euclidean times larger than 6 will not be considered. The correlation function for t = 1 does not comply with the remaining values for larger t and with Eq. (58) and, therefore, in the estimation of m it is discarded. In the measurement of the glueball mass we consider three different fitting ranges and two large and independent ensembles as described in Tab. 1. For each of the fitting ranges considered, the lattice data are well described by the asymptotic The simulation described so far uses a small physical volume and the simplest operator to estimate the glueball mass. Indeed, none of the available techniques to improve the signal to noise ratio is used in the numerical experiments. However, despite this limitations we are able to reproduce the numbers that can be found in the literature. Our estimates for the intermediate fitting range are m = (3.61 ± 0.86) √ σ and m = (3.62 ± 0.53) √ σ , and agree within one standard deviation with the numbers quoted above. In Ref. [41] the authors report several estimates for SU(2) scalar glueball mass. Ref. [42] uses the same interpolating operator for the glueball as ours and reports the value m = (3.7 ± 1.2) √ σ , as we can see, the error in our estimation is about 30% smaller. In Ref. [39], the simulation is done using improved signal to noise methods and the authors report the value m = (3.12 ± 0.22) √ σ . Finally, the more recent calculation in Ref. [37] gives m = (3.78 ± 0.07) √ σ .

Summary
In the present work we discuss a mapping of the lattice Wilson action into an approximate dual representation, whose dynamical variables, the so-called plaquette occupation numbers (PONs) b µν (x) , belong to the natural numbers N 0 . These dual variables are the expansion indices of the power series expansion of the Boltzmann factor for each plaquette. The partition function in terms of the new variables is given by a sum of weights Q {U} [{b}]. The PONs are subject to constraints imposed by gauge symmetry, given by Eq. (15). The weights Q for a configuration of PONs involve integrals over the link variables over the entire lattice volume whose integrands are products of powers of plaquettes. We used Monte Carlo simulations to solve the theory. The transition probability p defining the corresponding Markov chain is given by ratios of the weights Q. The link integration is simplified to get an approximate analytical estimation for p. Specifically, the approximations consist in the following. In an update of b µν (x), the lattice is factorized into a region containing the plaquette U µν (x) and its complementary. Then, the links at the interface between the two regions are rotated to the identity. This allows us to evaluate analytically the link integrals necessary to estimate p. Two different types of updates, named local and nonlocal, are considered. In the local updates, a given PON b µν (x) is chosen randomly and a change by ±2-we have concentrated on SU(2) gauge theory, see Eq. (15)-is proposed with the sign being chosen randomly. For the nonlocal update, a two dimensional surface is chosen randomly on the lattice and for each PON b µν (x) on the surface a change by ±1 is proposed randomly. The nonlocal update improves the ergodicity of the algorithm as it allows to switch the occupation numbers from odd to even and vice-versa, an evolution which is not allowed by the local updates. We have not considered updates that involve changing the PONs on a cube.
The estimations for the plaquette mean value agree very well with those obtained with a conventional heath bath algorithm in the weak and strong coupling limits. Deviations from heath bath estimations occur in the range 2.5 < β < 3, but they are below than 0.1%. In what concerns the estimation of the lightest SU(2) glueball mass, the simulations reported here are in good agreement with estimated in the literature.
We stress that the approach presented here relies on a series of approximations to get the transition probability p. One can speculate that the fact that the links rotated to the identity are a very small subset of the entire set of links {U µ (x)}, their contribution to p to be subleading, at least for the quantities studied. Furthermore, given that the number of links set to identity is volume independent, one expects to approximate the exact value of p in the limit of large volumes.
The results reported here suggest that the inclusion of larger lattice partitions in the "inner" integral, i.e. including larger numbers of links in the neighborhood of the up-dated plaquette occupation number, to estimate the transition probability takes p closer to its real value. This can be achieved by a careful choice of the "inner" region, i.e. the region which includes the lattice point where the plaquette occupation number is to be updated, and the "outer" sublattices such that one is able to perform necessary group integrals after setting some of the links to the identity. Certainly, any progress in the evaluation of SU(N) integrals, see e.g. Ref. [50], will help in improving the estimation of p. Another possible approach, still to be developed, is the numerical evaluation of the group integrals which, hopefully, could lead to an "exact" estimation of the transition probability.
The algorithm discussed here can be generalized to SU(N) gauge groups with N > 2. Another interesting research topic is the inclusion of the fermionic degrees of freedom which, in principle, can be accommodated within the procedure described. These are research problems that we aim to address in the near future.
From these basic properties we can concludê and these properties determine the constraint over the new degrees of freedom discussed in Sec. 3.
Appendix A.1: Integration over the green paths Consider the green path, see Fig. 3, containing the links variables U 3a ,U 3b , U 3c and U 3d that need be integrated, this path is coupled to the central plaquette (CP) U µ 0 ν 0 (x 0 ) = U 1 U 2 U 3 U 4 by the link U 3 and belong in a plane parallel to CP in the direction ρ. Each link of CP is coupled to one green path, here we will show the integration of the green path coupled to the link U 3 , the precise definition of this green path links are U 3c = U † ν 0 (x 0 +ν 0 +ρ), (A.8) U 3d = U µ 0 (x 0 +ν 0 +ρ), (A. 9) and the integration in question is given by where the coefficients Γ are given by Eq. (33). Now integrating K 1 with the measure dU 3b we find where K 2 = K 2 [U 3c ,U 3d ;U 3 , {b }] and the measure DU G are defined by Integrating the link U 3c we obtain 24) where K 3 = K 3 [U 3d ;U 3 , {b }] is defined by In the Fig. 4 we present the blue path coupled to the link U 3 of CP. Like in the green path case, each link of CP is coupled to one blue path. Here we will show only the integration of the blue path coupled to the link U 3 , the integration in question is Tr Ũ 3a c 1 Tr Ũ 3b c 2 × Tr Ũ 3c c 3 Tr Ũ 3d c 4 Tr Ũ 3e c 5 , (A. 28) where the definitions of the blue path links arẽ U 3a = U ν 0 (x 0 + 2ν 0 +μ 0 ), (A.29) In order to guarantee that we deal with integration that looks like Eq. (32), we need start the integration by one link of the plaquetteŨ 3aŨ3bŨ3cŨ3d , here we start by the linkŨ 3a , then  As in the green path case, the outcome is a polynomial. The above solution can be used to evaluate all blue path integrations but we need to be careful, the definitions of the blue path links, the PONs b i and the sum of PONs c i change accordingly.