Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Control and Automation

Quantum Boson Data Aggregation Scheduling in UOSN

S. Madhavi

Published Apr 30, 2015• 1 citation
Publisher

Abstract

Data Aggregation Scheduling in Ubiquitous sensor networks is a major research interest for many researchers with the objective of reducing energy consumption and maximizing the network lifetime.Also the capacity of a channel for transmitting quantum states called the quantum capacity should be maximized,The sensor nodes should periodically forward data to the base station.Since battery power and bandwidth are the two resources to be effectively utilized the sensor nodes forwards data to the nearest neighbor node which inturn forwards the data to its neighbors and this repeats until all the sensors data aggregates at the base station.In a large network scheduling the sensor nodes for forwarding the data is very much essential and since the topology of the USN changes dynamically , finding such a schedule is also very difficult.In [1] the authors proposed a bosonic network model for communication.In this paper we present a quantum bosonic data aggregation method for constructing the optimal schedule of nodes for data aggregation called QBDAS (Quantum Boson Data aggregation scheduling) protocol.The main idea is to search a optimal schedule through utilizing the observable or measurable physical properties the network topology.

DOI
10.14257/ijca.2015.8.4.22

Related papers

Power Optimized Quantum Data Aggregation Scheduling

S. Madhavi

Communication Networks have limited resources like bandwidth and battery power.Hence efficient node scheduling protocols and communication protocols are needed to maximize the network throughput.In this paper, we discussed an optimal data aggregation scheduling problem for quantum networks.To optimize the utilization of the network bandwidth much research is done to find schedules with minimum frame length.In this paper we proposed a method for finding efficient quantum node scheduling.The schedule contains a set of slots where each slot is allotted to one or more quantum nodes for transmitting at the same time.Adjacent Quantum nodes can create entanglement for transmitting the data.The quantum nodes entangles with its neighbor quantum nodes during the slot allotted to them.Loss and distortion are the two major problems in free space channels transmission.The optical noise produced when two or more nodes are transmitting data concurrently interferes with the actual data.Hence the optical signal to noise ratio OSNR ie Square root of the signal power divided the square root of the noise power is used as a threshold on concurrent transmitters.In this proposed method we used OSNR for finding a set of nodes that can entangle concurrently for aggregating the data to the base station.Entanglement rate of each node is used as a metric for finding a schedule that maximizes the quantum network throughput.We derive a Power Optimized Maximal Link Entanglement Rate based Scheduling Method which maximizes the quantum network throughput and also increases the network life time.

International Journal of Grid and Distributed Computing•Jul 31, 2018•0 citations

A Reinforcement Learning Model for Quantum Network Data Aggregation and Analysis

Quantum Entanglement and Quantum swapping are major research areas nowadays.Remote quantum entanglement is used in many applications like secure communication, secret sharing, data aggregation, and precision sensing.In data aggregation applications, every sensor node captures data and communicates to the central node.Efficient Data aggregation depends on whether the local information or global quantum network information is used for constructing the aggregation schedules.In addition, Quantum networks suffer from lossy optical links and with limited resources such as quantum memories, edge capacities.Computation of optimal schedules deals with large quantities of data and complex time-consuming calculations.However, the quantum memories cannot hold the qubits for a longer time as the stored qubit completely decoheres an infinite amount of time.Hence, there is a necessity for finding new data aggregation scheduling protocols, which use optimal channel capacity and optimal size of memory for improving the network throughput.This paper uses a reinforcement-learning technique that considers entanglement pairing and swapping the success probability of nodes with their neighbors while finding an optimal scheduling policy.The proposed method uses local network information for constructing optimal data aggregation schedules by prior sharing the maximally entangled qubit pairs between the nodes through optimal usage of the processes, channel capacity, and memory at the intermediate nodes.Experiments show that our proposed method can maximize the network throughput.

Journal of System and Management Sciences•Feb 20, 2022•5 citations

ESDI: Entanglement Scheduling and Distribution in the Quantum Internet

Huayue Gu, Ruozhou Yu, Zhouyu Li +2 more

Quantum entanglement distribution between remote nodes is key to many promising quantum applications. Existing mechanisms have mainly focused on improving throughput and fidelity via entanglement routing or single-node scheduling. This paper considers entanglement scheduling and distribution among many source-destination pairs with different requests over an entire quantum network topology. Two practical scenarios are considered. When requests do not have deadlines, we seek to minimize the average completion time of the communication requests. If deadlines are specified, we seek to maximize the number of requests whose deadlines are met. Inspired by optimal scheduling disciplines in conventional single-queue scenarios, we design a general optimization framework for entanglement scheduling and distribution called ESDI, and develop a probabilistic protocol to implement the optimized solutions in a general buffered quantum network. We develop a discrete-time quantum network simulator for evaluation. Results show the superior performance of ESDI compared to existing solutions.

arXiv:2303.17540•International Conference on Computer Communications and Networks (ICCCN)•Jul 1, 2023•16 citations

Entanglement Request Scheduling in Quantum Networks Using Deep Q-Network

Gongyu Ni, Lester Ho, Holger Claußen

In this paper, a novel Deep Q-Network (DQN) based scheduling method to optimize delay time and fairness among entanglement requests in quantum repeater networks is proposed. The scheduling of requests determines which pairs of end nodes should be entangled during the current time slot, while other pairs are placed in a queue for future slots. However, existing research on quantum networking often relies on simple statistical models to capture the behavior of quantum hardware, such as the failure rate of establishing entanglement. Moreover, current quantum simulators do not support network behaviors, including handling, pending, and dropping requests. To bridge the gap between quantum deployments and network behaviors, in this paper a dynamic network model is presented, encompassing quantum simulations, random topologies, and user modeling. The DQN based scheduling scheme allows us to balance the conflicting objectives of minimizing delay time and maximizing fairness among these entanglement requests. The proposed technique was evaluated using simulations, with results showing that the proposed DQN achieves higher performance compared to Greedy, Proportional fair and FIFO scheduling schemes.

arXiv:2505.12461•International Conference on Communications•Jun 8, 2025•7 citations

QUBO-Based Scheduling of Heterogeneous Quantum Computing Resources in Scale-Free Industrial Networks

Yong Wang, Xiaoling Wang, Yu Pan +1 more

Large-scale industrial networks often exhibit scale-free topologies in which a few hub nodes concentrate most computational demand, whereas Noisy Intermediate-Scale Quantum (NISQ)-era resources remain heterogeneous and constrained by limited qubits, noise, connectivity, and cost. This mismatch motivates a topology-aware QUBO-based framework for heterogeneous quantum resource scheduling over scale-free networks. Our proposed model unifies hub importance, workload demand, hardware capacity constraints, and communication overhead within a single objective, thereby enabling feasible and globally optimized allocations. Experiments on synthetic scale-free networks show that, when solved using an optical Ising machine, the proposed method consistently achieves lower objective values than random assignment and classical metaheuristics, with advantages that grow as network size and hub-node count increase. The optical Ising platform also provides substantial runtime reduction, while simulated annealing and tabu search yield competitive solutions with stable convergence. These results demonstrate the scalability and hardware compatibility of the proposed framework for large-scale quantum resource scheduling under NISQ constraints.

Youth Academic Annual Conference of Chinese Association of Automation (YAC)•May 1, 2026•0 citations

Optimum Resource Allocation in Secure Quantum Networks: Survey of Enabling Technology

Savo Glisic, Beatriz Lorenzo

Due to its complexity, resource allocation in complex communication networks has been always designed with great deal of approximations and restrictions. With the availability of quantum computing, quantum optimization and quantum search algorithms, we are able to overcome these limitations significantly and come up with more precise and efficient “quantum era” algorithms. The main objective of this paper is to provide the future network designers with a new optimization framework for resource (capacity and secrete key rate) allocation in quantum networks. The analysis is general to include: the classical capacityC, for transmitting classical information; the quantum capacityQ, for reliably transmitting intact quantum states; the two-way classical-assisted quantum capacityQ2, for transmitting quantum states with the help of a two-way classical side channel; and the entanglement-assisted classical capacityCE, which we define as the classical capacity of a quantum channel enabled by prior shared entanglement between two nodes. Once the optimization framework is introduced the rest of the paper discusses the optimization constraints, by surveying some examples of the relevant work on achievable network resources (capacity and secrete key rate) and relaxation of the optimization constraints by increasing these parameters using the quantum coding schemes. These constraints are an integral part of the optimization algorithms and full understanding of their nature and limits is essential for system optimization. The achievable secret key rates/capacity of quantum channels are limited, so our optimization framework for resource allocation enables maximization of the overall resources allocated to all users, or maximization of the number of users accessing the network, or minimization of the number of hopes on the routes or maximization of remaining resources in the most critical node in the network. The optimization problems have combinatorial form, and the most efficient execution of these algorithms can be achieved by using quantum search algorithms like Grover’s algorithm or quantum approximative optimization algorithms (QAOA) which are extensively discussed in the paper.Regarding the scope of the technology survey in Section VIII we summarize the coverage of our targeted survey and the coverage of other relevant works.

IEEE Access•Jan 1, 2025•3 citations
Data Aggregation Scheduling in Ubiquitous sensor networks is a major research interest for many researchers with the objective of reducing energy consumption and maximizing the network lifetime.Also the capacity of a channel for transmitting quantum states called the quantum capacity should be maximized,The sensor nodes should periodically forward data to the base station.Since battery power and bandwidth are the two resources to be effectively utilized the sensor nodes forwards data to the nearest neighbor node which inturn forwards the data to its neighbors and this repeats until all the sensors data aggregates at the base station.In a large network scheduling the sensor nodes for forwarding the data is very much essential and since the topology of the USN changes dynamically , finding such a schedule is also very difficult.In [1] the authors proposed a bosonic network model for communication.In this paper we present a quantum bosonic data aggregation method for constructing the optimal schedule of nodes for data aggregation called QBDAS (Quantum Boson Data aggregation scheduling) protocol.The main idea is to search a optimal schedule through utilizing the observable or measurable physical properties the network topology.
Communication Networks have limited resources like bandwidth and battery power.Hence efficient node scheduling protocols and communication protocols are needed to maximize the network throughput.In this paper, we discussed an optimal data aggregation scheduling problem for quantum networks.To optimize the utilization of the network bandwidth much research is done to find schedules with minimum frame length.In this paper we proposed a method for finding efficient quantum node scheduling.The schedule contains a set of slots where each slot is allotted to one or more quantum nodes for transmitting at the same time.Adjacent Quantum nodes can create entanglement for transmitting the data.The quantum nodes entangles with its neighbor quantum nodes during the slot allotted to them.Loss and distortion are the two major problems in free space channels transmission.The optical noise produced when two or more nodes are transmitting data concurrently interferes with the actual data.Hence the optical signal to noise ratio OSNR ie Square root of the signal power divided the square root of the noise power is used as a threshold on concurrent transmitters.In this proposed method we used OSNR for finding a set of nodes that can entangle concurrently for aggregating the data to the base station.Entanglement rate of each node is used as a metric for finding a schedule that maximizes the quantum network throughput.We derive a Power Optimized Maximal Link Entanglement Rate based Scheduling Method which maximizes the quantum network throughput and also increases the network life time.
Quantum Entanglement and Quantum swapping are major research areas nowadays.Remote quantum entanglement is used in many applications like secure communication, secret sharing, data aggregation, and precision sensing.In data aggregation applications, every sensor node captures data and communicates to the central node.Efficient Data aggregation depends on whether the local information or global quantum network information is used for constructing the aggregation schedules.In addition, Quantum networks suffer from lossy optical links and with limited resources such as quantum memories, edge capacities.Computation of optimal schedules deals with large quantities of data and complex time-consuming calculations.However, the quantum memories cannot hold the qubits for a longer time as the stored qubit completely decoheres an infinite amount of time.Hence, there is a necessity for finding new data aggregation scheduling protocols, which use optimal channel capacity and optimal size of memory for improving the network throughput.This paper uses a reinforcement-learning technique that considers entanglement pairing and swapping the success probability of nodes with their neighbors while finding an optimal scheduling policy.The proposed method uses local network information for constructing optimal data aggregation schedules by prior sharing the maximally entangled qubit pairs between the nodes through optimal usage of the processes, channel capacity, and memory at the intermediate nodes.Experiments show that our proposed method can maximize the network throughput.
Quantum entanglement distribution between remote nodes is key to many promising quantum applications. Existing mechanisms have mainly focused on improving throughput and fidelity via entanglement routing or single-node scheduling. This paper considers entanglement scheduling and distribution among many source-destination pairs with different requests over an entire quantum network topology. Two practical scenarios are considered. When requests do not have deadlines, we seek to minimize the average completion time of the communication requests. If deadlines are specified, we seek to maximize the number of requests whose deadlines are met. Inspired by optimal scheduling disciplines in conventional single-queue scenarios, we design a general optimization framework for entanglement scheduling and distribution called ESDI, and develop a probabilistic protocol to implement the optimized solutions in a general buffered quantum network. We develop a discrete-time quantum network simulator for evaluation. Results show the superior performance of ESDI compared to existing solutions.
In this paper, a novel Deep Q-Network (DQN) based scheduling method to optimize delay time and fairness among entanglement requests in quantum repeater networks is proposed. The scheduling of requests determines which pairs of end nodes should be entangled during the current time slot, while other pairs are placed in a queue for future slots. However, existing research on quantum networking often relies on simple statistical models to capture the behavior of quantum hardware, such as the failure rate of establishing entanglement. Moreover, current quantum simulators do not support network behaviors, including handling, pending, and dropping requests. To bridge the gap between quantum deployments and network behaviors, in this paper a dynamic network model is presented, encompassing quantum simulations, random topologies, and user modeling. The DQN based scheduling scheme allows us to balance the conflicting objectives of minimizing delay time and maximizing fairness among these entanglement requests. The proposed technique was evaluated using simulations, with results showing that the proposed DQN achieves higher performance compared to Greedy, Proportional fair and FIFO scheduling schemes.
Large-scale industrial networks often exhibit scale-free topologies in which a few hub nodes concentrate most computational demand, whereas Noisy Intermediate-Scale Quantum (NISQ)-era resources remain heterogeneous and constrained by limited qubits, noise, connectivity, and cost. This mismatch motivates a topology-aware QUBO-based framework for heterogeneous quantum resource scheduling over scale-free networks. Our proposed model unifies hub importance, workload demand, hardware capacity constraints, and communication overhead within a single objective, thereby enabling feasible and globally optimized allocations. Experiments on synthetic scale-free networks show that, when solved using an optical Ising machine, the proposed method consistently achieves lower objective values than random assignment and classical metaheuristics, with advantages that grow as network size and hub-node count increase. The optical Ising platform also provides substantial runtime reduction, while simulated annealing and tabu search yield competitive solutions with stable convergence. These results demonstrate the scalability and hardware compatibility of the proposed framework for large-scale quantum resource scheduling under NISQ constraints.
Due to its complexity, resource allocation in complex communication networks has been always designed with great deal of approximations and restrictions. With the availability of quantum computing, quantum optimization and quantum search algorithms, we are able to overcome these limitations significantly and come up with more precise and efficient “quantum era” algorithms. The main objective of this paper is to provide the future network designers with a new optimization framework for resource (capacity and secrete key rate) allocation in quantum networks. The analysis is general to include: the classical capacityC, for transmitting classical information; the quantum capacityQ, for reliably transmitting intact quantum states; the two-way classical-assisted quantum capacityQ2, for transmitting quantum states with the help of a two-way classical side channel; and the entanglement-assisted classical capacityCE, which we define as the classical capacity of a quantum channel enabled by prior shared entanglement between two nodes. Once the optimization framework is introduced the rest of the paper discusses the optimization constraints, by surveying some examples of the relevant work on achievable network resources (capacity and secrete key rate) and relaxation of the optimization constraints by increasing these parameters using the quantum coding schemes. These constraints are an integral part of the optimization algorithms and full understanding of their nature and limits is essential for system optimization. The achievable secret key rates/capacity of quantum channels are limited, so our optimization framework for resource allocation enables maximization of the overall resources allocated to all users, or maximization of the number of users accessing the network, or minimization of the number of hopes on the routes or maximization of remaining resources in the most critical node in the network. The optimization problems have combinatorial form, and the most efficient execution of these algorithms can be achieved by using quantum search algorithms like Grover’s algorithm or quantum approximative optimization algorithms (QAOA) which are extensively discussed in the paper.Regarding the scope of the technology survey in Section VIII we summarize the coverage of our targeted survey and the coverage of other relevant works.