Quantum information processing architectures typically only allow for nearest-neighbor entanglement creation. In many cases, this prevents the direct generation of GHZ states, which are commonly used for many communication and computation tasks. Here, we show how to obtain GHZ states between nodes in a network that are connected in a straight line, naturally allowing them to initially share linear cluster states. We prove a strict upper bound of ⌊(n+3)/2⌋ on the size of the set of nodes sharing a GHZ state that can be obtained from a linear cluster state of n qubits, using local Clifford unitaries, local Pauli measurements, and classical communication. Furthermore, we completely characterize all selections of nodes below this threshold that can share a GHZ state obtained within this setting. Finally, we demonstrate these transformations on the IBMQ Montreal quantum device for linear cluster states of up to n=19 qubits. Published by the American Physical Society 2024
Quantum information processing architectures typically only allow for nearest-neighbor entanglement creation. In many cases, this prevents the direct generation of GHZ states, which are commonly used for many communication and computation tasks. Here, we show how to obtain GHZ states between nodes in a network that are connected in a straight line, naturally allowing them to initially share linear cluster states. We prove a strict upper bound of ⌊(n+3)/2⌋ on the size of the set of nodes sharing a GHZ state that can be obtained from a linear cluster state of n qubits, using local Clifford unitaries, local Pauli measurements, and classical communication. Furthermore, we completely characterize all selections of nodes below this threshold that can share a GHZ state obtained within this setting. Finally, we demonstrate these transformations on the IBMQ Montreal quantum device for linear cluster states of up to n=19 qubits. Published by the American Physical Society 2024
The extraction of EPR pairs andn-qubits GHZ states among remote nodes in quantum networks constitutes the resource primitives for end-to-end and on-demand communications. However, the Bell-VM problem, which determines whether a given graph state can be transformed into a set of Bell pairs on specific vertices (not necessarily remote), is known to be NP-complete. In this paper, we extend this problem, not only by focusing on nodes remote within generic graph states, but also by determining the number of extractablen-qubit remote GHZ states - beside the number of remote EPR pairs. The rationale for tackling the extraction of GHZ states among remote nodes, rather than solely remote EPR pairs, is that a GHZ state enables the dynamic extraction of an EPR pair between any pair of nodes sharing the state. This, in turn, implies the ability of accommodating the traffic requests on-the-fly. Specially, we propose a polynomial-time algorithm for solving the aforementioned NP-complete problem. Our results demonstrate that the proposed algorithm is able to effectively adapt to generic graph states for extracting entanglement resources across remote nodes.
This Thesis contributes to the theory of entanglement distribution in quantum networks, analyzing the generation of long-distance entanglement in particular.We consider that neighboring stations share one partially entangled pair of qubits, which emphasizes the difficulty of creating remote entanglement in realistic settings.The task is then to design local quantum operations at the stations, such that the entanglement present in the links of the whole network gets concentrated between few parties only, regardless of their spatial arrangement.First, we study quantum networks with a two-dimensional lattice structure, where quantum connections between the stations (nodes) are described by non-maximally entangled pure states (links).We show that the generation of a perfectly entangled pair of qubits over an arbitrarily long distance is possible if the initial entanglement of the links is larger than a threshold.This critical value highly depends on the geometry of the lattice, in particular on the connectivity of the nodes, and is related to a classical percolation problem.We then develop a genuine quantum strategy based on multipartite entanglement, improving both the threshold and the success probability of the generation of long-distance entanglement.Second, we consider a mixed-state definition of the connections of the quantum networks.This formalism is well-adapted for a more realistic description of systems in which noise (random errors) inevitably occurs.New techniques are required to create remote entanglement in this setting, and we show how to locally extract and globally process some error syndromes in order to create useful long-distance quantum correlations.Finally, we turn to networks that have a complex topology, which is the case for most real-world communication networks such as the Internet for instance.Besides many other characteristics, these systems have in common the small-world feature, stating that any two nodes are separated by a few links only.Based on the theory of random graphs, we propose a model of quantum complex networks, which exhibit some totally unexpected properties compared to their classical counterparts.5.1 Propagation of a large GHZ state through the lattice . . .5.2 Bit-flip error correction . . . . . . . . . . . . .
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
As quantum technology advances and the size of quantum computers grow, it becomes increasingly important to understand the extent of quality in the devices. As large-scale entanglement is a quantum resource crucial for achieving quantum advantage, the challenge in its generation makes it a valuable benchmark for measuring the performance of universal quantum devices. In this paper, we study entanglement in Greenberger-Horne-Zeilinger (GHZ) and graph states prepared on the range of IBM Quantum devices. We generate GHZ states and investigate their coherence times with respect to state size and dynamical decoupling techniques. A GHZ fidelity of 0.519 ± 0.014 is measured on a 32-qubit GHZ state, certifying its genuine multipartite entanglement (GME). We show a substantial improvement in GHZ decoherence rates for a seven-qubit GHZ state after implementing dynamical decoupling, and observe a linear trend in the decoherence rate of α = ( 7.13 N + 5.54 ) × 10 − 3 µ s − 1 for up to N = 15 qubits, confirming the absence of superdecoherence. Additionally, we prepare and characterize fully bipartite entangled native-graph states on 22 superconducting quantum devices with qubit counts as high as 414 qubits, all active qubits of the 433-qubit IBM Osprey device. Analysis of the decay of two-qubit entanglement within the prepared states shows suppression of coherent noise signals with the implementation of dynamical decoupling techniques. Additionally, we observe that the entanglement in some qubit pairs oscillates over time, which is likely caused by residual ZZ-interactions. Characterizing entanglement in native-graph states, along with detecting entanglement oscillations, can be an effective approach to low-level device benchmarking that encapsulates two-qubit error rates along with additional sources of noise, with possible applications to quantum circuit compilation. We develop several tools to automate the preparation and entanglement characterization of GHZ and graph states. In particular, a method to characterize graph state bipartite entanglement using just 36 circuits, constant with respect to the number of qubits. Published by the American Physical Society 2024
We consider multipath generation of Bell states in quantum networks, where a preprepared multipartite entangled two-dimensional cluster state serves as a resource to perform different tasks on demand. We show how to achieve parallel connections between multiple, freely chosen groups of parties by performing appropriate local measurements along a diagonal, staircase-shaped path on a two-dimensional cluster state. Remarkably, our measurement scheme preserves the entanglement structure of the cluster state such that the remaining state is again a two-dimensional cluster state. We demonstrate strategies for generating crossing, turning, and merging of multiple measurement lines along the two-dimensional cluster state. The results apply to local area as well as to long-distance networks. Published by the American Physical Society 2024
Distributing multipartite entanglement is a prerequisite for scalable quantum networks. Networks restricted to local operations and shared randomness (LOSR) avoid the quantum-memory and latency costs associated with the real-time classical communication required by LOCC-based networks. However, when only bipartite sources are available, LOSR networks cannot prepare useful GHZ states. In earlier work, we conjectured that multipartite sources overcome this limitation and supported this claim with a single numerical example. In this work, we prove the conjecture for regular and uniform networks of arbitrary size. By identifying the hyperedges of the network with the coordinates of a linear code, we show that whenever the edges incident to each node form an information set, a fixed collection of local unitaries, namely the local decoders of the code, transforms the source state into an (N)-party GHZ state with fidelity (d^{m-M}), without requiring any classical communication. Here, (m) denotes the number of edges incident to each node and (M) the total number of edges in the network. For the complete ((N-1))-uniform hypergraph (K_N^{(N-1)}), this fidelity reduces to (1/d). We further prove that this value is optimal among all local-unitary strategies and exceeds the best fidelity achievable using only bipartite sources. For example, in the four-node case, the optimal fidelity is (1/2), compared with the bipartite bound of (1/8). These results demonstrate that multipartite sources, together with shared randomness, can replace real-time classical communication for entanglement distribution.