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

Quantum-enhanced protocols : secure quantum state sharing and noisy field estimation

Wilkinson, Cailean James

Published Nov 10, 2025• 0 citations
Publisher

Abstract

The first part of this thesis presents a new quantum state sharing scheme that distributes the quantum information contained within a quantum state across three shares such that it cannot be accessed from any individual share. By combining any two shares, however, the original state can be reconstructed. This requirement for collaboration ensures security against single dishonest actors. We demonstrate that the protocol is provably secure for the class of pure Gaussian states and is effective for the sharing of mixed states, although security for those cannot be guaranteed. We then go on to discuss the use of quantum state sharing as a hybrid protocol for the distribution of discrete-variable states, including Fock states and particle-number qubits, using Gaussian entanglement. We demonstrate that, with access to suitable entanglement resources, this can be achieved with arbitrarily-high fidelity and that the security of the protocol can be guaranteed for qubit-like states. In the second part of this thesis, we consider the potential for quantum entanglement to improve the measurement of gradients in the magnetic field. We find that in the absence of noise, it is optimal to measure orthogonal gradients individually, devoting the full measurement network to the measurement of a single gradient at a time. In the presence of high levels of environment noise, however, it becomes preferable to measure them simultaneously. We find the optimal network configurations and entanglement structures to make these measurements in the presence of three common noise sources.

DOI
10.17630/sta/1469

Related papers

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•120 citations

Entanglement assisted quantum communication protocols

Amélie Piveteau

Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.

•Jan 1, 2026•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

Enforcing trust in quantum networks

Anupama Unnikrishnan

The phenomenal progress in quantum technologies over the past decades has laid the groundwork for the construction of quantum networks, which will channel the power of quantum theory to guarantee secure and efficient communication, computation, and much more. This thesis studies the notion of trust in quantum networks. In our information age, protecting the security or anonymity of data is a key requirement. We investigate certain protocols that are fundamental to the operation and applications of quantum networks, and propose ways to test and analyse their security, in spite of adversarial intervention. Our focus is on practical methods of verifying the untrusted components, which could be incorporated into realistic networks in the near future. To begin, we propose a protocol for authenticated communication of quantum messages, by verifying the entanglement required for quantum teleportation in an experimentally feasible way. We model the performance of our scheme in the presence of noise. Furthermore, we explore such an authenticated teleportation in the one-sided device-independent scenario, where some devices used for verification may be corrupted. We derive error-tolerant self- testing bounds and extend our results to a realistic experimental setting, demonstrating the compatibility of our protocol with state-of-the-art technology. We then study anonymity, an essential feature for communication across networks. Combining the power of classical and quantum subroutines, we build a practical protocol for anonymous communication of quantum messages, without the need to trust the players in our network, their computational power, or the entanglement they share. We end by considering the verification of graph states distributed across a network of possibly dishonest players, applying our scheme to specific graph states that are central to quantum communication and computation schemes.

•Jan 1, 2019•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

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
The first part of this thesis presents a new quantum state sharing scheme that distributes the quantum information contained within a quantum state across three shares such that it cannot be accessed from any individual share. By combining any two shares, however, the original state can be reconstructed. This requirement for collaboration ensures security against single dishonest actors. We demonstrate that the protocol is provably secure for the class of pure Gaussian states and is effective for the sharing of mixed states, although security for those cannot be guaranteed. We then go on to discuss the use of quantum state sharing as a hybrid protocol for the distribution of discrete-variable states, including Fock states and particle-number qubits, using Gaussian entanglement. We demonstrate that, with access to suitable entanglement resources, this can be achieved with arbitrarily-high fidelity and that the security of the protocol can be guaranteed for qubit-like states. In the second part of this thesis, we consider the potential for quantum entanglement to improve the measurement of gradients in the magnetic field. We find that in the absence of noise, it is optimal to measure orthogonal gradients individually, devoting the full measurement network to the measurement of a single gradient at a time. In the presence of high levels of environment noise, however, it becomes preferable to measure them simultaneously. We find the optimal network configurations and entanglement structures to make these measurements in the presence of three common noise sources.
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.
Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.
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.
The phenomenal progress in quantum technologies over the past decades has laid the groundwork for the construction of quantum networks, which will channel the power of quantum theory to guarantee secure and efficient communication, computation, and much more. This thesis studies the notion of trust in quantum networks. In our information age, protecting the security or anonymity of data is a key requirement. We investigate certain protocols that are fundamental to the operation and applications of quantum networks, and propose ways to test and analyse their security, in spite of adversarial intervention. Our focus is on practical methods of verifying the untrusted components, which could be incorporated into realistic networks in the near future. To begin, we propose a protocol for authenticated communication of quantum messages, by verifying the entanglement required for quantum teleportation in an experimentally feasible way. We model the performance of our scheme in the presence of noise. Furthermore, we explore such an authenticated teleportation in the one-sided device-independent scenario, where some devices used for verification may be corrupted. We derive error-tolerant self- testing bounds and extend our results to a realistic experimental setting, demonstrating the compatibility of our protocol with state-of-the-art technology. We then study anonymity, an essential feature for communication across networks. Combining the power of classical and quantum subroutines, we build a practical protocol for anonymous communication of quantum messages, without the need to trust the players in our network, their computational power, or the entanglement they share. We end by considering the verification of graph states distributed across a network of possibly dishonest players, applying our scheme to specific graph states that are central to quantum communication and computation schemes.
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.
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.