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

arXiv:2403.04980 · Physical Review Letters

Photonic Simulation of Majorana-Based Jones Polynomials

Jia-Kun Li, Kai Sun, Ze-Yan Hao, Jia-He Liang, Si-Jing Tao, Jiannis K. Pachos, Jin‐Shi Xu, Yong‐Jian Han, Chuan-Feng Li, Guang‐Can Guo

Published Dec 5, 2024• 9 citations
arXivHTMLPDF

Abstract

By braiding non-Abelian anyons it is possible to realize fault-tolerant quantum algorithms through the computation of Jones polynomials. So far, this has been an experimentally formidable task. In this Letter, a photonic quantum system employing two-photon correlations and nondissipative imaginary-time evolution is utilized to simulate two inequivalent braiding operations of Majorana zero modes. The resulting amplitudes are shown to be mathematically equivalent to Jones polynomials. The high fidelity of our optical platform allows us to distinguish between a wide range of links, such as Hopf links, Solomon links, Trefoil knots, Figure Eight knots and Borromean rings, through determining their corresponding Jones polynomials. Our photonic quantum simulator represents a significant step towards executing fault-tolerant quantum algorithms based on topological quantum encoding and manipulation.

DOI
10.1103/physrevlett.133.230603

Related papers

Experimental simulation of Majorana-based quantum computation

Jin‐Shi Xu, Kai Sun, Jiannis K. Pachos +3 more

Topological quantum computation aims to employ anyonic quasiparticles with exotic braiding statistics to encode and manipulate quantum information in a fault-tolerant way. Majorana zero modes are experimentally the simplest realisation of anyons that can non-trivially process quantum information. However, their braiding evolutions, necessary for realising topological gates, still remain beyond current technologies. Here we report the experimental encoding of four Majorana zero modes in an all-optical quantum simulator that give rise to a fault-tolerant qubit. We experimentally simulate their braiding and demonstrate both the non-Abelian character and the topological nature of the resulting geometric phase. We realise a full set of topological and non-topological gates that can arbitrarily rotate the encoded qubit. As an application, we implement the Deutsch-Jozsa algorithm exclusively by topological gates. Our experiment indicates the intriguing possibility of the experimental simulation of Majorana-based quantum computation with scalable technologies.

•Feb 27, 2017•1 citation

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

Emulating Quantum Teleportation of a Majorana Zero Mode Qubit

He-Liang Huang, Marek Narożniak, Futian Liang +14 more

Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to perform quantum gates. Here we perform a quantum simulation of topological quantum computing, by teleporting a qubit encoded in the Majorana zero modes of a Kitaev chain. The quantum simulation is performed by mapping the Kitaev chain to its equivalent spin version and realizing the ground states in a superconducting quantum processor. The teleportation transfers the quantum state encoded in the spin-mapped version of the Majorana zero mode states between two Kitaev chains. The teleportation circuit is realized using only braiding operations and can be achieved despite being restricted to Clifford gates for the Ising anyons. The Majorana encoding is a quantum error detecting code for phase-flip errors, which is used to improve the average fidelity of the teleportation for six distinct states from 70.76±0.35% to 84.60±0.11%, well beyond the classical bound in either case.

arXiv:2009.07590•Physical Review Letters•Mar 3, 2021•48 citations

Topological Quantum Computing via Non-Abelian Anyon Braiding and Majorana Modes — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Topological quantum computing uses non-Abelian anyons (Majorana zero modes) for fault-tolerant qubits, with braiding operations encoding quantum gates. | MATH: Braid group \( B_n \) generators satisfy \( \sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1} \); Majorana operators \( \gamma_i \) satisfy \( \{\gamma_i, \gamma_j\} = 2\delta_{ij} \); fusion rules for Ising anyons: \( \sigma \times \sigma = 1 + \psi \), \( \sigma \times \psi = \sigma \), \( \psi \times \psi = 1 \). | CONNECTION: Braid group is deeply linked to the golden ratio via the Temperley-Lieb algebra at \( q = e^{i\pi/5} \), where the Jones polynomial yields \( \tau = (1+\sqrt{5})/2 \approx 1.618 \); Fibonacci anyons have fusion rules \( \tau \times \tau = 1 + \tau \), directly encoding the golden ratio. | DEPTH: 9 — Non-Abelian statistics and braiding are foundational to topological quantum computation, with direct geometric harmony in Fibonacci anyon models. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 22, 2026•0 citations

Nonadiabatic braiding of Majorana modes

Fei Yu, P. Z. Zhao, Jiangbin Gong

The realization and manipulation of Majorana zero modes have drawn significant attention for their crucial role in enabling topological quantum computation. Conventional approaches to the braiding of Majorana zero modes rely on adiabatic processes. In this work, using a composite 2-Kitaev-chain system accommodating Majorana zero modes as a working example, we propose a nonadiabatic and non-Abelian geometry phase-based protocol to execute operations on these Majorana zero modes. This is possible by locally coupling the edge sites of both quantum chains with an embedded lattice defect, successfully simulating the braiding operation of two Majorana modes in a highly nonadiabatic fashion. To further enhance the robustness against control imperfections, we apply a multiple-pulse composite strategy to our quantum chain setting for second-order protection of the braiding operations. Our proposal can also support the fast and robust realization of the $\ensuremath{\pi}/8$ gate, an essential ingredient for universal quantum computation. This work hence offers a potential pathway toward the nonadiabatic and fault-tolerant control of Majorana zero modes.

arXiv:2503.00953•Physical review. B./Physical review. B•Aug 22, 2025•2 citations

Classical simulation of a topological quantum computer

B.O. Field, Tapio Simula

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.

•Feb 17, 2018•1 citation
By braiding non-Abelian anyons it is possible to realize fault-tolerant quantum algorithms through the computation of Jones polynomials. So far, this has been an experimentally formidable task. In this Letter, a photonic quantum system employing two-photon correlations and nondissipative imaginary-time evolution is utilized to simulate two inequivalent braiding operations of Majorana zero modes. The resulting amplitudes are shown to be mathematically equivalent to Jones polynomials. The high fidelity of our optical platform allows us to distinguish between a wide range of links, such as Hopf links, Solomon links, Trefoil knots, Figure Eight knots and Borromean rings, through determining their corresponding Jones polynomials. Our photonic quantum simulator represents a significant step towards executing fault-tolerant quantum algorithms based on topological quantum encoding and manipulation.
Topological quantum computation aims to employ anyonic quasiparticles with exotic braiding statistics to encode and manipulate quantum information in a fault-tolerant way. Majorana zero modes are experimentally the simplest realisation of anyons that can non-trivially process quantum information. However, their braiding evolutions, necessary for realising topological gates, still remain beyond current technologies. Here we report the experimental encoding of four Majorana zero modes in an all-optical quantum simulator that give rise to a fault-tolerant qubit. We experimentally simulate their braiding and demonstrate both the non-Abelian character and the topological nature of the resulting geometric phase. We realise a full set of topological and non-topological gates that can arbitrarily rotate the encoded qubit. As an application, we implement the Deutsch-Jozsa algorithm exclusively by topological gates. Our experiment indicates the intriguing possibility of the experimental simulation of Majorana-based quantum computation with scalable technologies.
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.
Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to perform quantum gates. Here we perform a quantum simulation of topological quantum computing, by teleporting a qubit encoded in the Majorana zero modes of a Kitaev chain. The quantum simulation is performed by mapping the Kitaev chain to its equivalent spin version and realizing the ground states in a superconducting quantum processor. The teleportation transfers the quantum state encoded in the spin-mapped version of the Majorana zero mode states between two Kitaev chains. The teleportation circuit is realized using only braiding operations and can be achieved despite being restricted to Clifford gates for the Ising anyons. The Majorana encoding is a quantum error detecting code for phase-flip errors, which is used to improve the average fidelity of the teleportation for six distinct states from 70.76±0.35% to 84.60±0.11%, well beyond the classical bound in either case.
FINDING: Topological quantum computing uses non-Abelian anyons (Majorana zero modes) for fault-tolerant qubits, with braiding operations encoding quantum gates. | MATH: Braid group Bn B_n Bn​ generators satisfy σiσi+1σi=σi+1σiσi+1 \sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1} σi​σi+1​σi​=σi+1​σi​σi+1​; Majorana operators γi \gamma_i γi​ satisfy {γi,γj}=2δij \{\gamma_i, \gamma_j\} = 2\delta_{ij} {γi​,γj​}=2δij​; fusion rules for Ising anyons: σ×σ=1+ψ \sigma \times \sigma = 1 + \psi σ×σ=1+ψ, σ×ψ=σ \sigma \times \psi = \sigma σ×ψ=σ, ψ×ψ=1 \psi \times \psi = 1 ψ×ψ=1. | CONNECTION: Braid group is deeply linked to the golden ratio via the Temperley-Lieb algebra at q=eiπ/5 q = e^{i\pi/5} q=eiπ/5, where the Jones polynomial yields τ=(1+5)/2≈1.618 \tau = (1+\sqrt{5})/2 \approx 1.618 τ=(1+5​)/2≈1.618; Fibonacci anyons have fusion rules τ×τ=1+τ \tau \times \tau = 1 + \tau τ×τ=1+τ, directly encoding the golden ratio. | DEPTH: 9 — Non-Abelian statistics and braiding are foundational to topological quantum computation, with direct geometric harmony in Fibonacci anyon models. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
The realization and manipulation of Majorana zero modes have drawn significant attention for their crucial role in enabling topological quantum computation. Conventional approaches to the braiding of Majorana zero modes rely on adiabatic processes. In this work, using a composite 2-Kitaev-chain system accommodating Majorana zero modes as a working example, we propose a nonadiabatic and non-Abelian geometry phase-based protocol to execute operations on these Majorana zero modes. This is possible by locally coupling the edge sites of both quantum chains with an embedded lattice defect, successfully simulating the braiding operation of two Majorana modes in a highly nonadiabatic fashion. To further enhance the robustness against control imperfections, we apply a multiple-pulse composite strategy to our quantum chain setting for second-order protection of the braiding operations. Our proposal can also support the fast and robust realization of the $\ensuremath{\pi}/8$ gate, an essential ingredient for universal quantum computation. This work hence offers a potential pathway toward the nonadiabatic and fault-tolerant control of Majorana zero modes.
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.