Graph Picture of Linear Quantum Networks and Entanglement

• URL: http://arxiv.org/abs/2101.00392v3
• Date: Tue, 21 Dec 2021 10:42:28 GMT
• Title: Graph Picture of Linear Quantum Networks and Entanglement
• Authors: Seungbeom Chin, Yong-Su Kim, and Sangmin Lee
• Abstract summary: Linear quantum networks (LQNs) exploit the indistinguishability to generate various multipartite entangled states. 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.
• Score: 6.471031681646444
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: 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.

Related papers

• Inductive Graph Representation Learning with Quantum Graph Neural Networks [0.40964539027092917]
  Quantum Graph Neural Networks (QGNNs) present a promising approach for combining quantum computing with graph-structured data processing. We propose a versatile QGNN framework inspired by the classical GraphSAGE approach, utilizing quantum models as aggregators. We show that our quantum approach exhibits robust generalization across molecules with varying numbers of atoms without requiring circuit modifications.
  arXiv  Detail & Related papers  (2025-03-31T14:04:08Z)
• Tensor-Based Binary Graph Encoding for Variational Quantum Classifiers [3.5051814539447474]
  We propose a novel quantum encoding framework for graph classification using Variational Quantums (VQCs) By constructing slightly more complex circuits tailored for graph encoding, we demonstrate that VQCs can effectively classify graphs within the constraints of current quantum hardware.
  arXiv  Detail & Related papers  (2025-01-24T02:26:21Z)
• QGHNN: A quantum graph Hamiltonian neural network [30.632260870411177]
  Graph Neural Networks (GNNs) strive to address the challenges posed by complex, high-dimensional graph data. Quantum Neural Networks (QNNs) present a compelling alternative due to their potential for quantum parallelism. This paper introduces a quantum graph Hamiltonian neural network (QGHNN) to enhance graph representation and learning on noisy intermediate-scale quantum computers.
  arXiv  Detail & Related papers  (2025-01-14T10:15:17Z)
• Quantum community detection via deterministic elimination [16.34646723046073]
  We propose a quantum algorithm for calculating the structural properties of complex networks and graphs. The corresponding protocol -- deteQt -- is designed to perform large-scale community and botnet detection.
  arXiv  Detail & Related papers  (2024-12-17T18:36:14Z)
• Quantum Networks: from Multipartite Entanglement to Hypergraph Immersion [4.3301675903966625]
  Multipartite entanglement offers various advantages over bipartite entanglement in quantum network (QN) applications. We address the question of whether a QN can be topologically transformed into another via entanglement routing. Our key result is an exact mapping from multipartite entanglement routing to Nash-Williams's graph immersion problem, extended to hypergraphs.
  arXiv  Detail & Related papers  (2024-06-19T11:21:00Z)
• Perfect chiral quantum routing [0.0]
  We consider information encoded in the position of a quantum walker on a graph. We design an optimal structure to achieve perfect quantum routing exploiting chirality and weighting of the edges.
  arXiv  Detail & Related papers  (2024-06-17T17:59:55Z)
• Graph Neural Networks on Quantum Computers [3.8784640343151184]
  Graph Neural Networks (GNNs) are powerful machine learning models that excel at analyzing structured data represented as graphs. This paper proposes frameworks for implementing GNNs on quantum computers to potentially address the challenges.
  arXiv  Detail & Related papers  (2024-05-27T11:31:08Z)
• Quantum Positional Encodings for Graph Neural Networks [1.9791587637442671]
  We propose novel families of positional encodings tailored to graph neural networks obtained with quantum computers. Our inspiration stems from the recent advancements in quantum processing units, which offer computational capabilities beyond the reach of classical hardware.
  arXiv  Detail & Related papers  (2024-05-21T17:56:33Z)
• Optimized Distribution of Entanglement Graph States in Quantum Networks [2.934854825488435]
  In quantum networks, multipartite entangled states distributed over the network help implement and support many quantum network applications. Our work focuses on developing optimal techniques to generate and distribute multipartite entanglement states efficiently.
  arXiv  Detail & Related papers  (2024-04-30T22:00:25Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• 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)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• On the learnability of quantum neural networks [132.1981461292324]
  We consider the learnability of the quantum neural network (QNN) built on the variational hybrid quantum-classical scheme. We show that if a concept can be efficiently learned by QNN, then it can also be effectively learned by QNN even with gate noise.
  arXiv  Detail & Related papers  (2020-07-24T06:34:34Z)

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.