Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Stochastic Analysis

Covariant Anyons via Mackey Machinery

Radhakrishnan Balu

Published Jan 25, 2024• 0 citations
Publisher

Abstract

We obtain relativistically consistent description of anyons, that are relevant in topological quantum computation, via subfactors.We proceed with the construction of a Hilbert space for space-like particles and build composite particles by permutations to form hyperfinite factors from a little group and the whole Poincaré group via the Mackey machinery.This leads to a subfactor via Jones basic construction.With the identification of modular data associated with the subfactor we have a description of anyons in terms of rational conformal field theory that is relativistically consistent.

DOI
10.31390/josa.4.4.02

Related papers

Covariant Quantum Fields via Lorentz Group Representation of Weyl Operators

Radhakrishnan Balu

The building blocks of Hudson-Parthasarathy quantum stochastic calculus start with Weyl operators on a symmetric Fock space. To realize a relativistically covariant version of the calculus we construct representations of Poincare group in terms of Weyl operators on suitably constructed, Bosonic or Fermionic based on the mass and spin of the fundamental particle, Fock spaces. We proceed by describing the orbits of homogeneous Lorentz group on R4 and build fiber bundle representations of Poincaré group induced from the stabilizer subgroups (little groups) and build the Boson Fock space of the Hilbert space formed from the sections of the bundle. Our Weyl operators are constructed on symmetric Fock space of this space and the corresponding annihilation, creation, and conservation operators are synthesized in the usual fashion in relativistic theories for space-like, time-like, and light-like fields. We achieve this by constructing transitive systems of imprimitivity (second-quantized SI), which are dynamical systems with trajectories dense in the configuration space, by induced representations. We provide the details of the field operators for the case of massive Bosons as the rest are similar in construction and indicate the ways to construct adapted processes paving way for building covariant quantum stochastic calculus.

arXiv:1908.09180•Aug 24, 2019•0 citations

Computational power of anyons

Jiannis K. Pachos

Topological quantum computation encodes and manipulates information by exclusively employing anyons. To study the computational power of anyons we plan to look into their fusion and braiding properties in a systematic way. This will allow us to identify a Hilbert space, where quantum information can be encoded fault-tolerantly. We also identify unitary evolutions that serve as logical gates. It is an amazing fact that fundamental properties, such as particle statistics, can be employed to perform quantum computation. As we shall see below, the resilience of these intrinsic particle properties against environmental perturbations is responsible for the fault-tolerance of topological quantum computation. Anyons are physically realised as quasiparticles in topological systems. Most of the quasiparticle details are not relevant for the description of anyons. This provides an additional resilience of topological quantum computation against errors in the control of the quasiparticles. In particular, the principles of topological quantum computation are independent of the underlying physical system. We therefore do not discuss its properties in this chapter. The abstraction might create a conceptual vacuum as many intrinsic properties of the system might appear to be absent. For example, we shall not be concerned with the trapping and transport of anyons or with geometrical characteristics of their evolutions. In this chapter we treat anyons as classical fundamental particles, with internal quantum degrees of freedom, much like the spin. Moreover, we assume that we have complete control over the topological system, in terms of initial-state preparation and final-state identification.

Cambridge University Press eBooks•Apr 12, 2012•0 citations

Topological quantum computation on supersymmetric spin chains

Indrajit Jana, Filippo Montorsi, Pramod Padmanabhan +1 more

Abstract Quantum gates built out of braid group elements form the building blocks of topological quantum computation. They have been extensively studied in SU(2)k quantum group theories, a rich source of examples of non-Abelian anyons such as the Ising (k = 2), Fibonacci (k = 3) and Jones-Kauffman (k = 4) anyons. We show that the fusion spaces of these anyonic systems can be precisely mapped to the product state zero modes of certain Nicolai-like supersymmetric spin chains. As a result, we can realize the braid group in terms of the product state zero modes of these supersymmetric systems. These operators kill all the other states in the Hilbert space, thus preventing the occurrence of errors while processing information, making them suitable for quantum computing.

arXiv:2209.03822•Journal of High Energy Physics•Feb 27, 2023•2 citations

Pauli topological subsystem codes from Abelian anyon theories

Tyler D. Ellison, Yu-An Chen, Arpit Dua +3 more

We construct Pauli topological subsystem codes characterized by arbitrary two-dimensional Abelian anyon theories–this includes anyon theories with degenerate braiding relations and those without a gapped boundary to the vacuum. Our work both extends the classification of two-dimensional Pauli topological subsystem codes to systems of composite-dimensional qudits and establishes that the classification is at least as rich as that of Abelian anyon theories. We exemplify the construction with topological subsystem codes defined on four-dimensional qudits based on the Z4(1) anyon theory with degenerate braiding relations and the chiral semion theory–both of which cannot be captured by topological stabilizer codes. The construction proceeds by "gauging out" certain anyon types of a topological stabilizer code. This amounts to defining a gauge group generated by the stabilizer group of the topological stabilizer code and a set of anyonic string operators for the anyon types that are gauged out. The resulting topological subsystem code is characterized by an anyon theory containing a proper subset of the anyons of the topological stabilizer code. We thereby show that every Abelian anyon theory is a subtheory of a stack of toric codes and a certain family of twisted quantum doubles that generalize the double semion anyon theory. We further prove a number of general statements about the logical operators of translation invariant topological subsystem codes and define their associated anyon theories in terms of higher-form symmetries.

arXiv:2211.03798•Quantum•Oct 12, 2023•41 citations

Introduction to topological quantum computation with non-Abelian anyons

Bernard Field, Tapio Simula

Abstract Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots. In addition to simulating a modular circuit-style quantum algorithm, we also show how the magnitude of the Jones polynomial at specific points could be obtained exactly using Fibonacci or Ising anyons. Such an exact algorithm seems ideally suited for a proof of concept demonstration of a topological quantum computer.

arXiv:1802.06176•Quantum Science and Technology•Jun 6, 2018•135 citations

Diagonal Coset Approach to Topological Quantum Computation with Fibonacci Anyons

Lachezar S. Georgiev, Ludmil K. Hadjiivanov, Grigori Matein

We investigate a promising conformal field theory realization scheme for topological quantum computation based on the Fibonacci anyons, which are believed to be realized as quasiparticle excitations in the $\mathbb{Z}_3$ parafermion fractional quantum Hall state in the second Landau level with filling factor $ν=12/5$. These anyons are non-Abelian and are known to be capable of universal topological quantum computation. The quantum information is encoded in the fusion channels of pairs of such non-Abelian anyons and is protected from noise and decoherence by the topological properties of these systems.The quantum gates are realized by braiding of these anyons. We propose here an implementation of the $n$-qubit topological quantum register in terms of $2n+2$ Fibonacci anyons. The matrices emerging from the anyon exchanges, i.e. the generators of the braid group for one qubit are derived from the coordinate wave functions of a large number of electron holes and 4 Fibonacci anyons which can furthermore be represented as correlation functions in $\mathbb{Z}_3$ parafermionic two-dimensional conformal field theory. The representations of the braid groups for more than 4 anyons are obtained by fusing pairs of anyons before braiding, thus reducing eventually the system to 4 anyons.

arXiv:2404.01779•Apr 2, 2024•0 citations
We obtain relativistically consistent description of anyons, that are relevant in topological quantum computation, via subfactors.We proceed with the construction of a Hilbert space for space-like particles and build composite particles by permutations to form hyperfinite factors from a little group and the whole Poincaré group via the Mackey machinery.This leads to a subfactor via Jones basic construction.With the identification of modular data associated with the subfactor we have a description of anyons in terms of rational conformal field theory that is relativistically consistent.
The building blocks of Hudson-Parthasarathy quantum stochastic calculus start with Weyl operators on a symmetric Fock space. To realize a relativistically covariant version of the calculus we construct representations of Poincare group in terms of Weyl operators on suitably constructed, Bosonic or Fermionic based on the mass and spin of the fundamental particle, Fock spaces. We proceed by describing the orbits of homogeneous Lorentz group on R4 and build fiber bundle representations of Poincaré group induced from the stabilizer subgroups (little groups) and build the Boson Fock space of the Hilbert space formed from the sections of the bundle. Our Weyl operators are constructed on symmetric Fock space of this space and the corresponding annihilation, creation, and conservation operators are synthesized in the usual fashion in relativistic theories for space-like, time-like, and light-like fields. We achieve this by constructing transitive systems of imprimitivity (second-quantized SI), which are dynamical systems with trajectories dense in the configuration space, by induced representations. We provide the details of the field operators for the case of massive Bosons as the rest are similar in construction and indicate the ways to construct adapted processes paving way for building covariant quantum stochastic calculus.
Topological quantum computation encodes and manipulates information by exclusively employing anyons. To study the computational power of anyons we plan to look into their fusion and braiding properties in a systematic way. This will allow us to identify a Hilbert space, where quantum information can be encoded fault-tolerantly. We also identify unitary evolutions that serve as logical gates. It is an amazing fact that fundamental properties, such as particle statistics, can be employed to perform quantum computation. As we shall see below, the resilience of these intrinsic particle properties against environmental perturbations is responsible for the fault-tolerance of topological quantum computation. Anyons are physically realised as quasiparticles in topological systems. Most of the quasiparticle details are not relevant for the description of anyons. This provides an additional resilience of topological quantum computation against errors in the control of the quasiparticles. In particular, the principles of topological quantum computation are independent of the underlying physical system. We therefore do not discuss its properties in this chapter. The abstraction might create a conceptual vacuum as many intrinsic properties of the system might appear to be absent. For example, we shall not be concerned with the trapping and transport of anyons or with geometrical characteristics of their evolutions. In this chapter we treat anyons as classical fundamental particles, with internal quantum degrees of freedom, much like the spin. Moreover, we assume that we have complete control over the topological system, in terms of initial-state preparation and final-state identification.
Abstract Quantum gates built out of braid group elements form the building blocks of topological quantum computation. They have been extensively studied in SU(2)k quantum group theories, a rich source of examples of non-Abelian anyons such as the Ising (k = 2), Fibonacci (k = 3) and Jones-Kauffman (k = 4) anyons. We show that the fusion spaces of these anyonic systems can be precisely mapped to the product state zero modes of certain Nicolai-like supersymmetric spin chains. As a result, we can realize the braid group in terms of the product state zero modes of these supersymmetric systems. These operators kill all the other states in the Hilbert space, thus preventing the occurrence of errors while processing information, making them suitable for quantum computing.
We construct Pauli topological subsystem codes characterized by arbitrary two-dimensional Abelian anyon theories–this includes anyon theories with degenerate braiding relations and those without a gapped boundary to the vacuum. Our work both extends the classification of two-dimensional Pauli topological subsystem codes to systems of composite-dimensional qudits and establishes that the classification is at least as rich as that of Abelian anyon theories. We exemplify the construction with topological subsystem codes defined on four-dimensional qudits based on the Z4(1) anyon theory with degenerate braiding relations and the chiral semion theory–both of which cannot be captured by topological stabilizer codes. The construction proceeds by "gauging out" certain anyon types of a topological stabilizer code. This amounts to defining a gauge group generated by the stabilizer group of the topological stabilizer code and a set of anyonic string operators for the anyon types that are gauged out. The resulting topological subsystem code is characterized by an anyon theory containing a proper subset of the anyons of the topological stabilizer code. We thereby show that every Abelian anyon theory is a subtheory of a stack of toric codes and a certain family of twisted quantum doubles that generalize the double semion anyon theory. We further prove a number of general statements about the logical operators of translation invariant topological subsystem codes and define their associated anyon theories in terms of higher-form symmetries.
Abstract Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows for universal quantum computation by particle exchange or braiding alone is the Fibonacci anyon model. One classically hard problem that can be solved efficiently using quantum computation is finding the value of the Jones polynomial of knots at roots of unity. We aim to provide a pedagogical, self-contained, review of topological quantum computation with Fibonacci anyons, from the braiding statistics and matrices to the layout of such a computer and the compiling of braids to perform specific operations. Then we use a simulation of a topological quantum computer to explicitly demonstrate a quantum computation using Fibonacci anyons, evaluating the Jones polynomial of a selection of simple knots. In addition to simulating a modular circuit-style quantum algorithm, we also show how the magnitude of the Jones polynomial at specific points could be obtained exactly using Fibonacci or Ising anyons. Such an exact algorithm seems ideally suited for a proof of concept demonstration of a topological quantum computer.
We investigate a promising conformal field theory realization scheme for topological quantum computation based on the Fibonacci anyons, which are believed to be realized as quasiparticle excitations in the Z3\mathbb{Z}_3Z3​ parafermion fractional quantum Hall state in the second Landau level with filling factor ν=12/5ν=12/5ν=12/5. These anyons are non-Abelian and are known to be capable of universal topological quantum computation. The quantum information is encoded in the fusion channels of pairs of such non-Abelian anyons and is protected from noise and decoherence by the topological properties of these systems.The quantum gates are realized by braiding of these anyons. We propose here an implementation of the nnn-qubit topological quantum register in terms of 2n+22n+22n+2 Fibonacci anyons. The matrices emerging from the anyon exchanges, i.e. the generators of the braid group for one qubit are derived from the coordinate wave functions of a large number of electron holes and 4 Fibonacci anyons which can furthermore be represented as correlation functions in Z3\mathbb{Z}_3Z3​ parafermionic two-dimensional conformal field theory. The representations of the braid groups for more than 4 anyons are obtained by fusing pairs of anyons before braiding, thus reducing eventually the system to 4 anyons.