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:1808.06870 · Physical Review A

Random coding for sharing bosonic quantum secrets

Francesco Arzani, Giulia Ferrini, Frédéric Grosshans, Damian Markham

Published Aug 5, 2019• 12 citations
arXivHTMLPDF

Abstract

We consider a protocol for sharing quantum states using continuous variable systems. Specifically we introduce an encoding procedure where bosonic modes in arbitrary secret states are mixed with several ancillary squeezed modes through a passive interferometer. We derive simple conditions on the interferometer for this encoding to define a secret sharing protocol and we prove that they are satisfied by almost any interferometer. This implies that, if the interferometer is chosen uniformly at random, the probability that it may not be used to implement a quantum secret sharing protocol is zero. Furthermore, we show that the decoding operation can be obtained and implemented efficiently with a Gaussian unitary using a number of single-mode squeezers that is at most twice the number of modes of the secret, regardless of the number of players. We benchmark the quality of the reconstructed state by computing the fidelity with the secret state as a function of the input squeezing.

DOI
10.1103/physreva.100.022303

Related papers

Quantum secret sharing using squeezing and almost any passive interferometer.

Francesco Arzani, Giulia Ferrini, Frédéric Grosshans +1 more

We consider the sharing of quantum secret states using continuous variable systems. Specifically we introduce an encoding procedure where we mix the secret mode with several ancillary squeezed modes through a passive interferometer. We derive simple conditions on the interferometer for this encoding scheme to give a secret sharing protocol and we prove that they are satisfied by almost any interferometer with respect to the Haar measure. This implies that, if the interferometer is chosen uniformly at random, the probability that it may not be used to implement a quantum secret sharing protocol is zero. Furthermore, we show that the decoding operation can be obtained and implemented efficiently in linear optics with an additional squeezer per access party. We analyze the quality of the reconstructed state as a function of the input squeezing.

•Aug 21, 2018•0 citations

Sharing quantum secrets

Barry C. Sanders, Tomáš Tyc, DAVID J. ROWE

We discuss sharing quantum secrets via optical interferometry and squeezing. A secret quantum state for a single-mode field is encoded into a multimode field as an entangled state and distributed to a set of players so that certain subsets can decode the secret states, and others cannot learn anything about the state. In particular, we discuss the (k,n)-threshold scheme for optics and specifically the (2,3) scheme. An arbitrary (k,n)-threshold scheme can be achieved with no more than two single-mode squeezers.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 3, 2004•0 citations

Efficient sharing of a continuous-variable quantum secret

Tomáš Tyc, David J Rowe, Barry C. Sanders

We propose an efficient scheme for sharing a continuous-variable quantum secret using passive optical interferometry and squeezers: this efficiency is achieved by showing that a maximum of two squeezers is required to extract the secret state, and we obtain the cheapest configuration in terms of total squeezing cost. Squeezing is a cost for the dealer of the secret as well as for the receivers, and we quantify limitations to the fidelity of the extracted secret state in terms of the squeezing employed by the dealer.

arXiv:quant-ph/0301028•Journal of Physics A Mathematical and General•Jun 24, 2003•30 citations

Quantum secret sharing using weak coherent states

Warren P. Grice, Bing Qi

Secret sharing allows a trusted party (the dealer) to distribute a secret to a group of players, who can only access the secret cooperatively. Quantum secret sharing (QSS) protocols could provide unconditional security based on fundamental laws in physics. While the general security proof has been established recently in an entanglement-based QSS protocol, the tolerable channel loss is unfortunately rather small. Here we propose a continuous variable QSS protocol using conventional laser sources and homodyne detectors. In this protocol, a Gaussian-modulated coherent state (GMCS) prepared by one player passes through the secure stations of the other players sequentially, and each of the other players injects a locally prepared, independent GMCS into the circulating optical mode. Finally, the dealer measures both the amplitude and the phase quadratures of the receiving optical mode using double homodyne detectors. Collectively, the players can use their encoded random numbers to estimate the measurement results of the dealer and further generate a shared key. We prove the unconditional security of the proposed protocol against both eavesdroppers and dishonest players in the presence of high channel loss, and discuss various practical issues.

arXiv:1906.10488•Physical Review A•Aug 28, 2019•91 citations

Passive continuous-variable quantum secret sharing using a thermal source

Xiaodong Wu, Yijun Wang, Duan Huang

We propose a continuous-variable quantum secret sharing (CV-QSS) protocol in which the quantum states are prepared passively using a thermal source. In our protocol, one player splits the output of a thermal source into two spatial modes with the help of a beam splitter, then he (or she) measures one of the correlated thermal states and sends the others to the secure station of the adjacent player in sequence after using appropriate optical attenuation, which waives the necessity of employment of high extinction ratio modulators with good stability. Therefore, the proposed protocol provides convenient implementation in QSS framework. Moreover, our scheme is immune to Trojan horse attacks. We derive the security bounds for our protocol against both eavesdroppers and dishonest players. Furthermore, we can achieve tighter bound of QSS distance by considering the finite-size effect, which is more practical than that obtained in the asymptotic limit.

Physical Review A•Feb 3, 2020•62 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
We consider a protocol for sharing quantum states using continuous variable systems. Specifically we introduce an encoding procedure where bosonic modes in arbitrary secret states are mixed with several ancillary squeezed modes through a passive interferometer. We derive simple conditions on the interferometer for this encoding to define a secret sharing protocol and we prove that they are satisfied by almost any interferometer. This implies that, if the interferometer is chosen uniformly at random, the probability that it may not be used to implement a quantum secret sharing protocol is zero. Furthermore, we show that the decoding operation can be obtained and implemented efficiently with a Gaussian unitary using a number of single-mode squeezers that is at most twice the number of modes of the secret, regardless of the number of players. We benchmark the quality of the reconstructed state by computing the fidelity with the secret state as a function of the input squeezing.
We consider the sharing of quantum secret states using continuous variable systems. Specifically we introduce an encoding procedure where we mix the secret mode with several ancillary squeezed modes through a passive interferometer. We derive simple conditions on the interferometer for this encoding scheme to give a secret sharing protocol and we prove that they are satisfied by almost any interferometer with respect to the Haar measure. This implies that, if the interferometer is chosen uniformly at random, the probability that it may not be used to implement a quantum secret sharing protocol is zero. Furthermore, we show that the decoding operation can be obtained and implemented efficiently in linear optics with an additional squeezer per access party. We analyze the quality of the reconstructed state as a function of the input squeezing.
We discuss sharing quantum secrets via optical interferometry and squeezing. A secret quantum state for a single-mode field is encoded into a multimode field as an entangled state and distributed to a set of players so that certain subsets can decode the secret states, and others cannot learn anything about the state. In particular, we discuss the (k,n)-threshold scheme for optics and specifically the (2,3) scheme. An arbitrary (k,n)-threshold scheme can be achieved with no more than two single-mode squeezers.
We propose an efficient scheme for sharing a continuous-variable quantum secret using passive optical interferometry and squeezers: this efficiency is achieved by showing that a maximum of two squeezers is required to extract the secret state, and we obtain the cheapest configuration in terms of total squeezing cost. Squeezing is a cost for the dealer of the secret as well as for the receivers, and we quantify limitations to the fidelity of the extracted secret state in terms of the squeezing employed by the dealer.
Secret sharing allows a trusted party (the dealer) to distribute a secret to a group of players, who can only access the secret cooperatively. Quantum secret sharing (QSS) protocols could provide unconditional security based on fundamental laws in physics. While the general security proof has been established recently in an entanglement-based QSS protocol, the tolerable channel loss is unfortunately rather small. Here we propose a continuous variable QSS protocol using conventional laser sources and homodyne detectors. In this protocol, a Gaussian-modulated coherent state (GMCS) prepared by one player passes through the secure stations of the other players sequentially, and each of the other players injects a locally prepared, independent GMCS into the circulating optical mode. Finally, the dealer measures both the amplitude and the phase quadratures of the receiving optical mode using double homodyne detectors. Collectively, the players can use their encoded random numbers to estimate the measurement results of the dealer and further generate a shared key. We prove the unconditional security of the proposed protocol against both eavesdroppers and dishonest players in the presence of high channel loss, and discuss various practical issues.
We propose a continuous-variable quantum secret sharing (CV-QSS) protocol in which the quantum states are prepared passively using a thermal source. In our protocol, one player splits the output of a thermal source into two spatial modes with the help of a beam splitter, then he (or she) measures one of the correlated thermal states and sends the others to the secure station of the adjacent player in sequence after using appropriate optical attenuation, which waives the necessity of employment of high extinction ratio modulators with good stability. Therefore, the proposed protocol provides convenient implementation in QSS framework. Moreover, our scheme is immune to Trojan horse attacks. We derive the security bounds for our protocol against both eavesdroppers and dishonest players. Furthermore, we can achieve tighter bound of QSS distance by considering the finite-size effect, which is more practical than that obtained in the asymptotic limit.
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.