n-particle quantum statistics on graphs
arXiv:1304.5781 · doi:10.1007/s00220-014-2091-0
Abstract
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.
34 pages, 21 figures
References in corpus (3)
Cited by in corpus (16)
- Topological Exchange Statistics in One Dimension
- Non-abelian Quantum Statistics on Graphs
- Particle creation and annihilation at interior boundaries: One-dimensional models
- Edge stabilization in the homology of graph braid groups
- A Generalization of the One-Dimensional Boson-Fermion Duality Through the Path-Integral Formalism
- Geometric presentations of braid groups for particles on a graph
- A quantum-network approach to spin interferometry driven by Abelian and non-Abelian fields
- Non-abelian anyons on graphs from presentations of graph braid groups
- Universal properties of anyon braiding on one-dimensional wire networks
- Novel quantum phases on graphs using abelian gauge theory
- Instantons and Berry's connections on quantum graph
- Quantum Walk on Orbit Spaces
- Compatibility of Braiding and Fusion on Wire Networks
- Approximate Hofstadter- and Kapit-Mueller-like parent Hamiltonians for Laughlin states on fractals
- Extending the planar theory of anyons to quantum wire networks
- Correspondence of topological classification between quantum graph extra dimension and topological matter