Interacting systems of anyons pose a unique challenge to condensed matter simulations due to their non-trivial exchange statistics. These systems are of great interest as they have the potential for robust universal quantum computation, but numerical tools for studying them are as yet limited. We show how existing tensor network algorithms may be adapted for use with systems of anyons, and demonstrate this process for the 1-D Multi-scale Entanglement Renormalisation Ansatz (MERA). We apply the MERA to infinite chains of interacting Fibonacci anyons, computing their scaling dimensions and local scaling operators. The scaling dimensions obtained are seen to be in agreement with conformal field theory. The techniques developed are applicable to any tensor network algorithm, and the ability to adapt these ansaetze for use on anyonic systems opens the door for numerical simulation of large systems of free and interacting anyons in one and two dimensions.
Interacting systems of anyons pose a unique challenge to condensed matter simulations due to their non-trivial exchange statistics. These systems are of great interest as they have the potential for robust universal quantum computation, but numerical tools for studying them are as yet limited. We show how existing tensor network algorithms may be adapted for use with systems of anyons, and demonstrate this process for the 1-D Multi-scale Entanglement Renormalisation Ansatz (MERA). We apply the MERA to infinite chains of interacting Fibonacci anyons, computing their scaling dimensions and local scaling operators. The scaling dimensions obtained are seen to be in agreement with conformal field theory. The techniques developed are applicable to any tensor network algorithm, and the ability to adapt these ansaetze for use on anyonic systems opens the door for numerical simulation of large systems of free and interacting anyons in one and two dimensions.
Interacting systems of anyons pose a unique challenge to condensed-matter simulations due to their nontrivial exchange statistics. These systems are of great interest as they have the potential for robust universal quantum computation but numerical tools for studying them are as yet limited. We show how existing tensor network algorithms may be adapted for use with systems of anyons and demonstrate this process for the one-dimensional multiscale entanglement renormalization ansatz (MERA). We apply the MERA to infinite chains of interacting Fibonacci anyons, computing their scaling dimensions and local scaling operators. The scaling dimensions obtained are seen to be in agreement with conformal field theory. The techniques developed are applicable to any tensor network algorithm, and the ability to adapt these ans\"atze for use on anyonic systems opens the door for numerical simulation of large systems of free and interacting anyons in one and two dimensions.
This thesis reviews the multiscale entanglement renormalisation ansatz or MERA, a numerical tool for the study of quantum many-body systems and a discrete realisation of the AdS/CFT duality. The thesis covers an introduction to the necessary background concepts of entanglement, entanglement entropy and tensor network states, the structure and main features of MERA and its applications in condensed matter theory and holography. Also covered are details on the algorithmic implementation of MERA and some of its generalisations and extensions. MERA belongs to a class of variational ansatze for quantum many-body states known as tensor network states. It is especially well-suited for the study of scale invariant critical points. MERA is based on a real-space renormalisation group procedure called entanglement renormalisation, designed to systematically handle entanglement at different length scales along the coarse-graining flow. Entanglement renormalisation has be used for example to efficiently describe Kitaev states of the toric code, the prime example of topological order, and numerically study the ground state of the highly frustrated spin-1/2 Heisenberg model on a kagome lattice and various other one- and two-dimensional lattice models. The geometric and causal structure of MERA, which underlies its effectiveness as a numerical tool, also makes it a discrete version of the AdS/CFT duality. This duality describes a conformal field theory by a gravity theory in a higher dimensional space, and vice versa. The duality is manifest in the scaling of entanglement entropy in MERA, which is governed by a law highly analogous to the Ryu-Takayanagi formula for holographic entanglement entropy, in the connection between thermal states and a black-hole-like MERA and in the connection between correlation functions and holographic geodesics in a scale invariant MERA. The aim of this thesis is to lead the reader to an understanding of what MERA is, how it works and how it can be used. MERA's core features and uses are presented in a comprehensive and explicit way, and a broad view of possible applications and further directions is given. Plenty of references are also offered to direct the reader to further research on how MERA may relate to his/her interests.
In this thesis, we use the new numerical method multiscale entanglement
renormalization ansatz (MERA) to study the one dimensional spin system. This
method, MERA, utilizes a network of tensors to represent quantum many-body
systems on a lattice. Other examples of tensor network state are matrix product
states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a
tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be-
yond. The three structures dier in the graph that denes how the tensors are
interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are,
respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor
networks the expectation value of local observables can be computed eciently.
Developing algorithms to simulate quantum many-body systems is important
for understanding and studying the physical principles. And these may become
powerful tools for the analysis of quantum computation and quantum information
theory. But in general ecient simulation is dicult, due to the fundamental
quantum physical laws.
The main method we have studied and worked on is multiscale entangle-
ment renormalization ansatz (MERA) which is a variational ansatz for many-
body states. MERA is a tree tensor network for 1D, 2D systems and beyond.
We have developed code of ternary-MERA to compute the ground state energy,
expected values of local observables, and correlators for 1D lattice systems. In
a nutshell, MERA is an algorithm for entanglement renormalization which is a
numerical technique based on locally reorganizing the Hilbert space of a quantum
many-body system with the aim to reduce the amount of entanglement in its wave
function. We use this method to study 1D Ising model, XXZ model, and J1 - J2
model, and then comparing the numerical results with exact diagonalization (ED)
and density matrix renormalization group (DMRG).
In this thesis I develop a formalism whereby a tensor network may be understood in terms of a unitary braided tensor category, and represented in a particularly efficient manner corresponding to the exploitation of this mathematical structure. This approach permits the exploitation of the global Abelian and non-Abelian internal group symmetries of a lattice model, both to facilitate the study of particular symmetry sectors and to provide a considerable reduction in computational cost. It also enables the study of models with non-trivial exchange statistics (fermions, Abelian and non-Abelian anyons) using tensor network algorithms which scale polynomially in the system size.
The numerical study of anyonic systems is known to be highly challenging due to their nonbosonic, nonfermionic particle-exchange statistics, and with the exception of certain models for which analytical solutions exist, very little is known about their collective behavior as a result. Meanwhile, the density matrix renormalization group (DMRG) algorithm is an exceptionally powerful numerical technique for calculating the ground state of a low-dimensional lattice Hamiltonian, and has been applied to the study of bosonic, fermionic, and group-symmetric systems. The recent development of a tensor network formulation for anyonic systems opened up the possibility of studying these systems using algorithms such as DMRG, though this has proved challenging in terms of both programming complexity and computational cost. This paper presents the implementation of DMRG for finite anyonic systems, including a detailed scheme for the implementation of anyonic tensors with optimal scaling of computational cost. The anyonic DMRG algorithm is demonstrated by calculating the ground-state energy of the ``golden chain,'' which has become the benchmark system for the numerical study of anyons and is shown to produce results comparable to those of the anyonic time-evolving block decimation algorithm and superior to the variationally optimized anyonic multiscale renormalization ansatz, at far lesser computational cost.
In this thesis we will summarise recent developments in tensor network methods and extend results for entanglement entropy using cMERA in Lifshitz field theories. After a brief recounting of the important aspects of entanglement entropy we will present a description of pertinent tensor networks. This will include both matrix product states (MPS) and the multi-scale entanglement renormalisation ansatz (MERA). We will recount previous area law results for the entanglement entropy in these ansatze. Following this we will continue to discuss MERA and in particular its continuous realisation (cMERA). Finally we apply this cMERA framework to free field theories and extend known results to the case of field theories with anisotropic scaling, that is, Lifshitz field theories. In particular we find a new result for the entanglement entropy of fermionic theories with anisotropic scaling.