Quantum Entanglement Path Selection and Qubit Allocation via Adversarial Group Neural Bandits

• URL: http://arxiv.org/abs/2411.00316v1
• Date: Fri, 01 Nov 2024 02:19:50 GMT
• Title: Quantum Entanglement Path Selection and Qubit Allocation via Adversarial Group Neural Bandits
• Authors: Yin Huang, Lei Wang, Jie Xu,
• Abstract summary: Quantum Data Networks (QDNs) have emerged as a promising framework in the field of information processing and transmission. This paper aims to learn the best strategy for achieving the highest success rate of entanglement connections between two chosen quantum computers.
• Score: 6.188254910369404
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Data Networks (QDNs) have emerged as a promising framework in the field of information processing and transmission, harnessing the principles of quantum mechanics. QDNs utilize a quantum teleportation technique through long-distance entanglement connections, encoding data information in quantum bits (qubits). Despite being a cornerstone in various quantum applications, quantum entanglement encounters challenges in establishing connections over extended distances due to probabilistic processes influenced by factors like optical fiber losses. The creation of long-distance entanglement connections between quantum computers involves multiple entanglement links and entanglement swapping techniques through successive quantum nodes, including quantum computers and quantum repeaters, necessitating optimal path selection and qubit allocation. Current research predominantly assumes known success rates of entanglement links between neighboring quantum nodes and overlooks potential network attackers. This paper addresses the online challenge of optimal path selection and qubit allocation, aiming to learn the best strategy for achieving the highest success rate of entanglement connections between two chosen quantum computers without prior knowledge of the success rate and in the presence of a QDN attacker. The proposed approach is based on multi-armed bandits, specifically adversarial group neural bandits, which treat each path as a group and view qubit allocation as arm selection. Our contributions encompass formulating an online adversarial optimization problem, introducing the EXPNeuralUCB bandits algorithm with theoretical performance guarantees, and conducting comprehensive simulations to showcase its superiority over established advanced algorithms.

Related papers

• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Self-Configuring Quantum Networks with Superposition of Trajectories [1.857281678391719]
  Quantum networks are a backbone of future quantum technologies.<n>However, their performance is challenged by noise and decoherence.<n>We propose a self-configuring approach that integrates superposed quantum paths with variational quantum optimization techniques.
  arXiv  Detail & Related papers  (2025-10-21T21:34:54Z)
• Practical Routing and Criticality in Large-Scale Quantum Communication Networks [0.0]
  In quantum communications, there exists a fundamental rate-loss tradeoff for point-to-point quantum channels.<n>Quantum networks are the solution to overcome point-to-point limitations, but they simultaneously invite a challenging open question.<n>Our work reveals the weaknesses of applying single-path routing protocols within quantum networks.
  arXiv  Detail & Related papers  (2025-09-13T17:19:51Z)
• Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications [59.0413662882849]
  Quantum computing is poised to redefine the algorithmic foundations of communication systems.<n>This article outlines the fundamentals of quantum computing in a style familiar to the communications society.<n>We highlight a mathematical harmony between quantum and wireless systems, which makes the topic more enticing to wireless researchers.
  arXiv  Detail & Related papers  (2025-06-25T22:25:47Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [48.670876200492415]
  Variational Quantum Algorithms (VQAs) are a promising approach for leveraging powerful Noisy Intermediate-Scale Quantum (NISQ) computers.<n>We propose $rho$DARTS, a differentiable Quantum Architecture Search (QAS) algorithm that models the search process as the evolution of a quantum mixed state.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• HQSI: Hybrid Quantum Swarm Intelligence -- A Case Study of Online Certificate Status Protocol Request Flow Prediction [0.0]
  Hybrid Quantum Swarm Intelligence (HQSI) constructs a Quantum Neural Network (QNN) model as a forward propagation neural network.<n>HQSI achieves more than a 50% reduction in error against state-of-the-art quantum optimization algorithms.
  arXiv  Detail & Related papers  (2025-05-07T06:16:50Z)
• Optimizing Multi-Hop Quantum Communication using Bidirectional Quantum Teleportation Protocol [0.0]
  We introduce a new method for Bidirectional Quantum Teleportation called Bidirectional Quantum Teleportation using the Modified Dijkstra Algorithm and Quantum Walk (BQT-MDQW) This method uses different types of entangled states, such as the GHZ-Bell state, W-Bell state, and Cluster-Bell state, to improve quantum communication in quantum wireless networks.
  arXiv  Detail & Related papers  (2025-04-09T22:38:53Z)
• Routing in Quantum Networks with End-to-End Knowledge [10.955844285189373]
  We introduce an approach that facilitates the establishment of paths capable of delivering end-to-end fidelity above a specified threshold. We define algorithms that are specific instances of this approach and evaluate them in comparison to Dijkstra shortest path algorithm and a fully knowledge-aware algorithm through simulations. Our results demonstrate that one of the grey box algorithms consistently outperforms the other methods in delivering paths above the fidelity threshold.
  arXiv  Detail & Related papers  (2024-07-19T15:34:51Z)
• Quantum Approximate Optimization: A Computational Intelligence Perspective [1.756184965281354]
  We introduce quantum computing and variational quantum algorithms (VQAs) We explain Farhi et al.'s quantum approximate optimization algorithm (Farhi's QAOA) We discuss connections of QAOA to relevant domains, such as computational learning theory and genetic algorithms.
  arXiv  Detail & Related papers  (2024-07-09T19:40:23Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Towards Quantum-Native Communication Systems: New Developments, Trends, and Challenges [63.67245855948243]
  The survey examines technologies such as quantum-domain (QD) multi-input multi-output (MIMO), QD non-orthogonal multiple access (NOMA), quantum secure direct communication (QSDC) The current status of quantum sensing, quantum radar, and quantum timing is briefly reviewed in support of future applications.
  arXiv  Detail & Related papers  (2023-11-09T09:45:52Z)
• Calibrating the role of entanglement in variational quantum circuits [0.6435156676256051]
  Entanglement is a key property of quantum computing that separates it from its classical counterpart. We systematically probe the role of entanglement in the working of two variational quantum algorithms. We find that for the MAX-CUT problem solved using QAOA, the fidelity as a function of entanglement is highly dependent on the number of layers. In the case of QNNs, trained circuits with high test accuracies are underpinned by higher entanglement, with any enforced limitation in entanglement resulting in a sharp decline in test accuracy.
  arXiv  Detail & Related papers  (2023-10-16T23:36:40Z)
• 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)
• DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization in Future Networks [54.03701670739067]
  We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks. Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
  arXiv  Detail & Related papers  (2022-09-16T02:44:52Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Entangling Quantum Generative Adversarial Networks [53.25397072813582]
  We propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN) We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-04-30T20:38:41Z)
• 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)
• Purification and Entanglement Routing on Quantum Networks [55.41644538483948]
  A quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We introduce effectives enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network.
  arXiv  Detail & Related papers  (2020-11-23T19:00:01Z)

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.