Multipartite Entanglement for Multi-node Quantum Networks
- URL: http://arxiv.org/abs/2408.00149v1
- Date: Wed, 31 Jul 2024 20:23:28 GMT
- Title: Multipartite Entanglement for Multi-node Quantum Networks
- Authors: E. M. Ainley, A. Agrawal, D. Main, P. Drmota, D. P. Nadlinger, B. C. Nichol, R. Srinivas, G. Araneda,
- Abstract summary: Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing.
Here, we analyse various schemes that achieve multipartite entanglement between nodes in a single step, bypassing the need for multiple rounds of bipartite entanglement.
We demonstrate that different schemes can produce distinct multipartite entangled states, with varying fidelity and generation rates.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing. In a quantum network, photons interact with matter qubits at different nodes, flexibly enabling the creation of remote entanglement between them. Multipartite entanglement among multiple nodes will be crucial for many proposed quantum network applications, including quantum computational tasks and quantum metrology. To date, experimental efforts have primarily focused on generating bipartite entanglement between nodes, which is widely regarded as the fundamental quantum resource for quantum networks. However, relying exclusively on bipartite entanglement to form more complex multipartite entanglement introduces several challenges. These include the need for ancillary qubits, extensive local entangling operations which increases the preparation latency, and increasingly stringent requirements on coherence times as the number of nodes grows. Here, we analyse various schemes that achieve multipartite entanglement between nodes in a single step, bypassing the need for multiple rounds of bipartite entanglement. We demonstrate that different schemes can produce distinct multipartite entangled states, with varying fidelity and generation rates. Additionally, we discuss the applicability of these schemes across different experimental platforms, highlighting their primary advantages and disadvantages.
Related papers
- Entanglement distribution based on quantum walk in arbitrary quantum networks [6.37705397840332]
We develop a series of scheme for generating high-dimensional entangled states via quantum walks with multiple coins or single coin.
We also give entanglement distribution schemes on arbitrary quantum networks according to the above theoretical framework.
Our work can serve as a building block for constructing larger and more complex quantum networks.
arXiv Detail & Related papers (2024-07-05T08:26:41Z) - Guarantees on the structure of experimental quantum networks [105.13377158844727]
Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing.
As these networks grow in size, certification tools will be required to answer questions regarding their properties.
We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
arXiv Detail & Related papers (2024-03-04T19:00:00Z) - Multimodal deep representation learning for quantum cross-platform
verification [60.01590250213637]
Cross-platform verification, a critical undertaking in the realm of early-stage quantum computing, endeavors to characterize the similarity of two imperfect quantum devices executing identical algorithms.
We introduce an innovative multimodal learning approach, recognizing that the formalism of data in this task embodies two distinct modalities.
We devise a multimodal neural network to independently extract knowledge from these modalities, followed by a fusion operation to create a comprehensive data representation.
arXiv Detail & Related papers (2023-11-07T04:35:03Z) - Scalable multiparty steering based on a single pair of entangled qubits [0.6553834611557042]
We show that multiparty loophole-free quantum steering is achievable by constructing a quantum network from a set of qubits of which only one pair is entangled.
This work introduces a scalable approach to rigorously verify quantum nonlocality across multiple parties, thus providing a practical tool towards developing the future quantum internet.
arXiv Detail & Related papers (2023-08-04T13:01:51Z) - Entanglement-Assisted Quantum Networks: Mechanics, Enabling
Technologies, Challenges, and Research Directions [66.27337498864556]
This paper presents a comprehensive survey of entanglement-assisted quantum networks.
It provides a detailed overview of the network structure, working principles, and development stages.
It also emphasizes open research directions, including architecture design, entanglement-based network issues, and standardization.
arXiv Detail & Related papers (2023-07-24T02:48:22Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - Genuinely Multipartite Entanglement vias Shallow Quantum Circuits [0.0]
We prove any genuinely multipartite entanglement on finite-dimensional spaces can be generated by using 2-layer shallow quantum circuit.
We propose a semi-device-independent entanglement model depending on the local connection ability.
Results show new insights for the multipartite entanglement, quantum network, and measurement-based quantum computation.
arXiv Detail & Related papers (2022-04-20T07:41:30Z) - Towards real-world quantum networks: a review [3.454055792111304]
Quantum networks play an extremely important role in quantum information science.
One of the key challenges for implementing a quantum network is to distribute entangled flying qubits to spatially separated nodes.
Dedicated efforts around the world for more than twenty years have resulted in both major theoretical and experimental progress towards entangling quantum nodes.
arXiv Detail & Related papers (2022-01-13T05:53:13Z) - Distributing Multipartite Entanglement over Noisy Quantum Networks [0.0]
A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes.
We present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories.
arXiv Detail & Related papers (2021-03-26T22:48:05Z) - Entanglement Classification via Neural Network Quantum States [58.720142291102135]
In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states.
We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS)
arXiv Detail & Related papers (2019-12-31T07:40:23Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.