Related papers: Multipartite Entanglement Routing as a Hypergraph …
This workshop brought together experts in classical graph theory and quantum information science to explore the intersection of these fields, with a focus on quantum graph states and their applications in computing, networking, and sensing.…
We propose a technique to investigate multipartite entanglement in the symmetric subspace. Our approach is to map an $N$-qubit symmetric state onto a bipartite symmetric state of higher local dimension. We show that this mapping preserves…
Quantum communication represents a revolutionary advancement over classical information theory, which leverages unique quantum mechanics properties like entanglement to achieve unprecedented capabilities in secure and efficient information…
Optimal routing is a fundamental challenge in quantum networking, with several approaches proposed to identify the most efficient path for end-to-end (e2e) entanglement generation between pairs of nodes. In this paper, we show that…
Entanglement is a fundamental feature of quantum mechanics, playing a crucial role in quantum information processing. However, classifying entangled states, particularly in the mixed-state regime, remains a challenging problem, especially…
We study the ground-state entanglement in systems of spins forming the boundary of a quantum spin network in arbitrary geometries and dimensionality. We show that as long as they are weakly coupled to the bulk of the network, the surface…
The ability to reliably distribute entanglement among the nodes of a network is an essential requirement for the development of effective quantum communication protocols and the realization of useful quantum networks. It has been…
Quantum entanglement is one of the most prominent features of quantum mechanics and forms the basis of quantum information technologies. Here we present a novel method for the creation of quantum entanglement in multipartite and…
Complex networks structures have been extensively used for describing complex natural and technological systems, like the Internet or social networks. More recently complex network theory has been applied to quantum systems, where complex…
The vehicle routing problem (VRP) is a fundamental NP-hard task in intelligent transportation systems with broad applications in logistics and distribution. Deep reinforcement learning (DRL) with Graph Neural Networks (GNNs) has shown…
The future of quantum communication relies on quantum networks composed by observers sharing multipartite quantum states. The certification of multipartite entanglement will be crucial to the usefulness of these networks. In many real…
The task of classifying the entanglement properties of a multipartite quantum state poses a remarkable challenge due to the exponentially increasing number of ways in which quantum systems can share quantum correlations. Tackling such…
Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in…
We introduce the use of entanglement entropy as a tool for studying the amount of information shared between the nodes of quantum complex networks. By considering the ground state of a network of coupled quantum harmonic oscillators, we…
Node embedding is a key technique for representing graph nodes as vectors while preserving structural and relational properties, which enables machine learning tasks like feature extraction, clustering, and classification. While classical…
Future quantum internet applications will derive their power from the ability to share quantum information across the network. Quantum teleportation allows for the reliable transfer of quantum information between distant nodes, even in the…
This study explores an approach to routing in quantum networks, which targets practical scenarios for quantum networks, mirroring real-world classical networks. By addressing practical constraints, we examine the impact of heterogeneous…
Secret sharing is a multi-party cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed).…
Quantum entanglement and quantum entropy are crucial concepts in the study of multipartite quantum systems. In this work we show how the notion of concurrence vector, re-expressed in a particularly useful form, provides new insights and…
Problem instances of a size suitable for practical applications are not likely to be addressed during the noisy intermediate-scale quantum (NISQ) period with (almost) pure quantum algorithms. Hybrid classical-quantum algorithms have…