Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Chen, Kuan-Cheng, Burt, Felix, Yu, Shang, Liu, Chen-Yu, Hsieh, Min-Hsiu, Leung, Kin K.
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916569745981440
author Chen, Kuan-Cheng
Burt, Felix
Yu, Shang
Liu, Chen-Yu
Hsieh, Min-Hsiu
Leung, Kin K.
author_facet Chen, Kuan-Cheng
Burt, Felix
Yu, Shang
Liu, Chen-Yu
Hsieh, Min-Hsiu
Leung, Kin K.
contents Optimizing routing in Wireless Sensor Networks (WSNs) is pivotal for minimizing energy consumption and extending network lifetime. This paper introduces a resourceefficient compilation method for distributed quantum circuits tailored to address large-scale WSN routing problems. Leveraging a hybrid classical-quantum framework, we employ spectral clustering for network partitioning and the Quantum Approximate Optimization Algorithm (QAOA) for optimizing routing within manageable subgraphs. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, providing comprehensive mathematical formulations and complexity analyses. Comparative evaluations against traditional classical algorithms demonstrate significant energy savings and enhanced scalability. Our approach underscores the potential of integrating quantum computing techniques into wireless communication networks, offering a scalable and efficient solution for future network optimization challenges
format Preprint
id arxiv_https___arxiv_org_abs_2501_10242
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems
Chen, Kuan-Cheng
Burt, Felix
Yu, Shang
Liu, Chen-Yu
Hsieh, Min-Hsiu
Leung, Kin K.
Quantum Physics
Distributed, Parallel, and Cluster Computing
Optimizing routing in Wireless Sensor Networks (WSNs) is pivotal for minimizing energy consumption and extending network lifetime. This paper introduces a resourceefficient compilation method for distributed quantum circuits tailored to address large-scale WSN routing problems. Leveraging a hybrid classical-quantum framework, we employ spectral clustering for network partitioning and the Quantum Approximate Optimization Algorithm (QAOA) for optimizing routing within manageable subgraphs. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, providing comprehensive mathematical formulations and complexity analyses. Comparative evaluations against traditional classical algorithms demonstrate significant energy savings and enhanced scalability. Our approach underscores the potential of integrating quantum computing techniques into wireless communication networks, offering a scalable and efficient solution for future network optimization challenges
title Resource-Efficient Compilation of Distributed Quantum Circuits for Solving Large-Scale Wireless Communication Network Problems
topic Quantum Physics
Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2501.10242