Dihedral lattice gauge theories on a quantum annealer

We study lattice gauge theory with discrete, non-Abelian gauge groups. We extend the formalism of previous studies on D-Wave’s quantum annealer as a computing platform to finite, simply reducible gauge groups. As an example, we use the dihedral group Dn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$D_{n}$\end{document} with n=3,4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$n=3,4$\end{document} on a two plaquette ladder for which we provide proof-of-principle calculations of the ground-state and employ the known time evolution formalism with Feynman clock states.


Introduction
Lattice gauge theory (LGT) calculations using quantum computers have already seen substantial progress.This is despite the fact that programmable quantum hardware has only recently become widely available to researchers in physics (see e.g.[1] for an up-to-date high-energy physics perspective on the field).With the basic formulation of quantum simulations of LGT being laid out very early on [2], efficient formulations of Abelian [3] and non-Abelian LGT [4,5] on universal, gate-based hardware now exist.This includes a complete set of instructions for the efficient and accurate simulation of QCD and QED [6].
On the side of adiabatic quantum computing [7], despite the fact that it has been commercially available for more than a decade in the form of quantum annealers (QA) [8], this approach has only recently been used for LGT calculations.These include the pioneering studies on the annealer for the case of SU(2) [9] and SU(3) [10].In these formulations, the number of qubits necessary to digitize the theory under study scales with the size of the Hilbert space of the problem, which grows exponentially with the spatial volume of the system.Thus, this formulation does not show the expected quantum advantage present in universal, gate-based quantum computing.On the other hand, systems in a QA architecture, such as D-Wave's Advantage_system5.1, already comprise several thousand physical qubits [11].Even at this stage of hardware development, proof-of-principle quantum computations in LGT [9,10] or other field theories [12] are feasible.The intrinsic nature of the formulation of problems on the annealer simply requires the mapping of the lattice field theory onto an optimization problem represented by the Hamiltonian with a real, upper-triangular matrix Q and binary variables q i ∈ {0, 1}.This type of problem goes under the name of quadratic unconstrained binary optimization (QUBO).Thus, QA can be seen as an ideal entry point into the field of quantum simulation of LGT.It is in this spirit, that we turn to the subject of our study.
On the lattice, the gauge field Hilbert space is infinite for compact Lie groups and a truncation of the full symmetry becomes necessary (see [13] for a basic overview).One such truncation is the approximation of the full symmetry group by a discrete subgroup, a strategy whose varied success and intricacies are well summarized in [14].Here, we take the practical approach by choosing the finite, non-Abelian dihedral group D n as our gauge group, which can be digitized without truncation as in [15].By mapping this problem onto an optimization problem amenable to the QA, we extend the previous studies of compact Lie groups [9,10] to the case of simply reducible, finite groups for which we provide the adapted framework.This will allow future studies to separately understand the effects of Hilbert space truncation and comparisons of classical versus quantum simulations.Moreover, our Hamiltonian formulation has connections with gate-based methods.These approaches do not depend on the size of the Hilbert space and thus show polynomial scaling in the spatial volume with the full quantum advantage.

Hamiltonian D n lattice gauge theory
We begin by introducing the Hamiltonian formulation of D n lattice gauge theory.Our approach closely follows that of [2], where the Hamiltonian approach was worked out for a general gauge group G.As usual, we work on a cubic lattice of dimension d, with the gauge fields living on the links between the lattice sites.The gauge field Hilbert space, denoted by H G , is a direct product of the individual link spaces H G = H which, in the group element basis, are defined by H = span({|g } g∈G ).We start by defining the link operator Û, acting on H , as where j labels the irreducible representations (irreps) of G and D j mn (g) are the Wigner representation matrices for g ∈ G.The indices m, n label the multiplicity of the left and right projection of the link, respectively.This object is of primary importance in the Hamiltonian formulation as it is responsible for the interactions.
The Hamiltonian formulation for G = SU(2) lattice gauge theory was first written down in [16].In later work, it was shown how this Hamiltonian could be obtained from the transfer matrix [17].For a general gauge group G, the lattice Hamiltonian, commonly referred to as the Kogut-Susskind Hamiltonian, consists of two terms where the first term is referred to as the electric part and the second term is referred to as the magnetic part.The magnetic part takes the form where the sum is over the spatially-oriented plaquettes 1 and can be seen to be diagonal in the group elements basis by virtue of the definition in Eq. (2).In this basis, the electric term, ĤE , has a form that depends on whether G is taken to be a compact Lie group or a finite group [18,19].It is often much more convenient to work in the representation basis, labeled by the states |jmn .Here j labels the irrep and m, n run over the states within the multiplet.In this basis ĤE becomes diagonal The group element basis is related to the representation basis through the following relation where |G| is the order of the finite group G. From here on out, we will assume that we are working with finite groups and our formulae will reflect this.Using the transformation in Eq. ( 6), one can easily transform between the two bases.
It is important to discuss the couplings in the Kogut-Susskind Hamiltonian.The relationship between the couplings λ E , λ B appearing in front of the electric and magnetic terms, respectively, can be determined in the limit a 0 → 0 when deriving the Hamiltonian in the transfer matrix formalism.However, this procedure depends on the gauge group under consideration.While for a compact Lie group, λ E = g2 H /2, λ B = 1/g 2 H , for a finite group it has been determined by previous studies that one should use λ E = exp (-2/g 2 H ), λ B = 1/g 2 H , instead [18,19].Here we have introduced the Hamiltonian coupling g H , which is the geometric mean of the spatial and temporal couplings, g s and g t .These are introduced in the transfer matrix formulation when one takes the temporal and spatial lattice spacings to be distinct.The coefficients f j appearing in Eq. ( 5) are the eigenvalues of the quadratic Casimir operator for the case of compact Lie groups [2].For example, when G = SU(2), one gets the familiar result f j = j(j + 1).On the other hand, for finite gauge groups, the f j can be derived systematically from the transfer matrix in the limit of vanishing temporal lattice spacing, a 0 → 0 [19].Other choices for the coefficients for the case of discrete gauge groups also exist in the literature [20].

Computation of H ij
With the Kogut-Susskind Hamiltonian given in operator form Eq. ( 3), there still remains the task of constructing the states of the physical Hilbert space H P .The label physical here refers to the subspace of the larger Hilbert space H G that respects local gauge invariance.Formally, in the group element basis, local gauge invariance can be expressed with the help of left and right multiplication operators given by L g ( x, i) and R g ( x, i) that act as follows As usual, the link transforms in the adjoint representation under a gauge transformation.Thus, a local gauge transformation at the site x parametrized by g is given by For a generic physical state |ψ , gauge invariance demands In the representation basis, the statement of Gauss's law in Eq. ( 9) is equivalent to |ψ being written as a direct product of color singlets at each lattice site where we refer to Appendix B for the details regarding the explicit construction of |00 x in terms of the |jmn .As we are ultimately interested in mapping our system onto a quantum annealer, we are restricted to a rather small system size (Fig. 1).For a given lattice geometry, we are then left with the task of determining the matrix elements of the Hamiltonian (3).We start by introducing the trivial vacuum state |0 with every link in the trivial representation, j = 0, s.t.ĤE |0 = 0. Physically, this corresponds to the situation where the links contain zero chromoelectric flux.Following the approach of [2], the states of the physical Hilbert space can be systematically generated from this configuration by subsequently acting with gauge-invariant operators.To carry out this procedure, one needs to know how an individual link operator acts on a general state in the representation basis, |jmn .Using the definition of the link operator in (2) and the matrix element in (6), one obtains Figure 1 Ladder geometry used in this study.The sites of the ladder have been labeled as (i, j), where i = 0, 1, . . ., N -1 and j = 0, 1.Here N denotes the length of the ladder.The forward link operators are also shown and have been labeled by their direction μ = 1, 2 as well as the site from which they emanate.We note that the system is periodic only in the 1-direction This can be further simplified by using the Clebsch-Gordan (CG) series for the tensor product of two arbitrary representation matrices, which yields the result × 2m jm|JM JM|2n jn |JMN , where the sum on J is over the irreps and the sums over M and N are over the states in a given irrep. 2pplying gauge invariant operators repeatedly to the trivial vacuum state with the help of Eq. ( 12), the enumeration of the configuration space can be performed.In this procedure, Gauss's law is imposed at each step.This is equivalent to the Wigner 3J-symbol being nonzero for a tuple of irreps, (j 1 , j 2 , j 3 ), which characterize the three links involving a given lattice site.For more details regarding the 3J symbols and Gauss's law we refer the reader to Appendices A. 3 and B.
This task of mapping out the physical Hilbert space can be automated using a Markovchain-like approach.For this, all one needs are the 3J symbols for the given gauge group G.The total number of states in the full Hilbert space is Ñ3N irreps states, where Ñirreps is the total number of irreps of the gauge group G and N is the size of the ladder.Although enforcing local gauge invariance removes a large number of these states, the physical Hilbert space still grows quite rapidly.In Table 1, we display the size of the physical Hilbert space, where G = D 3 , D 4 .These counts show that even for modest system sizes and small non-Abelian groups there are constraints as to the problems that can be mapped to the quantum annealer.
Once we have enumerated the states in the physical Hilbert space, we can finally compute the matrix elements of the Hamiltonian in this basis.As ĤE is diagonal in the representation basis, the application of Eq. ( 5) to the generic state in (56) is trivial.The magnetic Hamiltonian, which is responsible for the interactions, has a nontrivial action on a physical state.To illustrate this, we first write an arbitrary plaquette operator on the ladder where x = (x, 0), x = 0, . . ., N -1 denotes the vertex at the bottom left corner of the plaquette and the sum is over the group indices.Here we label each link by its site vector and direction.Now, using the relation Eq. ( 12), we can determine the result of the plaquette operator acting on a state.The matrix element of Eq. ( 13) between two arbitrary physical states is given by where we refer to |ψ and |ψ as the "in" and "out" states, L x = { l1 , l2 , l3 , l4 } denotes the set of all links involved in (13), and the bar denotes complex conjugation.The sums over n i run over the states in the 2 representation and the sums over m i,μ , o i,μ run over the states in the corresponding irreps for each link in the "in" and "out" states.In Eq. ( 14), we have introduced the Wigner 3J symbols which can be generalized to D n .This along with other details regarding the group theory of D n are given in Appendix A, with the full derivation of Eq. ( 14) in Appendix C. Using this result for the plaquette matrix element, one can construct the magnetic Hamiltonian by recalling that ĤB = -λ B x P x .We note here that this construction is completely general and applies to a ladder of arbitrary length.
For the gauge groups which we have examined, it turns out that the Hamiltonian matrix is extremely sparse.This will work to our advantage later on when we map our problem to the quantum annealer.In Fig. 2, we display a visualization of the sparsity of the Hamiltonian for both D 3 and D 4 .Examining the product of delta functions in Eq. ( 14), the sparseness of the Hamiltonian ultimately comes from the orthonormality of the link states in the representation basis.Once one has calculated the Hamiltonian matrix, the classical part of the calculation is practically complete.In the following, we discuss how our lattice gauge Hamiltonian is transformed into an optimization problem so that the quantum computation on the annealer can be performed.

Groundstate via variational formulation
Quantum annealing is a method used to solve a very specific type of problem: the calculation of the ground state of a generalized Ising model [11].Thus, unlike the case of the gate-based approach where one has at one's disposal a set of universal quantum gates, for In the context of lattice gauge theory, it has been shown that one can map the Hamiltonian in Eq. ( 3) onto a model with QUBO form, Eq. ( 1), in order to compute the low-lying states of the spectrum [9,10].To see how this emerges we consider the variational principle from quantum mechanics where E 0 is the ground-state energy.Here we use a variational ansatz with a trial wave with real parameters a α and basis states |φ α corresponding to the configurations of the physical Hilbert space.The expansion parameters are, in general, complex but here can be chosen to be real as the Hamiltonian is a real, symmetric matrix.It is in this way that solving for the ground-state energy of our lattice Hamiltonian can be recast as an optimization problem as one seeks to minimize ψ| Ĥ|ψ .Our accuracy in determining the eigenstates of the system is limited only by the precision to which we can determine the coefficients a α .To cast our problem in the form of Eq. ( 1), we do the following.First, the coefficients are given a fixed-point binary representation.Second, the norm of the wave function is discouraged from being zero by adding a penalty term.Incorporating both of these into our variational calculation, the rhs of Eq. ( 15) can rewritten as a cost function where Here, η represents the tunable parameter multiplying the penalty term.In addition to giving the variational parameters a floating-point representation, in the above definitions we have already introduced the parameter z, which is used in the adaptive variational search method [10].This procedure iteratively improves the estimates for the a (z+1) α by distributing the K sampling points around the preceding solution to the QUBO problem, a (z)  α , starting at a (0) α = 0.The estimate for the eigenstate is refined at each step, hence the name "zooming" for this procedure.The number of zoom steps plays a significant role in the overall computational cost of our calculation, as each refinement requires calls to the quantum annealer.
The quantum computations are done on the quantum annealing hardware Advan-tage_system5.1 from D-Wave [11], which is accessible via its API D-Wave Ocean [21].As our system sizes are still small (c.f.Table 1), the results can be compared with the exact solution using the Hamiltonian Eq. (3) as well as with simulated annealing via the Ocean package neal.As alternative, which we did not employ, D-Wave offers hybrid solvers s.a. the KerberosSampler [21] that attempt to break down the original QUBO matrix into smaller pieces to be subsequently solved using classical or quantum hardware.This appears to be particularly useful for system sizes that cannot be embedded on currently available annealer architectures.
It should be noted that for computations employing both simulated and quantum annealing, results still have a η dependence, see Eq. (18).As already noticed in [9,10], convergence to the true ground-state is achieved for η lying in the actual vicinity of the groundstate energy, E 0 (approaching from above).For practical reasons, one can determine the "suitable" η for a given Q by solving Eq. ( 18) iteratively in η, terminating the calculation when a certain convergence criterion, s.a.relative improvement in the solution, is fulfilled.This strategy works well for local computations with simulated annealing and could in principle be employed also for quantum annealing.Here, runtime on the quantum annealer is the major constraint.
We finally comment on our setup when accessing the annealer via the provided software package.We use the quantum annealer in its forward annealing mode with default annealing schedule and annealing time t f = 20μs.At least one more parameter needs to be provided by the user during the quantum annealing computations.This is what is referred to as the chain strength.For our calculations, we find automatic chain strength tuning (default option) to be sufficient.Figure 3 shows results from both simulated and quantum annealing, for the ground-state energy H (red) as well as the expectation value for the magnet part H B (blue) and kinetic part H E (black) for G = D 3 (left).When going to G = D 4 (right), an increase in computational resources is needed due to the more complicated energy landscape for the larger group, which we however only partially meet due to runtime restrictions.

Time evolution
One of the main motivations for working in the Hamiltonian formulation of lattice gauge theories is the ability to access real-time dynamics.This stands in stark contrast to mainstream lattice calculations which work in Euclidean space and must perform an analytic continuation of numerical data in order to access real-time physics.In the gate-based approach, the so-called Trotter approximation is employed to the time evolution operator, Û(T) = exp{-iT Ĥ}, which evolves an initial state by a finite time T [15].This approximation consists of replacing the full Û with products of operators which evolve the system on a smaller time interval, δt.Corrections to this approximation typically scale with powers of δt.This approach to time-evolution of quantum states allows for an efficient simulation of the theory using universal quantum computers.
In order to solve this problem on the quantum annealer, however, one must reformulate time evolution as an optimization problem.This can be done by the introduction of Feynman clock states [22], a mechanism first applied to quantum chemistry calculations in order to generate parallel-in-time quantum dynamics [23].We thus have to introduce an ancillary quantum system with states |t , t = 1, 2, . . ., N t where N t is the number of timeslices in the time evolution.Tensoring this orthonormal state with our as-yet-unknown state vector |ψ t at each timeslice, the problem of time evolution is equivalent to the minimization of the following functional where Here δt ≡ T/N t is the step size in time, η is a Lagrange multiplier analogous to our previous penalty term, and Ĉ0 selects a predetermined initial state.By construction, Ĉ is hermitian.One can show that the minimum of the functional Eq. ( 20) corresponds to the exact timeevolved state at each step.Thus, as a result of a single optimization problem one obtains the full time-evolution of a many-body quantum state over a finite time interval.From this functional one can now obtain the QUBO matrix.As previously discussed for the case of finding the ground state of our Hamiltonian, this is what the quantum annealer requires as input.Our discussion closely follows the derivation of [10].Using a variational state |ψ t |t at each time step t, the functional in Eq. ( 20) becomes where the expansion parameters a α are complex, the indices in the sum run over all N t N conf values, and L αβ are the matrix elements of the functional.The terms in the above sum can be written in terms of the real and imaginary parts of both L αβ and a α .Using the fixed-point representation for both the real and imaginary parts of a α , one obtains the following QUBO matrix where the Latin indices now run from 1 to 2K to allow for K bits in representing both the real and imaginary parts of the variational parameters and the primed Latin indices are shifted by K .The dimension of this QUBO matrix is 2KN t N conf × 2KN t N conf , which is significantly larger than the one used to determine the eigenstates of the Hamiltonian.This problem size is too large to be fully embedded on current quantum annealers and we revert to local simulated annealing3 to solve it.The results of our time evolution simulations are displayed in Fig. 4 where we have time evolved the trivial vacuum.Shown are the expectation value of the magnetic part, ĤB , as well as the probability that the trivial vacuum persists, | 0|U(t)|0 | 2 .One can see good agreement with the exact results.

Conclusion and outlook
We have constructed the Hamiltonian formulation of non-Abelian lattice gauge theories for discrete gauge groups D n .For the concrete examples D 3 , D 4 we worked out the Kogut- Susskind Hamiltonian as well as the representations of the corresponding Hilbert space basis states in terms of Clebsch-Gordan coefficients.In principle, this construction can be generalized to larger gauge groups and higher dimensionality.By observing Eq. ( 55), it is clear that a full 2D lattice, which has a coordination number of four, would involve coupling one additional link per site to yield a representation j I (corresponding to the addition of three angular momenta in SU( 2)).The natural coefficients arising in this context would then be the Wigner 6J-symbols, also known as the Racah coefficients [24].For three dimensions, this construction can in principle be repeated.However, in that case it seems advisable to work purely with CG coefficients.As an example, we have shown how to map these simple lattice gauge theories onto a quantum annealer.In doing so, we have been able to compute the spectrum as well as time evolution for both D 3 and D 4 on small lattices.These proof-of-principle results are of course affected by finite-size effects and going to larger system sizes will have significant impact on observables, such as the spectrum of the theory.However, these are accessible using traditional Markov chain Monte Carlo methods (see e.g.[14]).
The main obstacle to simulate both larger groups as well as larger lattices in our approach is the scaling of the physical Hilbert space with increasing lattice and group size.It thus may be helpful to look in other directions in order to utilize the power of the quantum annealer.
One idea to get around the barrier of rapidly expanding Hilbert spaces for the case of continuous groups is to perform a truncation in the number of allowed irreps as was done in earlier studies of SU(2) and SU(3) in the Hamiltonian formulation [4,5,9].This could also be done for D n , where n > 4. A similar truncation procedure would involve both the electric and magnetic terms in the Hamiltonian, and thus one could investigate the effects on the ground-state energy as well as the dynamics of the system.
One further avenue that could be pursued with the annealer is the estimation of tunneling rates and vacuum decay [12,25].These non-perturbative processes are fundamental to the understanding of a wide range of phenomena in both high-energy and condensed matter physics.Another possibility is using quantum annealing in state preparation.This is an important problem faced by gate-based approaches to simulating lattice gauge theories.

Appendix A: The gauge group D n
In this Appendix we summarize key facts and properties of the dihedral group, D n , that are relevant to this work.In particular, we list the irreducible representations for general n, the Clebsch-Gordan coefficients for both D 3 and D 4 , and outline the algorithm for constructing the Wigner 3J-symbols.

A.1 Irreducible representations
One can define the dihedral group as the symmetry group of a regular, n-sided polygon.The symmetry operations are thus, rotation and reflections in the plane in which the polygon resides.The order of the group, denoted by |D n |, is 2n.We denote the group element which corresponds to rotations by 2π/n by r and that which corresponds to a reflection about, say, the y-axis by s.These two elements satisfy the following relations where e denotes the identity element.Any element of D n can be uniquely represented either as r k , 0 ≤ k < n, or as sr k , 0 ≤ k < n.We now list the irreducible representations (irreps) of D n for arbitrary n.We recall that a representation of a group is irreducible if it contains no invariant subspaces.
We start with the one-dimensional irreps of the dihedral group.For n even, there are four one-dimensional irreps while for n odd, there are two one-dimensional irreps.This is summarized by the characters listed in Table 2. Two-dimensional irreps of D n for arbitrary n also exist and are given, in the standard basis, by where we require 0 < h < n/2, where h labels the various irreps.From (25), the characters can be easily read off These will prove useful when decomposing an arbitrary tensor representation into a direct sum of irreps.
Table 2 Character table for the one-dimensional irreps of D n .For n even, all four irreps are valid, while for n odd, only the first two rows apply.In discussing D 3 , we will commonly refer to these one-dimensional irreps as the trivial representation, denoted by 1, and the σ -representation

A.2 Clebsch-Gordan coefficients
An important task in many branches of physics is to understand how one decomposes a tensor product of two irreps into a direct sum of irreps.For the case of D n lattice gauge theory, in order to construct the physical Hilbert space by acting with gauge-invariant loop operators, one must perform exactly this task.We consider two unitary irreps of a group G, ρ p and ρ q .In general, the tensor product of these two representations, denoted by ρ p ⊗ ρ q , is reducible.This implies that it is equivalent to a direct sum of unitary irreps, which can be symbolically expressed as where n r p,q is the number of times that the irrep labeled by r appears in the direct sum.It is immediately clear that n r p,q is symmetric in p and q.The dihedral group D n is an example of a so-called simply reducible group, where, among other things, n r = 0, 1 [26].The following analysis is made simpler by the requirement of only working with simply reducible groups, although it can be generalized to groups where the multiplicities can take values larger than one [27].
The Clebsch-Gordan (CG) coefficients can be thought of as a non-singular matrix transformation U, from the direct product basis to the block-diagonal basis.This is expressed by the following relation there U is of the size d p d q × d p d q , where d r denotes the size of the irrep r.The CG coefficients are denoted by where i = 1, 2, . . ., d p , j = 1, 2, . . ., d q , and k = 1, 2, . . ., d r .We list here the results for D 3 and D 4 , where in principle, the CG coefficients can be determined for arbitrary n.

A.2.1 D 3
The tensor products of the one-dimensional irreps are straightforward to compute as n σ 1,σ = n 1 σ ,σ = n 1 1,1 = 1.We list below the results for the tensor products involving the twodimensional irrep (labeled as 2) where the indices m, n, l = 1, 2, enumerating the basis elements of the two-dimensional irrep.

A.2.2 D 4
With the addition of two additional one-dimensional irreps, the case of D 4 is a straightforward extension of the calculations for D 3 .The tensor products of the one-dimensional irreps are summarized by where we use the same labeling of the one-dimensional irreps as in Table 2.The CG coefficients for the 2 (two-dimensional) irrep tensored with the various one-dimensional irreps are as follows The tensor product of the 2 irrep with itself gives a direct sum of all four one-dimensional irreps.The CG coefficients associated with this decomposition are given by For D n , n > 4, the analysis becomes more involved as multiple two-dimensional irreps appear.

A.3 Wigner 3J-symbols
In order to construct the physical Hilbert space we need to obtain the Wigner 3J-symbols for D n .Although the construction for SU(2) is familiar to most, it turns out that there exists a generalization to finite groups [28,29].Before providing the relevant formulae, we first provide a few key definitions from representation theory which will aid our discussion.We start by considering a generic irrep of a finite group denoted by (ρ, V ), where ρ is a homomorphism from the group G to the general linear group GL(V ) acting on the vector space V .To each irrep j we can associate a dual rep, denoted by j * , which is equivalent to the rep {ρ * (g), ∀g ∈ G}.The irrep j is related to its dual via the so-called duality map j , which is unitary and commutes with the action of the representation matrices.Furthermore, the duality map has the property that ( j ) T = α j j , where α j = ±1, 0 is the Frobenius-Schur (FS) indicator.
We denote the 3J symbol for the irreps of group G labeled by the tuple (j 1 , j 2 , j 3 ) by where the right-hand side uses the familiar notation from SU(2).The cyclic property of the 3J symbol is given by while one can obtain the 3J symbol for the dual of the tuple of irreps using where the bar represents complex conjugation.Finally, the normalization of the 3J symbol is fixed by requiring This guarantees that when we couple three irreps together at a site of our ladder via the 3J symbol, the resulting singlet state will be normalized to one.The duality map as well as the 3J symbol can be constructed for arbitrary irreps by using the algorithm presented in [28].

A.4 D 3
The results for the 3J symbols for D 3 are as follows A.5 D 4 In a similar fashion, one can obtain the 3J symbols for D 4 , which read

Appendix B: Gauss's law
For the construction of the physical Hilbert space, one must enforce Gauss's law at each lattice site.This is precisely the expression of local gauge invariance.For the more common case where compact Lie groups are employed, this condition can be written down in terms of the generators of left and right gauge transformations on the links which enter or leave a given site of the lattice.An analogous construction, which can be generalized to discrete groups such as D n , uses properties of the states characterizing the various irreps.To be more concrete, at each site of our ladder we tensor together the three links which either start or end on that site while summing over the internal degrees of freedom such that it is a singlet.This has a natural expression in terms of the Wigner 3J-symbols, and can be written as follows where f is a known function which has been tabulated for D 3 and D 4 and takes integer or half-integer values.In the third line we have used the fact that the CG coefficients for the projection of the tensor product of any two irreps onto the trivial representation (1) is diagonal.The expression in (55) is valid for continuous as well as finite groups.Using the Wigner 3J-symbols and the CG coefficients for D 3 and D 4 which were listed in Appendix A, one can produce a gauge invariant state on the ladder by taking the tensor product of the analogous expression at each site.This is represented by the expres- (-) f (j 1,s ,j 2,s ,j 3,s ;m 3,s ) , where the {m i,s } are the local multiplicities at site s of the link in representation j , and in the product over links, each link has multiplicities m L and m R associated with the "left" and "right" ends of the link.One can thus label the states of the Hilbert space by a set of N links = 3N integers characterizing the irreps, where N is the number of plaquettes, with the condition that at each site there is a valid tuple with nonzero 3J symbol.From here, one has everything one needs in order to enumerate the states in the physical Hilbert space.

Appendix C: Plaquette contribution
Here we provide the details for the matrix element of a plaquette in the physical Hilbert space.This derivation is similar to that of [9] for the case of SU(2).The application of the plaquette in (13) -) f (j 1,s ,j 2,s ,j 3,s ;m 3,s ) , ( where the sums over m L i and m R i represent 3N individual sums whose ranges depend on the configuration of the state |ψ .Using the Clebsch-Gordan series, we can obtain the result of each link operator acting on an arbitrary link state.Applying this to each term in (58) yields P x |ψ = n 1 ,...,n 4 {m L i } {m R i } s j 1,s j 2,s j 3,s m 1,s m 2,s m 3,s (-) f (j 1,s ,j 2,s ,j 3,s ;m 3,s ) We now take the inner product of (59) with a second generic state |ψ which satisfies Gauss' law.We note that states in the representation basis are orthonormal and thus we obtain the result in Eq. ( 14).

Figure 2
Figure 2 Visualization of the Hamiltonian matrices (g 2 H = 0.75) for gauge groups D 3 (left) and D 4 (right) on the N = 2 ladder.One immediately notices the sparsity of both Hamiltonians, which is due to the structure of the magnetic contribution

Figure 3 (
Figure 3 (Left): Ground-state expectation values for D 3 for the full Kogut-Susskind Hamiltonian (red), electric term (black), and magnetic term (blue) as a function of the inverse Hamiltonian coupling squared.The open symbols represent the minimum result from the quantum annealer while the filled symbols were obtained from classical simulated annealing.The colored band, although barely visible, represents the mean and sample standard deviation of the measurements from the quantum annealer.Simulation parameters for the latter were K = 3 with z max = 5 zoom steps and n reads = 1000.(Right): The same quantities for G = D 4 where the sample standard deviation from QA is much larger.This is due to the fact that more computing resources are needed to accurately determine the minimum.Simulation parameters for QA were K = 2 with z max = 7 zoom steps and n reads = 2000

Figure 4
Figure 4 Results for time evolution using simulated annealing at g 2 H = 0.75 with simulation parameters given in the text.The red and yellow points represent the expectation value of the magnetic Hamiltonian in the time-evolved trivial vacuum state as a function of time for D 3 and D 4 .The blue and black points represent the probability amplitude for the trivial vacuum state to persist as a function of time.The lines represent the exact result for each case s j 2,s j 3,s m 1,s m 2,s m 3,s

Table 1
List of the size of the physical Hilbert space, N conf , on a ladder of size N for D 3 and D 4 .The configurations are enumerated by a set of integers {j i , i = 1, 2, . . ., 3N} characterizing the irrep of each link on whereby Gauss's law is satisfied at each site on the arbitrary physical state listed in (56) is given byP x |ψ = n 1 ,...,n 4 {m L i } {m R i } Ûl 1 ;n 1 n 2 |j l1 m L l1 m R l1(57)⊗ Ûl 2 ;n 2 n 3 |j l2 m L l2 m R l2 ⊗ Ûl 3 ;n 4 n 3 |j l3 m L l3 m R l3 ⊗ Ûl 4 ;n 1 n 4 |j l4 m L l4 m R l4 s j 1,s j 2,s j 3,s m 1,s m 2,s m 3,s