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:1112.5064 · Physical Review Letters

Multipartite Entanglement Verification Resistant against Dishonest Parties

Anna Pappa, André Chailloux, Stephanie Wehner, Eleni Diamanti, Iordanis Kerenidis

Published Jun 26, 2012• 85 citations
arXivHTMLPDF

Abstract

Future quantum information networks will consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and, hence, it is imperative to study the possibility of verifying a multipartite entanglement source in a way that is efficient and provides strong guarantees even in the presence of multiple dishonest parties. In this Letter, we show how an agent of a quantum network can perform a distributed verification of a source creating multipartite Greenberger-Horne-Zeilinger (GHZ) states with minimal resources, which is, nevertheless, resistant against any number of dishonest parties. Moreover, we provide a tight tradeoff between the level of security and the distance between the state produced by the source and the ideal GHZ state. Last, by adding the resource of a trusted common random source, we can further provide security guarantees for all honest parties in the quantum network simultaneously.

DOI
10.1103/physrevlett.108.260502

Related papers

Experimental verification of multipartite entanglement in quantum networks

Will McCutcheon, Anna Pappa, Bryn A. Bell +9 more

Multipartite entangled states are a fundamental resource for a wide range of quantum information processing tasks. In particular, in quantum networks, it is essential for the parties involved to be able to verify if entanglement is present before they carry out a given distributed task. Here we design and experimentally demonstrate a protocol that allows any party in a network to check if a source is distributing a genuinely multipartite entangled state, even in the presence of untrusted parties. The protocol remains secure against dishonest behaviour of the source and other parties, including the use of system imperfections to their advantage. We demonstrate the verification protocol in a three- and four-party setting using polarization-entangled photons, highlighting its potential for realistic photonic quantum communication and networking applications.

arXiv:1611.04772•Nature Communications•Nov 9, 2016•137 citations

Optimal verification of the Bell state and Greenberger–Horne–Zeilinger states in untrusted quantum networks

Yun-Guang Han, Zihao Li, Yukun Wang +1 more

Abstract Bipartite and multipartite entangled states are basic ingredients for constructing quantum networks and their accurate verification is crucial to the functioning of the networks, especially for untrusted networks. Here we propose a simple approach for verifying the Bell state in an untrusted network in which one party is not honest. Only local projective measurements are required for the honest party. It turns out each verification protocol is tied to a probability distribution on the Bloch sphere and its performance has an intuitive geometric meaning. This geometric picture enables us to construct the optimal and simplest verification protocols, which are also very useful to detecting entanglement in the untrusted network. Moreover, we show that our verification protocols can achieve almost the same sample efficiencies as protocols tailored to standard quantum state verification. Furthermore, we establish an intimate connection between the verification of Greenberger–Horne–Zeilinger states and the verification of the Bell state. By virtue of this connection we construct the optimal protocol for verifying Greenberger–Horne–Zeilinger states and for detecting genuine multipartite entanglement.

arXiv:2111.02800•npj Quantum Information•Nov 26, 2021•15 citations

Characterizing high-dimensional multipartite entanglement beyond Greenberger-Horne-Zeilinger fidelities

Shuheng Liu, Qiongyi He, Marcus Huber +1 more

Characterizing entanglement of systems composed of multiple particles is a very complex problem that is attracting increasing attention across different disciplines related to quantum physics. The task becomes even more complex when the particles have many accessible levels, i.e., they are of high dimension, which leads to a potentially high-dimensional multipartite entangled state. These are important resources for an ever-increasing number of tasks, especially when a network of parties needs to share highly entangled states, e.g., for communicating more efficiently and securely. For these applications, as well as for purely theoretical arguments, it is important to be able to certify both the high-dimensional and the genuine multipartite nature of entangled states, possibly based on simple measurements. Here we derive a novel method that achieves this and improves over typical entanglement witnesses like the fidelity with respect to states of a Greenberger-Horne-Zeilinger (GHZ) form, without needing more complex measurements. We test our condition on paradigmatic classes of high-dimensional multipartite entangled states like imperfect GHZ states with random noise, as well as on purely randomly chosen ones and find that, in comparison with other available criteria our method provides a significant advantage and is often also simpler to evaluate.

arXiv:2405.03261•Quantum•Feb 3, 2026•1 citation

Quantum Security Multi-Party Extremum Protocol with Greenberger–Horne–Zeilinger States

Ping Wang, Gongde Guo, Shuxin Lin +2 more

Secure multi-party extremum, as a significant offshoot of secure multi-party computation, has extensive applications in various domains, including healthcare, financial transactions, market analysis, sports events, etc. Nevertheless, most existing secure multi-party extremum protocols rely on computational hard problems and are thus vulnerable to quantum algorithms. This paper presents a quantum secure multi-party extremum protocol that is built upon the correlations of Greenberger–Horne–Zeilinger (GHZ) states. Within this protocol, multiple participants, with the aid of a semi-honest third party, can obtain the maximum and minimum values of their secret inputs. GHZ states act as the information carriers and are transmitted among the participants and the third party. Their unique correlations ensure the secure transmission of quantum particles. The analysis demonstrates that the proposed protocol is capable of not only warding off common external attacks but also resisting internal attacks launched by dishonest participants and the semi-honest third party. Moreover, the protocol boasts correctness and high scalability.

Technologies•Sep 24, 2025•0 citations

Verification of graph states in an untrusted network

Anupama Unnikrishnan, Damian Markham

Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states generated by an untrusted source and shared between a network of possibly dishonest parties. This has implications in certifying the application of graph states for various distributed tasks. We present a protocol which is globally efficient for a large family of useful graph states, including cluster states, GHZ states, cycle graph states, and more. For general graph states, efficiency with respect to the security parameter is maintained, though there is a cost increase with the size of the graph state. The protocols are practical, requiring only multiple copies of the graph state, local measurements, and classical communication.

arXiv:2007.13126•Physical Review A•May 13, 2022•15 citations

Verification of quantum networks using the GHZ paradox

Huan Ye, Xue Yang, Ming‐Xing Luo

Abstract The Greenberger–Horne–Zeilinger (GHZ) paradox shows that it is possible to create a multipartite state involving three or more particles in which the measurement outcomes of the particles are correlated in a way that cannot be explained by classical physics. We extend it to witness quantum networks. We first extend the GHZ paradox to simultaneously verify the GHZ state and Einstein–Podolsky–Rosen states on triangle networks. We then extend the GHZ paradox to witness the entanglement of chain networks consisting of multiple GHZ states. All the present results are robust against the noise.

Communications in Theoretical Physics•Jul 4, 2024•1 citation
Future quantum information networks will consist of quantum and classical agents, who have the ability to communicate in a variety of ways with trusted and untrusted parties and securely delegate computational tasks to untrusted large-scale quantum computing servers. Multipartite quantum entanglement is a fundamental resource for such a network and, hence, it is imperative to study the possibility of verifying a multipartite entanglement source in a way that is efficient and provides strong guarantees even in the presence of multiple dishonest parties. In this Letter, we show how an agent of a quantum network can perform a distributed verification of a source creating multipartite Greenberger-Horne-Zeilinger (GHZ) states with minimal resources, which is, nevertheless, resistant against any number of dishonest parties. Moreover, we provide a tight tradeoff between the level of security and the distance between the state produced by the source and the ideal GHZ state. Last, by adding the resource of a trusted common random source, we can further provide security guarantees for all honest parties in the quantum network simultaneously.
Multipartite entangled states are a fundamental resource for a wide range of quantum information processing tasks. In particular, in quantum networks, it is essential for the parties involved to be able to verify if entanglement is present before they carry out a given distributed task. Here we design and experimentally demonstrate a protocol that allows any party in a network to check if a source is distributing a genuinely multipartite entangled state, even in the presence of untrusted parties. The protocol remains secure against dishonest behaviour of the source and other parties, including the use of system imperfections to their advantage. We demonstrate the verification protocol in a three- and four-party setting using polarization-entangled photons, highlighting its potential for realistic photonic quantum communication and networking applications.
Abstract Bipartite and multipartite entangled states are basic ingredients for constructing quantum networks and their accurate verification is crucial to the functioning of the networks, especially for untrusted networks. Here we propose a simple approach for verifying the Bell state in an untrusted network in which one party is not honest. Only local projective measurements are required for the honest party. It turns out each verification protocol is tied to a probability distribution on the Bloch sphere and its performance has an intuitive geometric meaning. This geometric picture enables us to construct the optimal and simplest verification protocols, which are also very useful to detecting entanglement in the untrusted network. Moreover, we show that our verification protocols can achieve almost the same sample efficiencies as protocols tailored to standard quantum state verification. Furthermore, we establish an intimate connection between the verification of Greenberger–Horne–Zeilinger states and the verification of the Bell state. By virtue of this connection we construct the optimal protocol for verifying Greenberger–Horne–Zeilinger states and for detecting genuine multipartite entanglement.
Characterizing entanglement of systems composed of multiple particles is a very complex problem that is attracting increasing attention across different disciplines related to quantum physics. The task becomes even more complex when the particles have many accessible levels, i.e., they are of high dimension, which leads to a potentially high-dimensional multipartite entangled state. These are important resources for an ever-increasing number of tasks, especially when a network of parties needs to share highly entangled states, e.g., for communicating more efficiently and securely. For these applications, as well as for purely theoretical arguments, it is important to be able to certify both the high-dimensional and the genuine multipartite nature of entangled states, possibly based on simple measurements. Here we derive a novel method that achieves this and improves over typical entanglement witnesses like the fidelity with respect to states of a Greenberger-Horne-Zeilinger (GHZ) form, without needing more complex measurements. We test our condition on paradigmatic classes of high-dimensional multipartite entangled states like imperfect GHZ states with random noise, as well as on purely randomly chosen ones and find that, in comparison with other available criteria our method provides a significant advantage and is often also simpler to evaluate.
Secure multi-party extremum, as a significant offshoot of secure multi-party computation, has extensive applications in various domains, including healthcare, financial transactions, market analysis, sports events, etc. Nevertheless, most existing secure multi-party extremum protocols rely on computational hard problems and are thus vulnerable to quantum algorithms. This paper presents a quantum secure multi-party extremum protocol that is built upon the correlations of Greenberger–Horne–Zeilinger (GHZ) states. Within this protocol, multiple participants, with the aid of a semi-honest third party, can obtain the maximum and minimum values of their secret inputs. GHZ states act as the information carriers and are transmitted among the participants and the third party. Their unique correlations ensure the secure transmission of quantum particles. The analysis demonstrates that the proposed protocol is capable of not only warding off common external attacks but also resisting internal attacks launched by dishonest participants and the semi-honest third party. Moreover, the protocol boasts correctness and high scalability.
Graph states are a large class of multipartite entangled quantum states that form the basis of schemes for quantum computation, communication, error correction, metrology, and more. In this work, we consider verification of graph states generated by an untrusted source and shared between a network of possibly dishonest parties. This has implications in certifying the application of graph states for various distributed tasks. We present a protocol which is globally efficient for a large family of useful graph states, including cluster states, GHZ states, cycle graph states, and more. For general graph states, efficiency with respect to the security parameter is maintained, though there is a cost increase with the size of the graph state. The protocols are practical, requiring only multiple copies of the graph state, local measurements, and classical communication.
Abstract The Greenberger–Horne–Zeilinger (GHZ) paradox shows that it is possible to create a multipartite state involving three or more particles in which the measurement outcomes of the particles are correlated in a way that cannot be explained by classical physics. We extend it to witness quantum networks. We first extend the GHZ paradox to simultaneously verify the GHZ state and Einstein–Podolsky–Rosen states on triangle networks. We then extend the GHZ paradox to witness the entanglement of chain networks consisting of multiple GHZ states. All the present results are robust against the noise.