Experimental verification of multipartite entanglement in quantum networks
Will McCutcheon, Anna Pappa, Bryn A. Bell, Alex R. McMillan, André Chailloux, Thomas Lawson, Mhlambululi Mafu, Damian Markham, Eleni Diamanti, Iordanis Kerenidis, John Rarity, Mark Tame
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.
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.
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.
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.
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.
Quantum networks comprised of entangled end nodes serve stronger than the classical correlation for unparalleled quantum internet applications. However, practical quantum networking is affected by noise, which at its worst, causes end nodes to be described by pre-existing classical data. In such untrusted networks, determining quantum network fidelity and genuine multi-node entanglement becomes crucial. Here, we show that determining quantum network fidelity and genuine N -node entanglement in an untrusted star network requires only N + 1 measurement settings. This method establishes a semi-trusted framework, allowing some nodes to relax their assumptions. Our network determination method is enabled by detecting genuine N -node Einstein-Podolsky-Rosen steerability. Experimentally, using spontaneous parametric down-conversion entanglement sources, we demonstrate the determinations of genuine 3-photon and 4-photon quantum networks and the false positives of the widely used entanglement witness, the fidelity criterion of 1/2. Our results provide a scalable method for the determination of multipartite entanglement in realistic quantum networks.
Genuine multipartite nonlocality and nonlocality arising in networks composed of several independent sources have been investigated separately. While some genuinely entangled states cannot be verified by violating a single Bell-type inequality, a quantum network consisting of different sources enables the certification of the nonclassicality of all sources. In this Letter, we propose the first method to verify both types of nonlocality simultaneously in a single experiment. We consider a quantum network comprising a bipartite source and a tripartite source. We demonstrate that there are quantum correlations that cannot be simulated if the tripartite source distributes biseparable systems while the bipartite source distributes even stronger-than-quantum systems. These correlations can be used to verify both the genuine multipartite nonlocality of generalized Greenberger-Horne-Zeilinger states and the full network nonlocality that is stronger than all the existing results. Experimentally, we observe both types of nonlocality in a high-fidelity photonic quantum network by violating a single network Bell inequality.
We report on the first experimental verification of mode-independent entanglement. Commonly, the entanglement of a state is firmly based on pre-defined parties that are correlated, and the state might be disentangled when the definition of the parties is changed. Exceeding this party-dependent concept, we realize a type of quantum entanglement that persists even if the parties, in our case modes, are transformed. This safeguards the performance of entanglement in real-world applications, such as quantum communication settings involving noise and untrusted parties. For the state generation, we present an experimental scheme based on a fully reconfigurable temporally multiplexed interferometer with measurement-induced nonlinearities, which generates heralded two-photon states in two modes that are entangled for all choices of orthonormal mode basis. For the certification process, we utilize a tailored quantum-state tomography, achieving fidelities that validate the presence of mode-independent entanglement as a resilient and operationally advantageous quantum correlation.