Related papers: Robust Universal Braiding with Non-semisimple Isin…
Onsite gain-loss-induced topological braiding principle of non-Hermitian energy bands is theoretically formulated in multiband lattice models with Hermitian hopping amplitudes. Braid phase transition occurs when the gain-loss parameter is…
The Yang-Baxter equation and it's various forms have applications in many fields, including statistical mechanics, knot theory, and quantum information. Unitary solutions of the braided Yang-Baxter equation are of particular interest as…
We investigate entanglement naturally present in the 1D topologically ordered phase protected with the on-site symmetry group of an octahedron as a potential resource for teleportation-based quantum computation. We show that, as long as…
The structure of quantum mechanics forbids a bipartite scenario for masking quantum information, however, it allows multipartite maskers. The Latin squares are found to be closely related to a series of tripartite maskers. This adds another…
We propose a scheme for scalable and robust quantum computing on two-dimensional arrays of qubits with fixed longitudinal coupling. This opens the possibility for bypassing the device complexity associated with tunable couplers required in…
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…
While the realization of scalable quantum computation will arguably require topological stabilization and, with it, topological-hardware-aware quantum programming and topological-quantum circuit verification, the proper combination of these…
This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…
We analyse the fusion, braiding and scattering properties of discrete non-abelian anyons. These occur in (2+1)-dimensional theories where a gauge group G is spontaneously broken down to some discrete subgroup H. We identify the…
Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of…
Twists are defects in the lattice that can be used to perform encoded computations. Three basic types of twists can be introduced in color codes, namely, twists that permute color, charge of anyons and domino twists that permute the charge…
In universal fault-tolerant quantum computing, implementing logical non-Clifford gates often demands substantial spacetime resources for many error-correcting codes, including the high-threshold surface code. A critical mission for…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical…
Braiding is a geometric concept that manifests itself in a variety of scientific contexts from biology to physics, and has been employed to classify bulk band topology in topological materials. Topological edge states can also form braiding…
We propose a scheme for the fault-tolerant implementation of arbitrary Clifford circuits. To achieve this, we extend previous work on flag gadgets for syndrome extraction to a general framework that flags any Clifford circuit. This…
Recent work suggests that topological features of certain quantum gravity theories can be interpreted as particles, matching the known fermions and bosons of the first generation in the Standard Model. This is achieved by identifying…
We elucidate the geometry of the polynomial formulation of the non-abelian Stueckelberg mechanism. We show that a natural off-shell nilpotent BRST differential exists allowing to implement the constraint on the sigma field by means of BRST…
We present a discussion of the generalized Clifford group over non-cyclic finite abelian groups. These Clifford groups appear naturally in the theory of topological error correction and abelian anyon models. We demonstrate a generalized…
Nonabelian topological orders host exotic anyons central to quantum computing, yet established realizations rely on case-by-case constructions that are often conceptually involved. In this work, we present a systematic construction of…