Related papers: Topological quantum compilation of metaplectic any…
In topology, a torus remains invariant under certain non-trivial transformations known as modular transformations. In the context of topologically ordered quantum states of matter, these transformations encode the braiding statistics and…
We show that quasicrystals exhibit anyonic behavior that can be used for topological quantum computing. In particular, we study a correspondence between the fusion Hilbert spaces of the simplest non-abelian anyon, the Fibonacci anyons, and…
Computing topological invariants of 3-manifolds is generally intractable, yet specialized algebraic structures can enable efficient algorithms. For Witten-Reshetikhin-Turaev (WRT) invariants of torus bundles, we exploit the non-commutative…
Anyon models can be symmetric under some permutations of their topological charges. One can then conceive topological defects that, under monodromy, transform anyons according to a symmetry. We study the realization of such defects in the…
Quantum contextuality, a fundamental feature distinguishing quantum theory from classical models, is investigated via algebraic and topological structures inherent in modular tensor categories. This work rigorously demonstrates that braid…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
Electrons are indivisible elementary particles, yet paradoxically a collection of them can act as a fraction of a single electron, exhibiting exotic and useful properties. One such collective excitation, known as a topological Majorana…
Inspired by non-abelian vortex anyons in spinor Bose-Einstein condensates, we consider the quantum double $\mathcal{D}(Q_8)$ anyon model as a platform to carry out a particular instance of Shor's factorization algorithm. We provide the…
Quantum error correction (QEC) is crucial for realizing scalable quantum technologies, and topological quantum error correction (TQEC) has emerged as the most experimentally advanced paradigm of QEC. Existing homological and topological…
Semiconductor quantum dots offer a promising platform for controlling spin qubits and realizing quantum logic gates, essential for scalable quantum computing. In this work, we utilize a variational quantum compiling algorithm to design…
Semiconductor nanowires provide an ideal platform for various low-dimensional quantum devices. In particular, topological phases of matter hosting non-Abelian quasi-particles can emerge when a semiconductor nanowire with strong spin-orbit…
Due to its potential for implementing a scalable quantum computer, multiqubit Toffoli gate lies in the heart of quantum information processing. In this article, we demonstrate a multiqubit blockade gate with atoms arranged in a…
The anomaly of non-invertible higher-form symmetries is determined by the braiding of topological operators implementing them. In this paper, we study a method to classify braidings on topological line and surface operators by leveraging…
The remarkable complexity of the vacuum state of a topologically-ordered many-body quantum system encodes the character and intricate braiding interactions of its emergent particles, the anyons.} Quintessential predictions exploiting this…
In spacetime dimensions of 4 (i.e., 3+1) and higher, topological orders exhibit spatially extended excitations like loops and membranes, which support diverse topological data characterizing braiding, fusion, and shrinking processes,…
Quantum computation is conventionally performed using quantum operations acting on two-level quantum bits, or qubits. Qubits in modern quantum computers suffer from inevitable detrimental interactions with the environment that cause errors…
Kauffman and Lomonaco explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In the work of G.…
This thesis explains the methods and algorithms we used to obtain explicit F symbols, R symbols, and pivotal coefficients of all multiplicity-free pivotal fusion categories up to rank 7. The thesis starts by introducing the concept of a…
Important developments in fault-tolerant quantum computation using the braiding of anyons have placed the theory of braid groups at the very foundation of topological quantum computing. Furthermore, the realization by Kauffman and Lomonaco…
The braiding of the worldlines of particles restricted to move on a network (graph) is governed by the graph braid group, which can be strikingly different from the standard braid group known from two-dimensional physics. It has been…