arXiv subjects

Robert N. C. Pfeifer

Publications and source records attributed to Robert N. C. Pfeifer.

At least 19 recordsLinked to original sources

arXiv2017

Phase transitions on a ladder of braided non-Abelian anyons

Non-Abelian anyons can exist as point-like particles in two-dimensional systems, and have particle exchange statistics which are neither bosonic nor fermionic. Like in spin systems, the role of fusion (Heisenberg-like) interactions between anyons has been well studied. However, unlike our understanding of the role of bosonic and fermionic statistics in the formation of different quantum phases of matter, little is known concerning the effect of non-Abelian anyonic statistics. We explore this physics using an anyonic Hubbard model on a two-legged ladder which includes braiding and nearest neighbour Heisenberg interactions among anyons. We study two of the most prominent non-Abelian anyon models: the Fibonacci and Ising type. We discover rich phase diagrams for both anyon models, and show the different roles of their fusion and braid statistics.

cond-mat.str-el↗

arXiv2016

Simulation of braiding anyons using Matrix Product States

Anyons exist as point like particles in two dimensions and carry braid statistics which enable interactions that are independent of the distance between the particles. Except for a relatively few number of models which are analytically tractable, much of the physics of anyons remain still unexplored. In this paper, we show how U(1)-symmetry can be combined with the previously proposed anyonic Matrix Product States to simulate ground states and dynamics of anyonic systems on a lattice at any rational particle number density. We provide proof of principle by studying itinerant anyons on a one dimensional chain where no natural notion of braiding arises and also on a two-leg ladder where the anyons hop between sites and possibly braid. We compare the result of the ground state energies of Fibonacci anyons against hardcore bosons and spinless fermions. In addition, we report the entanglement entropies of the ground states of interacting Fibonacci anyons on a fully filled two-leg ladder at different interaction strength, identifying gapped or gapless points in the parameter space. As an outlook, our approach can also prove useful in studying the time dynamics of a finite number of nonabelian anyons on a finite two-dimensional lattice.

cond-mat.str-el↗

arXiv2015

Finite Density Matrix Renormalisation Group Algorithm for Anyonic Systems

The numerical study of anyonic systems is known to be highly challenging due to their non-bosonic, non-fermionic particle exchange statistics, and with the exception of certain models for which analytical solutions exist, very little is known about their collective behaviour as a result. Meanwhile, the density matrix renormalisation 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 both in terms of 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 TEBD algorithm and superior to the variationally optimised anyonic MERA, at far lesser computational cost.

cond-mat.str-el↗

arXiv2015

Improving the efficiency of variational tensor network algorithms

We present several results relating to the contraction of generic tensor networks and discuss their application to the simulation of quantum many-body systems using variational approaches based upon tensor network states. Given a closed tensor network $\mathcal{T}$, we prove that if the environment of a single tensor from the network can be evaluated with computational cost $κ$, then the environment of any other tensor from $\mathcal{T}$ can be evaluated with identical cost $κ$. Moreover, we describe how the set of all single tensor environments from $\mathcal{T}$ can be simultaneously evaluated with fixed cost $3κ$. The usefulness of these results, which are applicable to a variety of tensor network methods, is demonstrated for the optimization of a Multi-scale Entanglement Renormalization Ansatz (MERA) for the ground state of a 1D quantum system, where they are shown to substantially reduce the computation time.

cond-mat.str-el↗

arXiv2015

Faster identification of optimal contraction sequences for tensor networks

The efficient evaluation of tensor expressions involving sums over multiple indices is of significant importance to many fields of research, including quantum many-body physics, loop quantum gravity, and quantum chemistry. The computational cost of evaluating an expression may depend strongly upon the order in which the index sums are evaluated, and determination of the operation-minimising contraction sequence for a single tensor network (single term, in quantum chemistry) is known to be NP-hard. The current preferred solution is an exhaustive search, using either an iterative depth-first approach with pruning or dynamic programming and memoisation, but these approaches are impractical for many of the larger tensor network Ansaetze encountered in quantum many-body physics. We present a modified search algorithm with enhanced pruning which exhibits a performance increase of several orders of magnitude while still guaranteeing identification of an optimal operation-minimising contraction sequence for a single tensor network. A reference implementation for MATLAB, compatible with the ncon() and multienv() network contractors of arXiv:1402.0939 and arXiv:1310.8023 respectively, is supplied.

cond-mat.str-el↗

arXiv2015

Phase diagram for hard-core $\mathbb{Z}_3$ anyons on the ladder

Studies of free particles in low-dimensional quantum systems such as two-leg ladders provide insight into the influence of statistics on collective behaviour. The behaviours of bosons and fermions are well understood, but two-dimensional systems also admit excitations with alternative statistics known as anyons. Numerical analysis of hard-core $\mathbb{Z}_3$ anyons on the ladder reveals qualitatively distinct behaviour, including a novel phase transition associated with crystallisation of hole degrees of freedom into a periodic foam. Qualitative predictions are extrapolated for all Abelian $\mathbb{Z}_q$ anyon models.

cond-mat.str-el↗

arXiv2015

NCON: A tensor network contractor for MATLAB

A fundamental process in the implementation of any numerical tensor network algorithm is that of contracting a tensor network. In this process, a network made up of multiple tensors connected by summed indices is reduced to a single tensor or a number by evaluating the index sums. This article presents a MATLAB function ncon(), or "Network CONtractor", which accepts as its input a tensor network and a contraction sequence describing how this network may be reduced to a single tensor or number. As its output it returns that single tensor or number. The function ncon() may be obtained by downloading the source of this preprint.

physics.comp-ph↗

arXiv2015

Symmetry-Protected Local Minima in Infinite DMRG

The infinite Density Matrix Renormalisation Group (iDMRG) algorithm is a highly successful numerical algorithm for the study of low-dimensional quantum systems, and is also frequently used to initialise the more popular finite DMRG algorithm. Implementations of both finite and infinite DMRG frequently incorporate support for the protection and exploitation of symmetries of the Hamiltonian. In common with other variational tensor network algorithms, convergence of iDMRG to the ground state is not guaranteed, with the risk that the algorithm may become stuck in a local minimum. In this paper I demonstrate the existence of a particularly harmful class of physically irrelevant local minima affecting both iDMRG and to a lesser extent also infinite Time-Evolving Block Decimation (iTEBD), for which the ground state is compatible with the protected symmetries of the Hamiltonian but cannot be reached using the conventional iDMRG or iTEBD algorithms. I describe a modified iDMRG algorithm which evades these local minima, and which also admits a natural interpretation on topologically ordered systems with a boundary.

cond-mat.str-el↗

arXiv2014

Measures of entanglement in non-Abelian anyonic systems

Bipartite entanglement entropies, calculated from the reduced density matrix of a subsystem, provide a description of the resources available within a system for performing quantum information processing. However, these quantities are not uniquely defined on a system of non-Abelian anyons. This paper describes how reduced density matrices and bipartite entanglement entropies (such as the von Neumann and Renyi entropies) may be constructed for non-Abelian anyonic systems, in ways which reduce to the conventional definitions for systems with only local degrees of freedom.

quant-ph↗

arXiv2013

Matrix product states for anyonic systems and efficient simulation of dynamics

Matrix product states (MPS) have proven to be a very successful tool to study lattice systems with local degrees of freedom such as spins or bosons. Topologically ordered systems can support anyonic particles which are labeled by conserved topological charges and collectively carry non-local degrees of freedom. In this paper we extend the formalism of MPS to lattice systems of anyons. The anyonic MPS is constructed from tensors that explicitly conserve topological charge. We describe how to adapt the time-evolving block decimation (TEBD) algorithm to the anyonic MPS in order to simulate dynamics under a local and charge-conserving Hamiltonian. To demonstrate the effectiveness of anyonic TEBD algorithm, we used it to simulate (i) the ground state (using imaginary time evolution) of an infinite 1D critical system of (a) Ising anyons and (b) Fibonacci anyons both of which are well studied, and (ii) the real time dynamics of an anyonic Hubbard-like model of a single Ising anyon hopping on a ladder geometry with an anyonic flux threading each island of the ladder. Our results pertaining to (ii) give insight into the transport properties of anyons. The anyonic MPS formalism can be readily adapted to study systems with conserved symmetry charges, as this is equivalent to a specialization of the more general anyonic case.

cond-mat.str-el↗

arXiv2012

Translation invariance, topology, and protection of criticality in chains of interacting anyons

Using finite size scaling arguments, the critical properties of a chain of interacting anyons can be extracted from the low energy spectrum of a finite system. In Phys. Rev. Lett. 98, 160409 (2007), Feiguin et al. showed that an antiferromagnetic (AFM) chain of Fibonacci anyons on a torus is in the same universality class as the tricritical Ising model, and that criticality is protected by a topological symmetry. In the present paper we first review the graphical formalism for the study of anyons on the disc and demonstrate how this formalism may be consistently extended to the study of systems on surfaces of higher genus. We then employ this graphical formalism to study finite rings of interacting anyons on both the disc and the torus, and show that analysis on the disc necessarily yields an energy spectrum which is a subset of that which is obtained on the torus. For a critical Hamiltonian, one may extract from this subset the scaling dimensions of the local scaling operators which respect the topological symmetry of the system. Related considerations are also shown to apply for open chains.

cond-mat.str-el↗

arXiv2012

Classification of topological symmetry sectors on anyon rings

The golden chain with antiferromagnetic interaction is an anyonic system of particular interest as when all anyons are confined to the chain, it is readily stabilised against fluctuations away from criticality. However, additional local scaling operators have recently been identified on the disc which may give rise to relevant fluctuations in the presence of free charges. Motivated by these results for Fibonacci anyons, this paper presents a systematic method of identifying all topological sectors of local scaling operators for critical anyon rings of arbitrary winding number on surfaces of arbitrary genus, extending the original classification scheme proposed in Feiguin et al. (2007). Using the new scheme it is then shown that for the golden chain, additional relevant scaling operators exist on the torus which are equivalent to those detected on the disc, and which may disrupt the stability of the critical system. Protection of criticality against perturbations generated by these additional scaling operators can be achieved by suppressing the exchange of charge between the anyon ring and the rest of the manifold.

cond-mat.str-el↗

arXiv2012

Simulation of Anyons Using Symmetric Tensor Network Algorithms

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.

cond-mat.str-el↗

arXiv2010

Tensor network decompositions in the presence of a global 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. 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 also in the context of tensor network algorithms, thus setting the stage for cross-fertilization between these two areas of research.

cond-mat.str-el↗

arXiv2010

Simulation of anyons with tensor network algorithms

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.

cond-mat.str-el↗

arXiv2010

Tensor network states and algorithms in the presence of a global U(1) 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 [arXiv:0907.2994v1] 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, often associated 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 multi-scale entanglement renormalization ansatz.

cond-mat.str-el↗

arXiv2009

Entanglement renormalization, scale invariance, and quantum criticality

The use of entanglement renormalization in the presence of scale invariance is investigated. We explain how to compute an accurate approximation of the critical ground state of a lattice model, and how to evaluate local observables, correlators and critical exponents. Our results unveil a precise connection between the multi-scale entanglement renormalization ansatz (MERA) and conformal field theory (CFT). Given a critical Hamiltonian on the lattice, this connection can be exploited to extract most of the conformal data of the CFT that describes the model in the continuum limit.

cond-mat.str-el↗

arXiv2009

Momentum of an electromagnetic wave in dielectric media

Almost a hundred years ago, two different expressions were proposed for the energy--momentum tensor of an electromagnetic wave in a dielectric. Minkowski's tensor predicted an increase in the linear momentum of the wave on entering a dielectric medium, whereas Abraham's tensor predicted its decrease. Theoretical arguments were advanced in favour of both sides, and experiments proved incapable of distinguishing between the two. Yet more forms were proposed, each with their advocates who considered the form that they were proposing to be the one true tensor. This paper reviews the debate and its eventual conclusion: that no electromagnetic wave energy--momentum tensor is complete on its own. When the appropriate accompanying energy--momentum tensor for the material medium is also considered, experimental predictions of all the various proposed tensors will always be the same, and the preferred form is therefore effectively a matter of personal choice.

physics.class-ph↗