arXiv:1806.02846 · Communications in Mathematical Physics

Non-abelian Quantum Statistics on Graphs

Tomasz Maciążek, Adam Sawicki

Published Oct 9, 2019• 24 citations

Abstract

Abstract We show that non-abelian quantum statistics can be studied using certain topological invariants which are the homology groups of configuration spaces. In particular, we formulate a general framework for describing quantum statistics of particles constrained to move in a topological spaceX. The framework involves a study of isomorphism classes of flat complex vector bundles over the configuration space ofXwhich can be achieved by determining its homology groups. We apply this methodology for configuration spaces of graphs. As a conclusion, we provide families of graphs which are good candidates for studying simple effective models of anyon dynamics as well as models of non-abelian anyons on networks that are used in quantum computing. These conclusions are based on our solution of the so-called universal presentation problem for homology groups of graph configuration spaces for certain families of graphs.

DOI: 10.1007/s00220-019-03583-5

Related papers

n-Particle Quantum Statistics on Graphs

J. M. Harrison, Jonathan P. Keating, J. M. Robbins +1 more

We develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to the number of particles is proven. For non-planar 3-connected graphs we identify bosons and fermions as the only possible statistics, whereas for planar 3-connected graphs we show that one anyon phase exists. Our approach also yields an alternative proof of the structure theorem for the first homology group of n -particle graph configuration spaces. Finally, we determine the topological gauge potentials for 2-connected graphs.

arXiv:1304.5781Communications in Mathematical PhysicsJun 5, 201426 citations

Non-Abelian Anyons: Statistical Repulsion and Topological Quantum Computation

Viktor Qvarfordt

As opposed to classical mechanics, quantum mechanical particles can be truly identical and lead to new and interesting phenomena. Identical particles can be of different types, determined by their exchange symmetry, which in turn gives rise to statistical repulsion. The exchange symmetry is given by a representation of the exchange group; the fundamental group of the configuration space of identical particles. In three dimensions the exchange group is the permutation group and there are only two types of identical particles; bosons and fermions. While any number of bosons can be at the same place or in the same state, fermions repel each other. In two dimensions the exchange group is the braid group and essentially any exchange symmetry is allowed, such particles are called anyons. Abelian anyons are described by abelian representations of the exchange group and can be seen as giving a continuous interpolation between bosons and fermions. Non-abelian anyons are much more complex and their statistical repulsion is yet largely unexplored. We use the framework of modular tensor categories to show how the statistical repulsion of non-abelian anyons depends on the exchange symmetry. The Fibonacci anyon model is studied, for which explicit results are obtained. We also show how Fibonacci anyons can be used to implement topological quantum computation, providing topologically stable quantum information encoded in the state of non-abelian anyons that can be manipulated via the non-abelian exchange symmetry.

Jan 1, 20173 citations

Graph gauge theory of mobile non-Abelian anyons in a qubit stabilizer code

Yuri D. Lensky, Kostyantyn Kechedzhi, I. L. Aleǐner +1 more

Stabilizer codes allow for non-local encoding and processing of quantum information. Deformations of stabilizer surface codes introduce new and non-trivial geometry, in particular leading to emergence of long sought after objects known as projective Ising non-Abelian anyons. Braiding of such anyons is a key ingredient of topological quantum computation. We suggest a simple and systematic approach to construct effective unitary protocols for braiding, manipulation and readout of non-Abelian anyons and preparation of their entangled states. We generalize the surface code to a more generic graph with vertices of degree 2, 3 and 4. Our approach is based on the mapping of the stabilizer code defined on such a graph onto a model of Majorana fermions charged with respect to two emergent gauge fields. One gauge field is akin to the physical magnetic field. The other one is responsible for emergence of the non-Abelian anyonic statistics and has a purely geometric origin. This field arises from assigning certain rules of orientation on the graph known as the Kasteleyn orientation in the statistical theory of dimer coverings. Each 3-degree vertex on the graph carries the flux of this “Kasteleyn” field and hosts a non-Abelian anyon. In our approach all the experimentally relevant operators are unambiguously fixed by locality, unitarity and gauge invariance. We illustrate the power of our method by making specific prescriptions for experiments verifying the non-Abelian statistics.

arXiv:2210.09282Annals of PhysicsMar 22, 202312 citations

Introduction to topological quantum computation with non-Abelian anyons

Bernard Field, Tapio Simula

Abstract Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots. In addition to simulating a modular circuit-style quantum algorithm, we also show how the magnitude of the Jones polynomial at specific points could be obtained exactly using Fibonacci or Ising anyons. Such an exact algorithm seems ideally suited for a proof of concept demonstration of a topological quantum computer.

arXiv:1802.06176Quantum Science and TechnologyJun 6, 2018135 citations

Topological exchange statistics in one dimension

Nathan L. Harshman, Adam Knapp

The standard topological approach to indistinguishable particles formulates exchange statistics by using the fundamental group to analyze the connectedness of the configuration space. Although successful in two and more dimensions, this approach gives only trivial or near-trivial exchange statistics in one dimension because two-body coincidences are excluded from configuration space. Instead, we include these path-ambiguous singular points and consider configuration space as an orbifold. This orbifold topological approach allows unified analysis of exchange statistics in any dimension and predicts possibilities for anyons in one-dimensional systems, including non-Abelian anyons obeying alternate strand groups. These results clarify the nontopological origin of fractional statistics in one-dimensional anyon models.

arXiv:2108.05653Physical Review AMay 19, 202219 citations

Particle Quantum Statistics

Steven H. Simon

Abstract We introduce the idea of the path integral and use it to study the properties of identical particles under exhange. We explain why the topology of paths through space-time, the fundamental group of the configuration space (the braid group in 2+1 dimensions and the permutation group in 3+1 dimensions) determines the possible particle types. We argue that in 3+1 dimensions one only has bosons and fermions but in 2+1 dimensions other particles, known as anyons, can exist. We describe both the abelian and nonabelian type of anyon and argue why nonabelian anyons could be useful for quantum computation. We introduce the notion of the “quantum dimension” of an anyon which describes the size of the many anyon Hilbert space.

Sep 29, 20230 citations