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:2411.15077 · The European Physical Journal Plus

Constructing multipartite planar maximally entangled states from phase states and quantum secret sharing protocol

Laila Bouhouch, Yassine Dakir, Abdallah Slaoui, R. Ahl Laamara

Published Feb 22, 2025• 2 citations
arXivHTMLPDF
DOI
10.1140/epjp/s13360-025-06118-1

Related papers

Quantum Secret Sharing Protocol Using Maximally Entangled Multi-qudit States

Mostafa Mansour, Zakaria Dahbi

International Journal of Theoretical Physics•Nov 5, 2020•35 citations

Probabilistic teleportation of shared high-dimensional multi-particle secrets

Yang Liu, Min Jiang

Quantum secret-sharing is a fundamental technique in quantum communication and plays a crucial role in high-dimensional quantum secret transmission. This paper investigates the teleportation of arbitrary d-dimensional multipartite quantum secrets and proposes both deterministic and probabilistic teleportation protocols. The schemes employ generalized Bell-state measurements, generalized Pauli operators, and auxiliary particles to achieve efficient and secure quantum secret-sharing. The deterministic protocol employs maximally entangled channels to achieve perfect sharing with unit success probability. Moreover, the probabilistic protocol, assisted by auxiliary particles and generalized unitary operations, achieves perfect fidelity quantum secret sharing via non-maximally entangled channels. The protocols are further extended to arbitrary d-dimensional systems, and their robustness under several common quantum noise models is analyzed numerically. Compared with previous schemes, the proposed protocols support arbitrary multipartite entangled states, high-dimensional systems, non-maximally entangled channels, and noise analysis within a unified framework. These results enrich the theory of high-dimensional quantum communication and provide practical approaches for future quantum secret-sharing and secure quantum networks.

Journal of the Optical Society of America B•Sep 4, 2026•0 citations

Entanglement sharing protocol via quantum error-correcting codes

Ran Hee Choi, Ben Fortescue, Gilad Gour +1 more

We introduce a multiparty cryptographic protocol, which we call entanglement sharing schemes, wherein a dealer retains half of a maximally entangled bipartite state and encodes the other half into a multipartite state that is distributed among multiple players. In a close analog to quantum secret sharing, some subsets of players can recover maximal entanglement with the dealer whereas other subsets can recover no entanglement (though they may retain classical correlations with the dealer). We find a lower bound on the share size for such schemes and construct two nontrivial examples based on Shor's $[[9,1,3]]$ and the $[[4,2,2]]$ stabilizer code; we further demonstrate how other examples may be obtained from quantum error correcting codes through classical encryption. Finally, we demonstrate that entanglement sharing schemes can be applied to characterize leaked information in quantum ramp secret sharing.

arXiv:1212.4217•Physical Review A•Mar 15, 2013•7 citations

Construct Multipartite Maximally Entangled State via Recurrence Relation

Junling Che, Hao Wu

International Journal of Theoretical Physics•Nov 15, 2018•11 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•4 citations

A novel and efficient multiparty quantum secret sharing scheme using entangled states

Massoud Hadian Dehkordi, Fattahi Elham

Science China Physics Mechanics and Astronomy•May 30, 2012•40 citations
Quantum secret-sharing is a fundamental technique in quantum communication and plays a crucial role in high-dimensional quantum secret transmission. This paper investigates the teleportation of arbitrary d-dimensional multipartite quantum secrets and proposes both deterministic and probabilistic teleportation protocols. The schemes employ generalized Bell-state measurements, generalized Pauli operators, and auxiliary particles to achieve efficient and secure quantum secret-sharing. The deterministic protocol employs maximally entangled channels to achieve perfect sharing with unit success probability. Moreover, the probabilistic protocol, assisted by auxiliary particles and generalized unitary operations, achieves perfect fidelity quantum secret sharing via non-maximally entangled channels. The protocols are further extended to arbitrary d-dimensional systems, and their robustness under several common quantum noise models is analyzed numerically. Compared with previous schemes, the proposed protocols support arbitrary multipartite entangled states, high-dimensional systems, non-maximally entangled channels, and noise analysis within a unified framework. These results enrich the theory of high-dimensional quantum communication and provide practical approaches for future quantum secret-sharing and secure quantum networks.
We introduce a multiparty cryptographic protocol, which we call entanglement sharing schemes, wherein a dealer retains half of a maximally entangled bipartite state and encodes the other half into a multipartite state that is distributed among multiple players. In a close analog to quantum secret sharing, some subsets of players can recover maximal entanglement with the dealer whereas other subsets can recover no entanglement (though they may retain classical correlations with the dealer). We find a lower bound on the share size for such schemes and construct two nontrivial examples based on Shor's [[9,1,3]][[9,1,3]][[9,1,3]] and the [[4,2,2]][[4,2,2]][[4,2,2]] stabilizer code; we further demonstrate how other examples may be obtained from quantum error correcting codes through classical encryption. Finally, we demonstrate that entanglement sharing schemes can be applied to characterize leaked information in quantum ramp secret sharing.
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.