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:1708.01339 · Physical review. D/Physical review. D.

Relativistic (2,3)-threshold quantum secret sharing

Mehdi Ahmadi, Yadong Wu, Barry C. Sanders

Published Sep 25, 2017• 18 citations
arXivHTMLPDF

Abstract

In quantum secret sharing protocols, the usual presumption is that the distribution of quantum shares and players' collaboration are both performed inertially. Here we develop a quantum secret sharing protocol that relaxes these assumptions wherein we consider the effects due to the accelerating motion of the shares. Specifically, we solve the (2,3)-threshold continuous-variable quantum secret sharing in noninertial frames. To this aim, we formulate the effect of relativistic motion on the quantum field inside a cavity as a bosonic quantum Gaussian channel. We investigate how the fidelity of quantum secret sharing is affected by nonuniform motion of the quantum shares. Furthermore, we fully characterize the canonical form of the Gaussian channel, which can be utilized in quantum-information-processing protocols to include relativistic effects.

DOI
10.1103/physrevd.96.065018

Related papers

Verifiable Relativistic Quantum Communication

Yadong Wu

Quantum summoning retrieves quantum information prepared at some point in spacetime at another point, which is randomly chosen from a set of points. This thesis presents an efficient quantum summoning protocol based on a quantum error-correcting code, along with encoding and decoding methods. This protocol reduces space complexity as well as gate complexity of encoding compared to previous best results. Our throughout study of quantum summoning paves the way for investigating relativistic quantum cryptography with quantum summoning as a primitive. This thesis also studies a relativistic continuous-variable quantum secret sharing protocol in non-inertial frame, which includes the effect of acceleration of quantum shares in spacetime. By formulating the relativistic effect as a Gaussian lossy channel, we analyze how the fidelity of quantum secret sharing protocol is affected by this relativistic effect. This investigation relaxes the common assumption of secret sharing in inertial frames and this framework can be applied to other relativistic quantum communication protocols. To efficiently verify bosonic quantum channels, I propose a framework of verification of quantum channels plus average-fidelity witness. For both multi-mode Gaussian unitary channels and single-mode amplifying channels, I present efficient verification protocols utilizing only two-mode squeezed vacuum states and homodyne detections. Our work is significant in verification of quantum components in continuous-variable quantum information processing.

•Nov 1, 2019•0 citations

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 information in noninertial frames: analyzing the mutual information between legitimate parties with a third party involvement

Ahmed Becir, Mustafa Moumni

Abstract In this study, we investigate the mutual information between two legitimate parties in the presence of a third party within a relativistic framework. We consider a two-mode squeezed state initially distributed between legitimate parties, Alice and Bob, while a third party, Eve, intercepts and impersonates the mode directed to Bob in an attempt to gain information. In this context, we derive a tight bound on Eve’s accessible information and analyze the impact of non-inertial motion on the shared information between the involved parties in two scenarios, when Bob undergoes uniform acceleration while Alice remains stationary, and when both Alice and Bob experience uniform accelerations. The findings provide new insights into how imperfections in channel transmittance reduce the exchanged information in a relativistic setting, and how a third party can exploit these imperfections to attain information. This study has implications in quantum security protocols such as quantum key distribution.

Physica Scripta•Jul 10, 2025•3 citations

Continuous-variable quantum-state sharing via quantum disentanglement

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

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.

arXiv:quant-ph/0411191•Physical Review A•Mar 24, 2005•121 citations

Graph states for quantum secret sharing

Damian Markham, Barry C. Sanders

We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quantum-information processing system.

arXiv:0808.1532•Physical Review A•Oct 10, 2008•473 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•200 citations
In quantum secret sharing protocols, the usual presumption is that the distribution of quantum shares and players' collaboration are both performed inertially. Here we develop a quantum secret sharing protocol that relaxes these assumptions wherein we consider the effects due to the accelerating motion of the shares. Specifically, we solve the (2,3)-threshold continuous-variable quantum secret sharing in noninertial frames. To this aim, we formulate the effect of relativistic motion on the quantum field inside a cavity as a bosonic quantum Gaussian channel. We investigate how the fidelity of quantum secret sharing is affected by nonuniform motion of the quantum shares. Furthermore, we fully characterize the canonical form of the Gaussian channel, which can be utilized in quantum-information-processing protocols to include relativistic effects.
Quantum summoning retrieves quantum information prepared at some point in spacetime at another point, which is randomly chosen from a set of points. This thesis presents an efficient quantum summoning protocol based on a quantum error-correcting code, along with encoding and decoding methods. This protocol reduces space complexity as well as gate complexity of encoding compared to previous best results. Our throughout study of quantum summoning paves the way for investigating relativistic quantum cryptography with quantum summoning as a primitive. This thesis also studies a relativistic continuous-variable quantum secret sharing protocol in non-inertial frame, which includes the effect of acceleration of quantum shares in spacetime. By formulating the relativistic effect as a Gaussian lossy channel, we analyze how the fidelity of quantum secret sharing protocol is affected by this relativistic effect. This investigation relaxes the common assumption of secret sharing in inertial frames and this framework can be applied to other relativistic quantum communication protocols. To efficiently verify bosonic quantum channels, I propose a framework of verification of quantum channels plus average-fidelity witness. For both multi-mode Gaussian unitary channels and single-mode amplifying channels, I present efficient verification protocols utilizing only two-mode squeezed vacuum states and homodyne detections. Our work is significant in verification of quantum components in continuous-variable quantum information processing.
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.
Abstract In this study, we investigate the mutual information between two legitimate parties in the presence of a third party within a relativistic framework. We consider a two-mode squeezed state initially distributed between legitimate parties, Alice and Bob, while a third party, Eve, intercepts and impersonates the mode directed to Bob in an attempt to gain information. In this context, we derive a tight bound on Eve’s accessible information and analyze the impact of non-inertial motion on the shared information between the involved parties in two scenarios, when Bob undergoes uniform acceleration while Alice remains stationary, and when both Alice and Bob experience uniform accelerations. The findings provide new insights into how imperfections in channel transmittance reduce the exchanged information in a relativistic setting, and how a third party can exploit these imperfections to attain information. This study has implications in quantum security protocols such as quantum key distribution.
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.
We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quantum-information processing system.
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.