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:quant-ph/0002032 · Physical Review A

Teleportation and secret sharing with pure entangled states

Somshubhro Bandyopadhyay

Published Jun 15, 2000• 248 citations
arXivHTMLPDF

Abstract

We present two optimal methods of teleporting an unknown qubit using any pure entangled state. We also discuss how such methods can also have successful application in quantum secret sharing with pure multipartite entangled states.
DOI
10.1103/physreva.62.012308

Related papers

Qubit assisted Conclusive Teleportation

Somshubhro Bandyopadhyay

We present an optimal method for teleporting an unknown qubit using any pure entangled state.

arXiv:quant-ph/9907010•Jul 4, 1999•0 citations

Multipartite Entanglement: Transformations, Quantum Secret Sharing, Quantum Error Correction

Wolfram Helwig

Most applications in quantum information processing make either explicit or implicit use of entanglement. It is thus important to have a good understanding of entanglement and the role it plays in these protocols. However, especially when it comes to multipartite entanglement, there still remain a lot of mysteries. This thesis is devoted to getting a better understanding of multipartite entanglement, and its role in various quantum information protocols.\n\nFirst, we investigate transformations between multipartite entangled states that only use local operations and classical communication (LOCC). We mostly focus on three qubit states in the GHZ class, and derive upper and lower bounds for the successful transformation probability between two states.\n\nWe then focus on absolutely maximally entangled (AME) states, which are highly entangled multipartite states that have the property that they are maximally entangled for any bipartition. With them as a resource, we develop new parallel teleportation protocols, which can then be used to implement quantum secret sharing (QSS) schemes. We further prove the existence of AME states for any number of parties, if the dimension of the involved quantum systems is chosen appropriately. An equivalence between threshold QSS schemes and AME states shared between an even number of parties is established, and further protocols are designed, such as constructing ramp QSS schemes and open-destination teleportation protocols with AME states as a resource.\n\nAs a framework to work with AME states, graph states are explored. They allow for efficient bipartite entanglement verification, which makes them a promising candidate for the description of AME states. We show that for all currently known AME states, absolutely maximally entangled graph states can be found, and we were even able to use graph states to find a new AME state for seven three-dimensional systems (qutrits). In addition, the implementation of QSS schemes from AME states can be conveniently described within the graph state formalism.\n\nFinally, we use the insight gained from entanglement in QSS schemes to derive necessary and sufficient conditions for quantum erasure channel and quantum error correction codes that satisfy the quantum Singleton bound, as these codes are closely related to ramp QSS schemes. This provides us with a very intuitive approach to codes for the quantum erasure channel, purely based on the entanglement required to protect information against losses by use of the parallel teleportation protocol.

•Mar 27, 2014•3 citations

Quantum teleportation of an entangled state

Manzoor Ikram, Shi-Yao Zhu, Muhammad Suhail Zubairy

We consider the teleportation of entangled two-particle and multiparticle states and present a scheme for the teleportation that may be suitable for both entangled atomic states or field states inside high-Q cavities.

Physical Review A•Jul 14, 2000•176 citations

Conclusive bidirectional quantum teleportation of arbitrary unknown single-particle states in amplitude-damping channel

Yimamujiang Aisan, Nueraminaimu Maihemuti, Peng Jia-yin +1 more

In this paper, two conclusive bidirectional quantum teleportation (BQT) schemes in an amplitude damping channel are put forward. These schemes, respectively, exchange two arbitrary single-qubit states and two arbitrary single-qutrit states between two users, where both users act as senders and receivers. To achieve this, the detailed procedures for using entanglement compensation in an amplitude damped channel to share pure entangled quantum states between two users are first proposed. Then, using the pure entangled four-qubit (or four-qutrit) state shared between the users as a quantum channel, the secret quantum information of each user, i.e. the single-qubit state (or single-qutrit state), is teleported to the other user. This teleportation is designed in such a way that the information can be probabilistically reconstructed by introducing an auxiliary qubit (or qutrit) and executing proper unitary transformations by the receiver. The research results indicate that, whether in single-qubit or single-qutrit state BQT schemes, the success probability of the receiver restoring secret quantum information is determined only by the smaller absolute value of the coefficients characterizing the quantum channel. Additionally, regardless of the noise intensity in the amplitude damping channel, the fidelity of each quantum state transmitted in our BQT schemes can reach 1, which is unattainable in existing BQT schemes based on noisy environments.

International Journal of Quantum Information•Mar 6, 2025•9 citations

Entanglement, Einstein-Podolsky-Rosen steering and cryptographical applications

Ioannis Kogias

This PhD Dissertation collects results of my own work on the topic of continuous variable (CV) quantum teleportation, which is one of the most important applications of quantum entanglement, as well as on the understanding, quantification, detection, and applications of a type of quantum correlations known as Einstein-Podolsky-Rosen (EPR) steering, for both bipartite and multipartite systems and with a main focus on CV systems. For the first results, we examine and compare two fundamentally different teleportation schemes; the well-known continuous variable scheme of Vaidman, Braunstein and Kimble, and a recently proposed hybrid scheme by Andersen and Ralph. We analyse the teleportation of ensembles of arbitrary pure single-mode Gaussian states using these schemes and compare their performance against classical strategies that utilize no entanglement (benchmarks). Our analysis brings into question any advantage due to non-Gaussianity for quantum teleportation of Gaussian states. For the second part of the results, we study bipartite EPR-steering. We propose a novel powerful method to detect steering in quantum systems of any dimension in a systematic and hierarchical way. Our method includes previous results of the literature as special cases on one hand, and goes beyond them on the other. We proceed to the quantification of steering-type correlations, and introduce a measure of steering for arbitrary bipartite Gaussian states, prove many useful properties, and provide with an operational interpretation of the proposed measure in terms of the key rate in one-sided device independent quantum key distribution. Finally, we show how the Gaussian steering measure gives a lower bound to a more general quantifier of which Gaussian states are proven to be extremal. We proceed to the study of multipartite steering, and derive laws for the distribution of Gaussian steering among different parties in multipartite Gaussian states. We define an indicator of collective steering-type correlations, which is interpreted operationally in terms of the guaranteed secret key rate in the multi-party cryptographic task of quantum secret sharing. The final results look at the cryptographical task of quantum secret sharing, whose security has remained unproven almost two decades after its original conception. By utilizing intuition and ideas from steering, we manage to establish for the first time an unconditional security proof for CV entanglement-based quantum secret sharing schemes, and demonstrate their practical feasibility. Our results establish quantum secret sharing as a viable and practically relevant primitive for quantum communication technologies.

•Dec 14, 2016•0 citations

Schemes for Teleportation of an Unknown Single-Qubit Quantum State by Using an Arbitrary High-Dimensional Entangled State

詹佑邦, 张群永, 王郁武 +1 more

Chinese Physics Letters•Jan 1, 2010•0 citations
Most applications in quantum information processing make either explicit or implicit use of entanglement. It is thus important to have a good understanding of entanglement and the role it plays in these protocols. However, especially when it comes to multipartite entanglement, there still remain a lot of mysteries. This thesis is devoted to getting a better understanding of multipartite entanglement, and its role in various quantum information protocols.\n\nFirst, we investigate transformations between multipartite entangled states that only use local operations and classical communication (LOCC). We mostly focus on three qubit states in the GHZ class, and derive upper and lower bounds for the successful transformation probability between two states.\n\nWe then focus on absolutely maximally entangled (AME) states, which are highly entangled multipartite states that have the property that they are maximally entangled for any bipartition. With them as a resource, we develop new parallel teleportation protocols, which can then be used to implement quantum secret sharing (QSS) schemes. We further prove the existence of AME states for any number of parties, if the dimension of the involved quantum systems is chosen appropriately. An equivalence between threshold QSS schemes and AME states shared between an even number of parties is established, and further protocols are designed, such as constructing ramp QSS schemes and open-destination teleportation protocols with AME states as a resource.\n\nAs a framework to work with AME states, graph states are explored. They allow for efficient bipartite entanglement verification, which makes them a promising candidate for the description of AME states. We show that for all currently known AME states, absolutely maximally entangled graph states can be found, and we were even able to use graph states to find a new AME state for seven three-dimensional systems (qutrits). In addition, the implementation of QSS schemes from AME states can be conveniently described within the graph state formalism.\n\nFinally, we use the insight gained from entanglement in QSS schemes to derive necessary and sufficient conditions for quantum erasure channel and quantum error correction codes that satisfy the quantum Singleton bound, as these codes are closely related to ramp QSS schemes. This provides us with a very intuitive approach to codes for the quantum erasure channel, purely based on the entanglement required to protect information against losses by use of the parallel teleportation protocol.
In this paper, two conclusive bidirectional quantum teleportation (BQT) schemes in an amplitude damping channel are put forward. These schemes, respectively, exchange two arbitrary single-qubit states and two arbitrary single-qutrit states between two users, where both users act as senders and receivers. To achieve this, the detailed procedures for using entanglement compensation in an amplitude damped channel to share pure entangled quantum states between two users are first proposed. Then, using the pure entangled four-qubit (or four-qutrit) state shared between the users as a quantum channel, the secret quantum information of each user, i.e. the single-qubit state (or single-qutrit state), is teleported to the other user. This teleportation is designed in such a way that the information can be probabilistically reconstructed by introducing an auxiliary qubit (or qutrit) and executing proper unitary transformations by the receiver. The research results indicate that, whether in single-qubit or single-qutrit state BQT schemes, the success probability of the receiver restoring secret quantum information is determined only by the smaller absolute value of the coefficients characterizing the quantum channel. Additionally, regardless of the noise intensity in the amplitude damping channel, the fidelity of each quantum state transmitted in our BQT schemes can reach 1, which is unattainable in existing BQT schemes based on noisy environments.
This PhD Dissertation collects results of my own work on the topic of continuous variable (CV) quantum teleportation, which is one of the most important applications of quantum entanglement, as well as on the understanding, quantification, detection, and applications of a type of quantum correlations known as Einstein-Podolsky-Rosen (EPR) steering, for both bipartite and multipartite systems and with a main focus on CV systems. For the first results, we examine and compare two fundamentally different teleportation schemes; the well-known continuous variable scheme of Vaidman, Braunstein and Kimble, and a recently proposed hybrid scheme by Andersen and Ralph. We analyse the teleportation of ensembles of arbitrary pure single-mode Gaussian states using these schemes and compare their performance against classical strategies that utilize no entanglement (benchmarks). Our analysis brings into question any advantage due to non-Gaussianity for quantum teleportation of Gaussian states. For the second part of the results, we study bipartite EPR-steering. We propose a novel powerful method to detect steering in quantum systems of any dimension in a systematic and hierarchical way. Our method includes previous results of the literature as special cases on one hand, and goes beyond them on the other. We proceed to the quantification of steering-type correlations, and introduce a measure of steering for arbitrary bipartite Gaussian states, prove many useful properties, and provide with an operational interpretation of the proposed measure in terms of the key rate in one-sided device independent quantum key distribution. Finally, we show how the Gaussian steering measure gives a lower bound to a more general quantifier of which Gaussian states are proven to be extremal. We proceed to the study of multipartite steering, and derive laws for the distribution of Gaussian steering among different parties in multipartite Gaussian states. We define an indicator of collective steering-type correlations, which is interpreted operationally in terms of the guaranteed secret key rate in the multi-party cryptographic task of quantum secret sharing. The final results look at the cryptographical task of quantum secret sharing, whose security has remained unproven almost two decades after its original conception. By utilizing intuition and ideas from steering, we manage to establish for the first time an unconditional security proof for CV entanglement-based quantum secret sharing schemes, and demonstrate their practical feasibility. Our results establish quantum secret sharing as a viable and practically relevant primitive for quantum communication technologies.