Robert N. C. Pfeifer

Robert N. C. Pfeifer

Auto-generated profile, based on publicly available information

Robert N. C. Pfeifer

Perimeter Institute for Theoretical Physics 31 Caroline St. N N2L 2Y5 Waterloo ON Canada

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2007 in Reviews of Modern Physics
Verified
Journal Article
Closed access
PDF file
RPRobert N. C. Pfeifer
Robert N. C. Pfeifer
TNTimo A. Nieminen
Timo A. Nieminen
NHNorman R. Heckenberg
Norman R. Heckenberg
HRHalina Rubinsztein-Dunlop
Halina Rubinsztein-Dunlop
Almost 100years 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 favor 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 various proposed tensors will always be the same, and the preferred form is therefore effectively a matter of personal choice.

15 March 2011 in Physical Review B
Verified
Journal Article
Closed access
SSSukhwinder Singh
Sukhwinder Singh
RPRobert N. C. Pfeifer
Robert N. C. Pfeifer
GVGuifre Vidal
Guifre Vidal
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.

8 November 2010 in Physical Review A
Verified
Journal Article
Closed access
SSSukhwinder Singh
Sukhwinder Singh
RPRobert N. C. Pfeifer
Robert N. C. Pfeifer
GVGuifré Vidal
Guifré Vidal
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.

6 April 2009 in Physical Review A
Verified
Journal Article
Closed access
PDF file
RPRobert N. C. Pfeifer
Robert N. C. Pfeifer
GEGlen Evenbly
Glen Evenbly
GVGuifré Vidal
Guifré Vidal
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 multiscale entanglement renormalization ansatz 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.

31 March 2009 in Reviews of Modern Physics
Verified
Journal Article
Closed access
PDF file
RPRobert N. C. Pfeifer
Robert N. C. Pfeifer
TNTimo A. Nieminen
Timo A. Nieminen
NHNorman R. Heckenberg
Norman R. Heckenberg
HRHalina Rubinsztein-Dunlop
Halina Rubinsztein-Dunlop
DOI:https://doi.org/10.1103/RevModPhys.81.443

30 September 2014 in Physical Review E
Verified
Journal Article
Closed access
PDF file
RPRobert N. C. Pfeifer
Robert N. C. Pfeifer
JHJutho Haegeman
Jutho Haegeman
FVFrank Verstraete
Frank Verstraete
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 on the order in which the index sums are evaluated, and determination of the operation-minimizing 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 memoization, but these approaches are impractical for many of the larger tensor network ansätze 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-minimizing 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 Evenbly and Pfeifer, Phys. Rev. B 89, 245118 (2014), respectively, is supplied.