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:1703.08666 · Quantum Information Processing

Efficient deterministic secure quantum communication protocols using multipartite entangled states

Dintomon Joy, Supin P Surendran, M Sabir

Published May 9, 2017• 36 citations
arXivHTMLPDF
DOI
10.1007/s11128-017-1613-z

Related papers

An Improved Protocol for Controlled Deterministic Secure Quantum Communication Using Five-Qubit Entangled State

Shih-Hung Kao, Jason Lin, Chia‐Wei Tsai +1 more

International Journal of Theoretical Physics•Mar 10, 2018•0 citations

An Efficient and Novel Semi-Quantum Deterministic Secure Quantum Communication Protocol

Xiaoxue Zhang, Ri‐Gui Zhou

International Journal of Theoretical Physics•Mar 31, 2022•7 citations

Efficient protocols for unidirectional and bidirectional controlled deterministic secure quantum communication: different alternative approaches

Anirban Pathak

arXiv:1411.6430•Quantum Information Processing•Mar 4, 2015•38 citations

Quantum Entanglement Allocation through a Central Hub

Yu-Ao Chen, Xia Liu, Chenghong Zhu +3 more

Establishing a fully functional quantum internet relies on the efficient allocation of multipartite entangled states, which enables advanced quantum communication protocols, secure multipartite quantum key distribution, and distributed quantum computing. In this work, we propose local operations and classical communication (LOCC) protocols for allocating generalized $N$-qubit W states within a centralized hub architecture, where the central hub node preshares Bell states with each end node. We develop a detailed analysis of the optimality of the resources required for our proposed W-state allocation protocol and the previously proposed GHZ-state protocol. Our results show that these protocols deterministically and exactly distribute states using only $N$ qubits of quantum memory within the central system, with communication costs of $2N - 2$ and $N$ classical bits for the W and GHZ states, respectively. These resource-efficient LOCC protocols are further proven to be optimal within the centralized hub architecture, outperforming conventional teleportation protocols for entanglement distribution in both memory and communication costs. Our results provide a more resource-efficient method for allocating essential multipartite entangled states in quantum networks, paving the way for the realization of a quantum internet with enhanced efficiency.

arXiv:2409.08173•Sep 12, 2024•0 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

Quasi-Deterministic Secure Quantum Communication Using Non-maximally Entangled States

Vijayaraj Sujan, S. Balakrishnan, Krishnamoorthy Senthilnathan

arXiv:1912.03498•International Journal of Theoretical Physics•Jan 1, 2021•1 citation
Establishing a fully functional quantum internet relies on the efficient allocation of multipartite entangled states, which enables advanced quantum communication protocols, secure multipartite quantum key distribution, and distributed quantum computing. In this work, we propose local operations and classical communication (LOCC) protocols for allocating generalized NNN-qubit W states within a centralized hub architecture, where the central hub node preshares Bell states with each end node. We develop a detailed analysis of the optimality of the resources required for our proposed W-state allocation protocol and the previously proposed GHZ-state protocol. Our results show that these protocols deterministically and exactly distribute states using only NNN qubits of quantum memory within the central system, with communication costs of 2N−22N - 22N−2 and NNN classical bits for the W and GHZ states, respectively. These resource-efficient LOCC protocols are further proven to be optimal within the centralized hub architecture, outperforming conventional teleportation protocols for entanglement distribution in both memory and communication costs. Our results provide a more resource-efficient method for allocating essential multipartite entangled states in quantum networks, paving the way for the realization of a quantum internet with enhanced efficiency.
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.