The indistinguishability of quantum particles is widely used as a resource for the generation of entanglement. Linear quantum networks (LQNs), in which identical particles linearly evolve to arrive at multimode detectors, exploit the indistinguishability to generate various multipartite entangled states by the proper control of transformation operators. However, it is challenging to devise a suitable LQN that carries a specific entangled state or compute the possible entangled state in a given LQN as the particle and mode number increase. This research presents a mapping process of arbitrary LQNs to graphs, which provides a powerful tool for analyzing and designing LQNs to generate multipartite entanglement. We also introduce the perfect matching diagram (PM diagram), which is a refined directed graph that includes all the essential information on the entanglement generation by an LQN. The PM diagram furnishes rigorous criteria for the entanglement of an LQN and solid guidelines for designing suitable LQNs for the genuine entanglement. Based on the structure of PM diagrams, we compose LQNs for fundamental N -partite genuinely entangled states.
The indistinguishability of quantum particles is widely used as a resource for the generation of entanglement. Linear quantum networks (LQNs), in which identical particles linearly evolve to arrive at multimode detectors, exploit the indistinguishability to generate various multipartite entangled states by the proper control of transformation operators. However, it is challenging to devise a suitable LQN that carries a specific entangled state or compute the possible entangled state in a given LQN as the particle and mode number increase. This research presents a mapping process of arbitrary LQNs to graphs, which provides a powerful tool for analyzing and designing LQNs to generate multipartite entanglement. We also introduce the perfect matching diagram (PM diagram), which is a refined directed graph that includes all the essential information on the entanglement generation by an LQN. The PM diagram furnishes rigorous criteria for the entanglement of an LQN and solid guidelines for designing suitable LQNs for the genuine entanglement. Based on the structure of PM diagrams, we compose LQNs for fundamental N -partite genuinely entangled states.
Indistinguishability of identical particles is a resource for quantum information processing and has been utilized to generate entanglement from independent particles that spatially overlap only at the detection stage. Here, we introduce a controllable scheme capable of generating via three steps, i.e., initialization, deformation, and postselection, different classes of multipartite entangled states starting from a product state of N spatially distinguishable identical qubits. While our scheme is generalizable to any class of entangled bosonic and fermionic systems, we provide an explicit recipe for the generation of W , Dicke, GHZ, and cluster states, which are resource states for quantum information processing. Using graph-based representations within the framework of spatially localized operations and classical communication (sLOCC), we mathematically demonstrate a direct translation of the generation schemes of specific entangled states into colored, complex, and weighted digraphs, each corresponding to a given experimental setup. We also show that this graph-theoretical approach allows for the optimization of the generation efficiency of specific multipartite entangled states by exploring a variety of generation schemes. The presented theoretical approach, while already implementable with current linear optics architectures, has the potential to bring clear advantages over existing technologies, such as in quantum computing search algorithms and in the design of new experiments in quantum optics or other platforms. Published by the American Physical Society 2024
Non-destructive heralded entanglement with photons is a valuable resource for quantum information processing. However, they generally entail ancillary particles and modes that amplify the circuit intricacy. To address this challenge, a recent work \cite{chin2024shortcut} introduced a graph approach for creating multipartite entanglements with boson subtractions. Nonetheless, it remains an essential intermediate step toward practical heralded schemes: the proposition of heralded subtraction operators in bosonic linear quantum networks. This research establishes comprehensive translation rules from subtraction operators to linear optical operators, which provides a seamless path to design heralded schemes with single photons. Our method begets enhanced or previously unreported schemes for the N -partite GHZ state with 2 N photons, N -partite W state with 2 N + 1 photons and superposition of N = 3 GHZ and W states with 9 photons. Our streamlined approach can straightforwardly design heralded schemes for multipartite entangled states by assembling the operators according to the guidence of sculpting bigraphs, hence significantly simplifies the quantum circuit design process.
Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum networks can help address this challenge by enabling the construction of large, robust, and more capable quantum computing platforms by connecting smaller quantum computers. Moreover, unlike classical systems, quantum networks can enable fully secured long-distance communication. Thus, quantum networks lie at the heart of the success of future quantum information technologies. In quantum networks, multipartite entangled states distributed over the network help implement and support many quantum network applications for communications, sensing, and computing. Our work focuses on developing optimal techniques to generate and distribute multipartite entanglement states efficiently. Prior works on generating general multipartite entanglement states have focused on the objective of minimizing the number of maximally entangled pairs while ignoring the heterogeneity of the network nodes and links as well as the stochastic nature of underlying processes. In this work, we develop a hypergraph-based linear programming framework that delivers optimal (under certain assumptions) generation schemes for general multipartite entanglement represented by graph states, under the network resources, decoherence, and fidelity constraints, while considering the stochasticity of the underlying processes. We illustrate our technique by developing generation schemes for the special cases of path and tree graph states and discuss optimized generation schemes for more general classes of graph states. Using extensive simulations over a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform prior known schemes by up to orders of magnitude.
Abstract We propose a graph method for systematically searching for schemes that can generate multipartite entanglement in linear bosonic systems with heralding. While heralded entanglement generation offers more tolerable schemes for quantum tasks than postselected ones, it is generally more challenging to find appropriate circuits for multipartite systems. We show that our graph mapping from boson subtractions provides handy tactics to overcome the limitations in circuit designs. Within our graph framework, we identify enhanced schemes for qubit N-partite GHZ, W, and the superposition of N = 3 GHZ and W states. Furthermore, we have found a qudit N-partite GHZ state generation scheme, which requires substantially fewer particles than previous proposals. These results demonstrate the power of our approach in discovering optimized solutions for the generation of intricate heralded entangled states. We expect our method to serve as a promising tool in generating diverse entanglement.
The design of detection strategies for multipartite entanglement stands as a central importance on our understanding of fundamental quantum mechanics and has had a substantial impact on quantum information applications. However, accurate and robust detection approaches are severely hindered, particularly when the number of nodes grows rapidly like in a quantum network. Here we present a general and operational framework that generates alternative entanglement witness for an arbitrary targeted state. The framework enjoys a systematic and high-efficient character and allows to substantiate genuine multipartite entanglement for a variety of states that arise naturally in practical situations and to dramatically outperform currently standard methods. With excellent noise tolerance, our framework should be broadly applicable to witness genuine multipartite entanglement in various practically scenarios and to facilitate the best use of entangled resources in the emerging area of quantum network.
Entanglement is a fundamental feature of quantum mechanics and a key resource for quantum information processing. Among multipartite entangled states, Dicke states ∣Dnk⟩ are distinguished by their permutation symmetry, which provides robustness against particle loss and enables applications for quantum communication and computation. Although Dicke states have been realized in various platforms, most optical implementations rely on postselection, which destroys the state upon detection and prevents its further use. A heralded optical scheme is therefore highly desirable. Here, we present a linear-optical heralded scheme for generating arbitrary Dicke states ∣Dnk⟩ with 3n+k photons through the framework of the linear quantum graph (LQG) picture. By mapping the scheme design into the graph-finding problem, and exploiting the permutation symmetry of Dicke states, we overcome the structural complexity that has hindered previous approaches. Our results provide a resource-efficient pathway toward practical heralded preparation of Dicke states for quantum technologies.