Related papers: Robust Universal Braiding with Non-semisimple Isin…

Braiding defects in topological stabiliser codes can be used to fault-tolerantly implement logical operations. Twists are defects corresponding to the end-points of domain walls and are associated with symmetries of the anyon model of the…

Motivated by their central role in fault-tolerant quantum computation, we study the sets of gates of the third-level of the Clifford hierarchy and their distinguished subsets of `nearly diagonal' semi-Clifford gates. The Clifford hierarchy…

In this paper we will present some ideas to use 3D topology for quantum computing extending ideas from a previous paper. Topological quantum computing used \textquotedblleft knotted\textquotedblright{} quantum states of topological phases…

Even-denominator quantum Hall states can host several types of anyons with distinct exchange statistics. Depending on the anyon type, exchanging two quasiparticles can impart a phase to the many-body wave function or even transform it into…

We demonstrate that the two inequivalent spinor representations of the braid group \B_{2n+2}, describing the exchanges of 2n+2 non-Abelian Ising anyons in the Pfaffian topological quantum computer, are equivalent from computational point of…

In topologically-protected quantum computation, quantum gates can be carried out by adiabatically braiding two-dimensional quasiparticles, reminiscent of entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)], as well…

The aim of this paper is to analyse algorithms for constructing presentations of graph braid groups from the point of view of anyonic quantum statistics on graphs. In the first part of this paper, we provide a comprehensive review of an…

Topological phases in two dimensions support anyonic quasiparticle excitations that obey neither bosonic nor fermionic statistics. These anyon structures often carry global symmetries that relate distinct anyons with similar fusion and…

We consider topological quantum computation (TQC) with a particular class of anyons that are believed to exist in the Fractional Quantum Hall Effect state at Landau level filling fraction nu=5/2. Since the braid group representation…

We introduce the notion of a braided Lie algebra consisting of a finite-dimensional vector space $\CL$ equipped with a bracket $[\ ,\ ]:\CL\tens\CL\to \CL$ and a Yang-Baxter operator $\Psi:\CL\tens\CL\to \CL\tens\CL$ obeying some axioms. We…

Non-Abelian topological order (TO) is a coveted state of matter with remarkable properties, including quasiparticles that can remember the sequence in which they are exchanged. These anyonic excitations are promising building blocks of…

We propose a dual-architecture quantum simulation framework for modeling morphisms and stability conditions in the bounded derived category $\mathbf{D}^b(\mathrm{Coh}(X))$, with applications to D-brane physics on K\"ahler and non-K\"ahler…

Non-Abelian states of matter, in which the final state depends on the order of the interchanges of two quasiparticles, can encode information immune from environmental noise with the potential to provide a robust platform for topological…

Classical simulation of quantum circuits plays a crucial role in validating quantum hardware and delineating the boundaries of quantum advantage. Among the most effective simulation techniques are those based on the stabilizer extent, which…

The associative Cayley-Dickson algebras over the field of real numbers are also Clifford algebras. The alternative but nonassociative real Cayley-Dickson algebras, notably the octonions and split octonions, share with Clifford algebras an…

In this paper is shown an application of Clifford algebras to the construction of computationally universal sets of quantum gates for $n$-qubit systems. It is based on the well-known application of Lie algebras together with the especially…

Anyons exhibit a non-trivial interplay between local exclusion rules and non-local braiding and exchange phases, making a consistent commutation algebra and second-quantized formulation challenging. We develop an algebraic framework for…

Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep…

Large language models suffer from "hallucinations"-logical inconsistencies induced by semantic noise. We propose that current architectures operate in a "Metric Phase," where causal order is vulnerable to spontaneous symmetry breaking.…

Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in…