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/0411191 · Physical Review A

Continuous-variable quantum-state sharing via quantum disentanglement

Andrew M. Lance, Thomas Symul, Warwick P. Bowen, Barry C. Sanders, Tomáš Tyc, Timothy C. Ralph, Ping Koy Lam

Published Mar 24, 2005• 120 citations
arXivHTMLPDF

Abstract

Quantum-state sharing is a protocol where perfect reconstruction of quantum states is achieved with incomplete or partial information in a multipartite quantum network. Quantum-state sharing allows for secure communication in a quantum network where partial information is lost or acquired by malicious parties. This protocol utilizes entanglement for the secret-state distribution and a class of ``quantum disentangling'' protocols for the state reconstruction. We demonstrate a quantum-state sharing protocol in which a tripartite entangled state is used to encode and distribute a secret state to three players. Any two of these players can collaborate to reconstruct the secret state, while individual players obtain no information. We investigate a number of quantum disentangling processes and experimentally demonstrate quantum-state reconstruction using two of these protocols. We experimentally measure a fidelity, averaged over all reconstruction permutations, of $\mathcal{F}=0.73\ifmmode\pm\else\textpm\fi{}0.02$. A result achievable only by using quantum resources.

DOI
10.1103/physreva.71.033814

Related papers

Quantum state sharing

Andrew M. Lance, Thomas Symul, Warwick P. Bowen +2 more

We demonstrate a multipartite protocol that utilizes entanglement to securely distribute and reconstruct a quantum state. A secret quantum state is encoded into a tripartite entangled state and distributed to three players. By collaborating together, a majority of the players can reconstruct the state, whilst the remaining player obtains nothing. This (2,3) threshold quantum state sharing scheme is characterized in terms of fidelity (F), signal transfer (T) and reconstruction noise (V). We demonstrate a fidelity averaged over all reconstruction permutations of 0.73 ± 0.04, a level achievable only using quantum resources.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 25, 2004•4 citations

Quantum secret sharing in tripartite superconducting network

W. K. Yam, C. Wilkinson, S. Gandorfer +6 more

Superconducting microwave quantum networks is a rapidly developing field, enabling distributed quantum computing and holding a promise for hybrid architectures in quantum internet. Quantum secret sharing (QSS) is one of the key protocols for multipartite quantum networks and can provide an unconditionally secure way to share quantum states among $n$ players. Using microwave two-mode squeezed states as an entanglement resource, we experimentally implement a QSS protocol with $n = 3$, where a subset of at least $k = 2$ players must collaborate to faithfully reconstruct the original secret state. We demonstrate reconstructed-state fidelities that surpass the asymptotic no-cloning threshold of $F_\textrm{nc} = 2/3$ and identify a parameter regime that allows for unconditionally secure communication in the presence of an omnipotent dishonest player. Furthermore, we experimentally explore inherent connections between QSS and other important quantum information processing tasks, such as quantum dense coding and elementary quantum error correction of channel erasures. Finally, we discuss extensions of QSS and its relation to the concept of blind quantum computing.

quant-pharXiv:2604.13643•PRX Quantum•Apr 16, 2026•0 citations

Tripartite Quantum State Sharing

Andrew M. Lance, Thomas Symul, Warwick P. Bowen +2 more

We demonstrate a multipartite protocol to securely distribute and reconstruct a quantum state. A secret quantum state is encoded into a tripartite entangled state and distributed to three players. By collaborating, any two of the three players can reconstruct the state, while individual players obtain nothing. We characterize this (2,3) threshold quantum state sharing scheme in terms of fidelity, signal transfer, and reconstruction noise. We demonstrate a fidelity averaged over all reconstruction permutations of 0.73+/-0.04, a level achievable only using quantum resources.

arXiv:quant-ph/0311015•Physical Review Letters•Apr 29, 2004•521 citations

Quantum steering as a resource for secure tripartite quantum state sharing

Cailean Wilkinson, Matthew Thornton, Natalia Korolkova

Quantum state sharing (QSS) is a protocol by which a (secret) quantum state may be securely split into shares, shared between multiple potentially-dishonest players, and reconstructed. Crucially, the players are each assumed to be dishonest, and so QSS requires that only a collaborating authorized subset of players can access the original secret state; any dishonest unauthorized conspiracy cannot reconstruct it. We analyze a QSS protocol involving three untrusted players and demonstrate that quantum steering is the required resource enabling the protocol to proceed securely. We analyze the level of steering required to share any single-mode Gaussian secret which enables the states to be shared with the optimal use of resources.

arXiv:2106.06337•Physical Review A•Jun 1, 2023•11 citations

Unconditional security of entanglement-based continuous-variable quantum secret sharing

Ioannis Kogias, Yu Xiang, Qiongyi He +1 more

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results contribute to validating quantum secret sharing as a viable primitive for quantum technologies.

arXiv:1603.03224•Physical Review A•Jan 12, 2017•192 citations

Unconditional Security of Entanglement-Based Quantum Secret Sharing Schemes

Ioannis Kogias, X. D. Yu, Qiongyi He +1 more

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes against eavesdroppers and dishonest participants remained unproven. Here we establish an unconditional security proof for continuous variable entanglement-based quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players, by utilizing ideas from the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate the practical feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results establish quantum secret sharing as a viable and practically relevant primitive for quantum communication technologies.

•Mar 10, 2016•0 citations
Quantum-state sharing is a protocol where perfect reconstruction of quantum states is achieved with incomplete or partial information in a multipartite quantum network. Quantum-state sharing allows for secure communication in a quantum network where partial information is lost or acquired by malicious parties. This protocol utilizes entanglement for the secret-state distribution and a class of ``quantum disentangling'' protocols for the state reconstruction. We demonstrate a quantum-state sharing protocol in which a tripartite entangled state is used to encode and distribute a secret state to three players. Any two of these players can collaborate to reconstruct the secret state, while individual players obtain no information. We investigate a number of quantum disentangling processes and experimentally demonstrate quantum-state reconstruction using two of these protocols. We experimentally measure a fidelity, averaged over all reconstruction permutations, of F=0.73\ifmmode±\else\textpm\fi0.02\mathcal{F}=0.73\ifmmode\pm\else\textpm\fi{}0.02F=0.73\ifmmode±\else\textpm\fi0.02. A result achievable only by using quantum resources.
We demonstrate a multipartite protocol that utilizes entanglement to securely distribute and reconstruct a quantum state. A secret quantum state is encoded into a tripartite entangled state and distributed to three players. By collaborating together, a majority of the players can reconstruct the state, whilst the remaining player obtains nothing. This (2,3) threshold quantum state sharing scheme is characterized in terms of fidelity (F), signal transfer (T) and reconstruction noise (V). We demonstrate a fidelity averaged over all reconstruction permutations of 0.73 ± 0.04, a level achievable only using quantum resources.
Superconducting microwave quantum networks is a rapidly developing field, enabling distributed quantum computing and holding a promise for hybrid architectures in quantum internet. Quantum secret sharing (QSS) is one of the key protocols for multipartite quantum networks and can provide an unconditionally secure way to share quantum states among nnn players. Using microwave two-mode squeezed states as an entanglement resource, we experimentally implement a QSS protocol with n=3n = 3n=3, where a subset of at least k=2k = 2k=2 players must collaborate to faithfully reconstruct the original secret state. We demonstrate reconstructed-state fidelities that surpass the asymptotic no-cloning threshold of Fnc=2/3F_\textrm{nc} = 2/3Fnc​=2/3 and identify a parameter regime that allows for unconditionally secure communication in the presence of an omnipotent dishonest player. Furthermore, we experimentally explore inherent connections between QSS and other important quantum information processing tasks, such as quantum dense coding and elementary quantum error correction of channel erasures. Finally, we discuss extensions of QSS and its relation to the concept of blind quantum computing.
We demonstrate a multipartite protocol to securely distribute and reconstruct a quantum state. A secret quantum state is encoded into a tripartite entangled state and distributed to three players. By collaborating, any two of the three players can reconstruct the state, while individual players obtain nothing. We characterize this (2,3) threshold quantum state sharing scheme in terms of fidelity, signal transfer, and reconstruction noise. We demonstrate a fidelity averaged over all reconstruction permutations of 0.73+/-0.04, a level achievable only using quantum resources.
Quantum state sharing (QSS) is a protocol by which a (secret) quantum state may be securely split into shares, shared between multiple potentially-dishonest players, and reconstructed. Crucially, the players are each assumed to be dishonest, and so QSS requires that only a collaborating authorized subset of players can access the original secret state; any dishonest unauthorized conspiracy cannot reconstruct it. We analyze a QSS protocol involving three untrusted players and demonstrate that quantum steering is the required resource enabling the protocol to proceed securely. We analyze the level of steering required to share any single-mode Gaussian secret which enables the states to be shared with the optimal use of resources.
The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results contribute to validating quantum secret sharing as a viable primitive for quantum technologies.
The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes against eavesdroppers and dishonest participants remained unproven. Here we establish an unconditional security proof for continuous variable entanglement-based quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players, by utilizing ideas from the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate the practical feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results establish quantum secret sharing as a viable and practically relevant primitive for quantum communication technologies.