Related papers: Multipartite Entanglement Distribution in Quantum …
Entanglement is a key resource in quantum communication, but bipartite schemes are often insufficient for advanced protocols like quantum secret sharing or distributed computing. Graph states offer a flexible way to represent and manage…
Existing quantum routing implicitly mimics classical routing principles, with finding the ``best'' path (aka pathfinding), according to a selected routing metric, as a core mechanism for establishing end-to-end entanglement. However,…
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.…
Quantum networks will rely on entanglement distribution to enable multi-user applications such as distributed quantum computing and cryptography. While multipartite entanglement distribution routing protocols have been extensively studied…
Entanglement distribution is a key functionality of the Quantum Internet. However, quantum entanglement is very fragile, easily degraded by decoherence, which strictly constraints the time horizon within the distribution has to be…
The construction of large-scale quantum computers will require modular architectures that allow physical resources to be localized in easy-to-manage packages. In this work, we examine the impact of different graph structures on the…
In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by…
The ability to distribute entanglement over complex quantum networks is an important step towards a quantum internet. Recently, there has been significant theoretical effort, mainly focusing on the distribution of bipartite entanglement via…
Quantum repeater networks that allow long-distance entanglement distribution will be the backbone of distributed quantum information processing. In this paper we explore entanglement distribution using quantum repeaters with optimized…
Recently, there are tremendous developments on the number of controllable qubits in several quantum computing systems. For these implementations, it is crucial to determine the entanglement structure of the prepared multipartite quantum…
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…
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…
In this paper we propose a technique for distributing entanglement in architectures in which interactions between pairs of qubits are constrained to a fixed network $G$. This allows for two-qubit operations to be performed between qubits…
We investigate entanglement distribution in pure-state quantum networks. We consider the case when non-maximally entangled two-qubit pure states are shared by neighboring nodes of the network. For a given pair of nodes, we investigate how…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
Building large-scale quantum communication networks has its unique challenges. Here, we demonstrate that a network-wide synergistic usage of quantum memories distributed in a quantum communication network offers a fundamental advantage. We…
Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
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…
Conventional quantum routing operates under the entrenched assumption that pathfinding is a prerequisite for routing. This classical-inspired routing model imposes a restricting design option, which prevents scaling the quantumness to the…