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:2201.11923 · Physical Review A

Quantum teleportation using Ising anyons

Cheng-Qian Xu, D. L. Zhou

Published Jul 8, 2022• 9 citations
arXivHTMLPDF

Abstract

Anyons have been extensively investigated as information carriers in topological quantum computation. However, how to characterize the information flow in quantum networks composed of anyons is less understood, which motivates us to study quantum communication protocols in anyonic systems. Here we propose a general topologically protected protocol for quantum teleportation based on the Ising anyon model and prove that with our protocol an unknown anyonic state of any number of Ising anyons can be teleported from Alice to Bob. Our protocol naturally generalizes quantum state teleportation from systems of locally distinguishable particles to systems of Ising anyons, which may promote our understandings of anyonic quantum entanglement as a quantum resource. In addition, our protocol is expected to be realized with the Majorana zero modes, one of the possible physical realizations for the Ising anyon in experiments.

DOI
10.1103/physreva.106.012413

Related papers

Topological Quantum Teleportation and Superdense Coding -- Without Braiding

Sachin J. Valera

We present the teleportation and superdense coding protocols for a family of anyon theories coming from Tambara-Yamagami categories, of which the lowest rank theories describe Ising anyons. In contrast to the usual approach to anyonic computation, we relax the requirement that we should be able to braid anyons. This is motivated by the goal of designing basic protocols that require less control over quasiparticles, and which may therefore be amenable to realisation in near-term systems. Since these implementations are braid-free, they are also compatible with Majorana modes on a 1d quantum wire.

arXiv:2303.17700•Mar 30, 2023•0 citations

Measurement-only topological quantum computation via tunable interactions

Parsa Bonderson

I examine, in general, how tunable interactions may be used to perform anyonic teleportation and generate braiding transformations for non-Abelian anyons. I explain how these methods are encompassed by the ``measurement-only'' approach to topological quantum computation. The physically most relevant example of Ising anyons or Majorana zero modes is considered in detail, particularly in the context of Majorana nanowires.

arXiv:1210.7929•Physical Review B•Jan 10, 2013•61 citations

Quantum teleportation of a spin-mapped Majorana zero mode qubit

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

Quantum error correction is widely considered to be an essential ingredient for overcoming decoherence and achieving large-scale quantum computation. 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 demonstrate in a superconducting quantum processor that the spin-mapped version of the Majorana zero modes can be used to perform quantum teleportation. The teleportation transfers the quantum state encoded on two-qubit Majorana zero mode states between two Kitaev chains, using only braiding operations. 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 \pm 0.35 \% $ to $84.60 \pm 0.11 \%$, well beyond the classical bound in either case.

•Sep 16, 2020•0 citations

Teleportation of quantum coherence

S Sohail, Arun Kumar Pati, Vijeth Aradhya +2 more

We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a lesser number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a non-maximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's lab in terms of the composition of the completely positive maps corresponding to the shared resource state and joint POVM performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is possible perfectly with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with the Werner states and show that even when the Werner states become separable, the amount of teleported coherence is non-zero, implying the possibility of teleportation of coherence without entanglement.

arXiv:2302.11499•Feb 22, 2023•0 citations

TERNARY QUANTUM LOGIC APPROACHES FOR CONTROLLED TELEPORTATION VIA ENTANGLEMENT SWAPPING

Muhammad Ali

Quantum teleportation stands as a cornerstone of quantum communication, enabling the transmission of an unknown quantum state—typically a qubit—from a sender to a receiver without the physical transfer of the particle itself. In this study, we explore two novel teleportation protocols within the framework of ternary quantum logic, which extends conventional binary systems by incorporating three distinct quantum states, known as qutrits. This ternary paradigm introduces richer computational possibilities and more nuanced entanglement structures compared to binary logic. Both protocols incorporate a supervisory controller to regulate the transmission. The first proposed scheme utilizes entanglement swapping between two qutrits to achieve the teleportation of a qutrit. This approach demonstrates the feasibility of ternary teleportation using minimal entangled resources. The second scheme builds upon this foundation by employing entanglement swapping among three qutrits, offering enhanced control. In the second scheme, the controller remains actively embedded in the quantum circuit throughout the protocol, with the authority to abort or validate the teleportation either at the beginning of protocol or at the end, thereby introducing dynamic control. Direct entanglement between distant parties like Alice and Bob is often infeasible due to channel noise and losses, but using an intermediary party who shares entangled pairs with each party, enables long-distance entanglement, which is crucial for scalable quantum networks and quantum repeaters. This modular approach not only enhances the security and reliability of quantum communication by managing errors locally but also offers flexibility and practicality in real-world systems by facilitating entanglement through local intermediaries.

International Journal of Apllied Mathematics•Nov 16, 2025•0 citations

Teleportation of quantum coherence

S Sohail, Arun Kumar Pati, Vijeth Aradhya +2 more

We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a smaller number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a nonmaximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's laboratory in terms of the composition of the completely positive maps corresponding to the shared resource state and a joint positive operator-valued measure (POVM) performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is perfectly possible with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with Werner states and show that even when Werner states become separable, the amount of teleported coherence is nonzero, implying the possibility of teleportation of coherence without entanglement.

Physical Review A•Oct 26, 2023•20 citations
Anyons have been extensively investigated as information carriers in topological quantum computation. However, how to characterize the information flow in quantum networks composed of anyons is less understood, which motivates us to study quantum communication protocols in anyonic systems. Here we propose a general topologically protected protocol for quantum teleportation based on the Ising anyon model and prove that with our protocol an unknown anyonic state of any number of Ising anyons can be teleported from Alice to Bob. Our protocol naturally generalizes quantum state teleportation from systems of locally distinguishable particles to systems of Ising anyons, which may promote our understandings of anyonic quantum entanglement as a quantum resource. In addition, our protocol is expected to be realized with the Majorana zero modes, one of the possible physical realizations for the Ising anyon in experiments.
We present the teleportation and superdense coding protocols for a family of anyon theories coming from Tambara-Yamagami categories, of which the lowest rank theories describe Ising anyons. In contrast to the usual approach to anyonic computation, we relax the requirement that we should be able to braid anyons. This is motivated by the goal of designing basic protocols that require less control over quasiparticles, and which may therefore be amenable to realisation in near-term systems. Since these implementations are braid-free, they are also compatible with Majorana modes on a 1d quantum wire.
Quantum error correction is widely considered to be an essential ingredient for overcoming decoherence and achieving large-scale quantum computation. 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 demonstrate in a superconducting quantum processor that the spin-mapped version of the Majorana zero modes can be used to perform quantum teleportation. The teleportation transfers the quantum state encoded on two-qubit Majorana zero mode states between two Kitaev chains, using only braiding operations. 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 \pm 0.35 \% $ to 84.60±0.11%84.60 \pm 0.11 \%84.60±0.11%, well beyond the classical bound in either case.
We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a lesser number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a non-maximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's lab in terms of the composition of the completely positive maps corresponding to the shared resource state and joint POVM performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is possible perfectly with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with the Werner states and show that even when the Werner states become separable, the amount of teleported coherence is non-zero, implying the possibility of teleportation of coherence without entanglement.
Quantum teleportation stands as a cornerstone of quantum communication, enabling the transmission of an unknown quantum state—typically a qubit—from a sender to a receiver without the physical transfer of the particle itself. In this study, we explore two novel teleportation protocols within the framework of ternary quantum logic, which extends conventional binary systems by incorporating three distinct quantum states, known as qutrits. This ternary paradigm introduces richer computational possibilities and more nuanced entanglement structures compared to binary logic. Both protocols incorporate a supervisory controller to regulate the transmission. The first proposed scheme utilizes entanglement swapping between two qutrits to achieve the teleportation of a qutrit. This approach demonstrates the feasibility of ternary teleportation using minimal entangled resources. The second scheme builds upon this foundation by employing entanglement swapping among three qutrits, offering enhanced control. In the second scheme, the controller remains actively embedded in the quantum circuit throughout the protocol, with the authority to abort or validate the teleportation either at the beginning of protocol or at the end, thereby introducing dynamic control. Direct entanglement between distant parties like Alice and Bob is often infeasible due to channel noise and losses, but using an intermediary party who shares entangled pairs with each party, enables long-distance entanglement, which is crucial for scalable quantum networks and quantum repeaters. This modular approach not only enhances the security and reliability of quantum communication by managing errors locally but also offers flexibility and practicality in real-world systems by facilitating entanglement through local intermediaries.
We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a smaller number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a nonmaximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's laboratory in terms of the composition of the completely positive maps corresponding to the shared resource state and a joint positive operator-valued measure (POVM) performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is perfectly possible with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with Werner states and show that even when Werner states become separable, the amount of teleported coherence is nonzero, implying the possibility of teleportation of coherence without entanglement.