In this thesis we extend the formalism of tensor network algorithms to incorporate global internal symmetries. We describe how to both numerically protect the symmetry and exploit it for computational gain in tensor network simulations. Our formalism is independent of the details of a specific tensor network decomposition since the symmetry constraints are imposed at the level of individual tensors. Moreover, the formalism can be applied to a wide spectrum of physical symmetries described by any discrete or continuous group that is compact and reducible. We describe in detail the implementation of the conservation of total particle number (U(1) symmetry) and of total angular momentum (SU(2) symmetry). Our formalism can also be readily generalized to incorporate more exotic symmetries such as conservation of total charge in anyonic systems.
The benefits of exploiting the presence of symmetries in tensor network algorithms have been extensively demonstrated in the context of matrix product states (MPSs). These include the ability to select a specific symmetry sector (e.g., with a given particle number or spin), to ensure the exact preservation of total charge, and to significantly reduce computational costs. Compared to the case of a generic tensor network, the practical implementation of symmetries in the MPS is simplified by the fact that tensors only have three indices (they are trivalent, just as the Clebsch-Gordan coefficients of the symmetry group) and are organized as a one-dimensional array of tensors, without closed loops. Instead, a more complex tensor network, one where tensors have a larger number of indices and/or a more elaborate network structure, requires a more general treatment. In two recent papers, namely, (i) [Singh, Pfeifer, and Vidal, Phys. Rev. A 82, 050301 (2010)] and (ii) [Singh, Pfeifer, and Vidal, Phys. Rev. B 83, 115125 (2011)], we described how to incorporate a global internal symmetry into a generic tensor network algorithm based on decomposing and manipulating tensors that are invariant under the symmetry. In (i) we considered a generic symmetry group
G that is compact, completely reducible, and multiplicity free, acting as a global internal symmetry. Then, in (ii) we described the implementation of Abelian group symmetries in much more detail, considering a U(1) symmetry (e.g., conservation of global particle number) as a concrete example. In this paper, we describe the implementation of non-Abelian group symmetries in great detail. For concreteness, we consider an SU(2) symmetry (e.g., conservation of global quantum spin). Our formalism can be readily extended to more exotic symmetries associated with conservation of total fermionic or anyonic charge. As a practical demonstration, we describe the SU(2)-invariant version of the multiscale entanglement renormalization ansatz and apply it to study the low-energy spectrum of a quantum spin chain with a global SU(2) symmetry.
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. In a recent paper [Phys. Rev. A 82, 050301 (2010)] we discussed how to incorporate a global internal symmetry, given by a compact, completely reducible group
G, into tensor network decompositions and algorithms. Here we specialize to the case of Abelian groups and, for concreteness, to a U(1) symmetry, associated, e.g., with particle number conservation. We consider tensor networks made of tensors that are invariant (or covariant) under the symmetry, and explain how to decompose and manipulate such tensors in order to exploit their symmetry. In numerical calculations, the use of U(1)-symmetric tensors allows selection of a specific number of particles, ensures the exact preservation of particle number, and significantly reduces computational costs. We illustrate all these points in the context of the multiscale entanglement renormalization Ansatz.
When leaving classical physics and entering the realm of quantum physics, there are many new concepts being introduced. One of the most fundamental ideas in quantum mechanics is that particles no longer have exact known positions, but instead expected values and prob- abilities. This leads to the phenomena of truly identical particles, since they no longer can be distinguished simply by their positions. An important property differentiating different kinds of particles is how a system behaves when two such identical particles are exchanged. Historically, this divided particles into bosons and fermions, corresponding to symmetry and antisymmetry under an exchange. However, in two dimensions a new type of particle appears. These particles are called anyons, and behave differently when particles are exchanged. Anyons can be further divided into abelian and non-abelian anyons, of which this thesis will focus on the latter. The ex- changes can then be represented by the fundamental group of the configuration space of the particles, and in two dimensions this fundamental group is the braid group. Using rotors from a Clifford algebra and studying excitations of Majorana fermions, this thesis will show a way to calculate the exchange matrices of non-abelian anyons, and their corresponding eigenvalues. Furthermore, suggestions on a generalization of this framework along with areas where it can be applied are given.
Abstract Anyon models are algebraic structures that model universal topological properties in topological phases of matter and can be regarded as mathematical characterization of topological order in two spacial dimensions. It is conjectured that every anyon model, or mathematically unitary modular tensor category, can be realized as the representation category of some chiral conformal field theory, or mathematically vertex operator algebra/local conformal net. This conjecture is known to be true for abelian anyon models providing support for the conjecture. We reexamine abelian anyon models from several different angles. First anyon models are algebraic data for both topological quantum field theories and chiral conformal field theories. While it is known that each abelian anyon model can be realized by a quantum abelian Chern–Simons (CS) theory and chiral conformal field theory, the construction is not algorithmic. Our goal is to provide such an explicit algorithm for a K -matrix in CS theory and a positive definite even one for a lattice conformal field theory. Secondly anyon models and chiral conformal field theories underlie the bulk-edge correspondence for topological phases of matter. But there are interesting subtleties in this correspondence when stability of the edge theory and topological symmetry are taken into consideration. Therefore, our focus is on the algorithmic reconstruction of extremal chiral conformal field theories with small central charges. Finally we conjecture that a much stronger reconstruction holds for abelian anyon models: every abelian anyon model can be realized as the representation category of some non-lattice extremal vertex operator algebra generalizing the moonshine realization of the trivial anyon model.
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. We discuss how to incorporate a global symmetry, given by a compact, completely reducible group
G, in tensor network decompositions and algorithms. This is achieved by considering tensors that are invariant under the action of the group
G. Each symmetric tensor decomposes into two types of tensors: degeneracy tensors, containing all the degrees of freedom, and structural tensors, which only depend on the symmetry group. In numerical calculations, the use of symmetric tensors ensures the preservation of the symmetry, allows selection of a specific symmetry sector, and significantly reduces computational costs. On the other hand, the resulting tensor network can be interpreted as a superposition of exponentially many spin networks. Spin networks are used extensively in loop quantum gravity, where they represent states of quantum geometry. Our work highlights their importance in the context of tensor network algorithms as well, thus setting the stage for cross-fertilization between these two areas of research.