Computing Defects Associated to Bounded Domain Wall Structures: The Case
arXiv:1901.08069 · doi:10.1088/1751-8121/ab7d60
Abstract
A domain wall structure consists of a planar graph with faces labeled by fusion categories/topological phases. Edges are labeled by bimodules/domain walls. When the vertices are labeled by point defects we get a compound defect. We present an algorithm, called the domain wall structure algorithm, for computing the compound defect. We apply this algorithm to show that the \emph{bimodule associator}, related to the obstruction of [Etingof et al., Quantum Topol. 1, 209 (2010), arXiv:0909.3140], is trivial for all domain walls of . In the language of this paper, the ground states of the Levin-Wen model are compound defects. We use this to define a generalization of the Levin-Wen model with domain walls and point defects. The domain wall structure algorithm can be used to compute the ground states of these generalized Levin-Wen type models.
16+10 pages, 7 tables, comments welcome
References in corpus (35)
- Fault-tolerant quantum computation by anyons
- Topological quantum memory
- String-net condensation: A physical mechanism for topological phases
- Quantum Error Correction for Quantum Memories
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Building logical qubits in a superconducting quantum computing system
- Symmetry Fractionalization, Defects, and Gauging of Topological Phases
- Models for gapped boundaries and domain walls
- Topological Order with a Twist: Ising Anyons from an Abelian Model
- TFT construction of RCFT correlators I: Partition functions
- Implementing a strand of a scalable fault-tolerant quantum computing fabric
- Quantum memories at finite temperature
- Theory of defects in Abelian topological states
- Bicategories for boundary conditions and for surface defects in 3-d TFT
- Poking holes and cutting corners to achieve Clifford gates with the surface code
- Quantum Measurements and Gates by Code Deformation
- Fault-tolerant logical gates in quantum error-correcting codes
- Topological color code and symmetry-protected topological phases
- On Gauging Symmetry of Modular Categories
- Crystalline topological phases as defect networks
- Gapped boundaries, group cohomology and fault-tolerant logical gates
- The boundaries and twist defects of the color code and their applications to topological quantum computation
- Universal Quantum Computation with Gapped Boundaries
- The blob complex
- On Defects Between Gapped Boundaries in Two-Dimensional Topological Phases of Matter
- Anomalies and entanglement renormalization
- Flux-fusion anomaly test and bosonic topological crystalline insulators
- On the Brauer groups of symmetries of abelian Dijkgraaf-Witten theories
- Tensor Networks with a Twist: Anyon-permuting domain walls and defects in PEPS
- Entropic Barriers for Two-Dimensional Quantum Memories
- About several classes of bi-orthogonal polynomials and discrete integrable systems
- Fusing Binary Interface Defects in Topological Phases: The case
- Domain walls in topological phases and the Brauer-Picard ring for
- Fusion Rules for Permutation Gauging
Cited by in corpus (6)
- Computing data for Levin-Wen with defects
- Computing associators of endomorphism fusion categories
- Invertible bimodule categories and generalized Schur orthogonality
- Low-overhead quantum computing with the color code
- Bulk-to-boundary anyon fusion from microscopic models
- Universal fault tolerant quantum computation in 2D without getting tied in knots