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

Research on quantum satellite access selection based on Q-learning quantum ant colony algorithm

Yan Kang, Min Nie, Guang Yang

Published Sep 20, 2024• 0 citations
Publisher

Abstract

The development and deployment of low-orbit quantum satellites has become one of the important research directions in the field of quantum communication technology. In order to improve the security and service quality of quantum satellite network, this paper proposes a multi-attribute quantum satellite selection access technique based on Q-learning quantum ant colony. Considering the two optimization objectives of path combined trust value and path cost, the overall trust function is defined according to the direct trust value and indirect trust value to improve the security, and the cost function is defined according to the channel QBER(Quantum bit error rate), interstellar transmission delay, and channel establishment rate to improve the service quality. Simulation results show that compared with the traditional ant colony optimization algorithm and the improved quantum ant colony multi-constraint algorithm, the Q-learning quantum ant colony algorithm significantly improves the performance indexes such as the packet delivery rate and the system blocking rate of the quantum satellite access selection, and improves the convergence speed, which is of certain reference significance for the research on the access selection of quantum satellites.

DOI
10.1145/3703935.3704067

Related papers

Optimization Strategy for Satelliet Submarine Quantum Communication based on Improved Ant Colony Algorithm

Bowei Lei, Min Nie, Guang Yang

This article proposes an optimization strategy for star submarine quantum communication based on improved ant colony algorithm, aiming to solve the problems of signal attenuation and bit error rate caused by factors such as particle pollution and transmission distance in the star submarine quantum communication link. By introducing an improved ant colony algorithm, key parameters in quantum communication links (bit error rate, link attenuation, and satellite signal strength) were optimized, and a comprehensive performance objective function was constructed based on the characteristics of quantum communication. The experimental results show that the improved ant colony algorithm can effectively improve the receiving efficiency of quantum optical signals, reduce the bit error rate, and maintain high communication reliability in complex environments. Compared with traditional ant colony algorithm and three multi-objective optimization algorithms, the improved ant colony algorithm shows significant advantages in objective function correlation, time complexity, and actual communication performance. This study provides new ideas for the combination of star submarine quantum communication and artificial intelligence fields.

International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)•Jul 26, 2025•0 citations

Quantum Max-min Ant Colony Algorithm For QoS Routing Problem

Yalong Li, Wang Wei, Sun Jing +1 more

Abstract Aiming at the ant colony algorithm is weak to solve the problem of QoS routing, this paper proposes a routing algorithm that combines quantum computing with the max-min ant colony algorithm. The algorithm introduces a quantum selection strategy, uses qubit probability amplitude to encode the path, and dynamically adjusts the quantum rotation gate to update the path quantum coding on the basis of the minimum cost to meet the constraints and other optimal conditions, combined with the maximum and minimum pheromone determination mechanism to find the optimal path, effectively control the evolution speed and direction, and accelerate the algorithm convergence. Experimental results show that the algorithm is effective in controlling the speed and direction of evolution, and has better optimization ability and convergence performance than ant colony algorithm.

Journal of Physics Conference Series•Mar 1, 2021•1 citation

Multi-Agent Q-learning based on quantum theory and ant colony algorithm

Wang Sheng-bin

Due to the interactions among the Agents in the cooperative multi-Agent systems,multi-Agent learning problem complexity can rise rapidly with the number of Agents or their behavioral sophistication.In order to converge to desirable equilibrium,Agents generally require sufficient exploration of strategy space and coordinate their policies to achieve optimal equilibrium.A novel cooperative multi-Agent learning method is proposed based on quantum theory,ant algorithm and Q-learning.First,this method not only coordinates Agents'behaviors using quantum entanglement and helps Agents make action selection under quantum superposition,but also adopts Grover's searching algorithm which can probe the action,speed up learn-ing.Second,according to ant algorithm,footmark thought is presented so that Agents can be indirectly enforced to communicate with others.At last,the theory analysis and result of experiment both demonstrate that the improved Q-learning is feasible and increases the learning efficiency.

Computer Engineering and Applications Journal•Jan 1, 2010•0 citations

Quantum ant colony algorithm for continuous space optimization

Shiyong Li

To tackle the shortcoming of ant colony optimization which can only be applied to discrete problems and hold a slow convergence rate,a novel method for solving optimization problems in continuous space is presented.In this algorithm,each ant carries a group of quantum bits which represent the position of the ant.Firstly,the target where the ant is going to move is selected according to the selection probability based on pheromone information and heuristic information.Secondly,quantum bits of the ant are updated by quantum rotation gates so as to enable the ant to move.Some quantum bits are mutated by quantum non-gate so as to increase the variety of ant positions.Finally,pheromone information and the heuristic information are updated according to the new position of each ant arrived at.In this algorithm,both probability amplitudes of a quantum bit are regarded as position information belonging to an ant,a double searching space is acquired for ant colony which hold the same number of ants.At last,the availability of the algorithm is illustrated by two application examples of function optimization and weight optimization of neural networks.

Control theory & applications•Jan 1, 2008•19 citations

Ant colony algorithm and application based on quantum space

Jiyin Li

Aimming at the low convergent rate of the ant colony algorithm(ACA)and the disadvantage of falling into local extremum easily,this paper proposes a method of combining quantum evolutionary algorithms with ACA,which regards two probability amplitudes of quantum bits as current location of ant.When the number of ants is the same,the proposed algorithm makes the search space double and uses the quantum gate to realize the variation operation.Compared with the traditional algorithms,it has better population diversity in the optimization process and effectively avoids the prematurity and stagnation phenomenon of ACA.This method can be used in image segmentation.The experimental results show that this method is effective to solve the slow convergence rate and easy to fall into local extremum problems of ACA,and segmentation speed and precision have been improved greatly.

Systems engineering and electronics•Jan 1, 2013•0 citations

An Improved Quantum Ant Colony Optimization Algorithm for Solving Complex Function Problems

Changai Chen, Yanwen Xu

In order to improve the slow convergence speed and avoid falling into the local optimum in ant colony optimization algorithm, an improved quantum ant colony optimization (IMAQACO) algorithm based on combing quantum evolutionary algorithm with ant colony optimization algorithm is proposed for solving complex function problems in this paper.In the IMAQACO algorithm, the quantum state vectors are used to represent the pheromone, the adaptively dynamical updating strategy is used to control pheromone evaporation factor, the quantum rotation gate is used to realize the ant movement and change the convergence tend of quantum probability amplitude, quantum non-gate is used to realize ant location variation, so the IMAQACO algorithm has better global search ability and population diversity than ACO algorithm.In order to test the optimization performance of IMAQACO algorithm, several benchmark functions are selected in here.The tested results indicate that the IMAQACO can effectively improve the convergence speed and avoid falling into the local optimum, and has a stronger global optimization ability and higher convergence speed in solving complex function problems.

International Journal of Multimedia and Ubiquitous Engineering•Nov 30, 2015•2 citations
The development and deployment of low-orbit quantum satellites has become one of the important research directions in the field of quantum communication technology. In order to improve the security and service quality of quantum satellite network, this paper proposes a multi-attribute quantum satellite selection access technique based on Q-learning quantum ant colony. Considering the two optimization objectives of path combined trust value and path cost, the overall trust function is defined according to the direct trust value and indirect trust value to improve the security, and the cost function is defined according to the channel QBER(Quantum bit error rate), interstellar transmission delay, and channel establishment rate to improve the service quality. Simulation results show that compared with the traditional ant colony optimization algorithm and the improved quantum ant colony multi-constraint algorithm, the Q-learning quantum ant colony algorithm significantly improves the performance indexes such as the packet delivery rate and the system blocking rate of the quantum satellite access selection, and improves the convergence speed, which is of certain reference significance for the research on the access selection of quantum satellites.
This article proposes an optimization strategy for star submarine quantum communication based on improved ant colony algorithm, aiming to solve the problems of signal attenuation and bit error rate caused by factors such as particle pollution and transmission distance in the star submarine quantum communication link. By introducing an improved ant colony algorithm, key parameters in quantum communication links (bit error rate, link attenuation, and satellite signal strength) were optimized, and a comprehensive performance objective function was constructed based on the characteristics of quantum communication. The experimental results show that the improved ant colony algorithm can effectively improve the receiving efficiency of quantum optical signals, reduce the bit error rate, and maintain high communication reliability in complex environments. Compared with traditional ant colony algorithm and three multi-objective optimization algorithms, the improved ant colony algorithm shows significant advantages in objective function correlation, time complexity, and actual communication performance. This study provides new ideas for the combination of star submarine quantum communication and artificial intelligence fields.
Abstract Aiming at the ant colony algorithm is weak to solve the problem of QoS routing, this paper proposes a routing algorithm that combines quantum computing with the max-min ant colony algorithm. The algorithm introduces a quantum selection strategy, uses qubit probability amplitude to encode the path, and dynamically adjusts the quantum rotation gate to update the path quantum coding on the basis of the minimum cost to meet the constraints and other optimal conditions, combined with the maximum and minimum pheromone determination mechanism to find the optimal path, effectively control the evolution speed and direction, and accelerate the algorithm convergence. Experimental results show that the algorithm is effective in controlling the speed and direction of evolution, and has better optimization ability and convergence performance than ant colony algorithm.
Due to the interactions among the Agents in the cooperative multi-Agent systems,multi-Agent learning problem complexity can rise rapidly with the number of Agents or their behavioral sophistication.In order to converge to desirable equilibrium,Agents generally require sufficient exploration of strategy space and coordinate their policies to achieve optimal equilibrium.A novel cooperative multi-Agent learning method is proposed based on quantum theory,ant algorithm and Q-learning.First,this method not only coordinates Agents'behaviors using quantum entanglement and helps Agents make action selection under quantum superposition,but also adopts Grover's searching algorithm which can probe the action,speed up learn-ing.Second,according to ant algorithm,footmark thought is presented so that Agents can be indirectly enforced to communicate with others.At last,the theory analysis and result of experiment both demonstrate that the improved Q-learning is feasible and increases the learning efficiency.
To tackle the shortcoming of ant colony optimization which can only be applied to discrete problems and hold a slow convergence rate,a novel method for solving optimization problems in continuous space is presented.In this algorithm,each ant carries a group of quantum bits which represent the position of the ant.Firstly,the target where the ant is going to move is selected according to the selection probability based on pheromone information and heuristic information.Secondly,quantum bits of the ant are updated by quantum rotation gates so as to enable the ant to move.Some quantum bits are mutated by quantum non-gate so as to increase the variety of ant positions.Finally,pheromone information and the heuristic information are updated according to the new position of each ant arrived at.In this algorithm,both probability amplitudes of a quantum bit are regarded as position information belonging to an ant,a double searching space is acquired for ant colony which hold the same number of ants.At last,the availability of the algorithm is illustrated by two application examples of function optimization and weight optimization of neural networks.
Aimming at the low convergent rate of the ant colony algorithm(ACA)and the disadvantage of falling into local extremum easily,this paper proposes a method of combining quantum evolutionary algorithms with ACA,which regards two probability amplitudes of quantum bits as current location of ant.When the number of ants is the same,the proposed algorithm makes the search space double and uses the quantum gate to realize the variation operation.Compared with the traditional algorithms,it has better population diversity in the optimization process and effectively avoids the prematurity and stagnation phenomenon of ACA.This method can be used in image segmentation.The experimental results show that this method is effective to solve the slow convergence rate and easy to fall into local extremum problems of ACA,and segmentation speed and precision have been improved greatly.
In order to improve the slow convergence speed and avoid falling into the local optimum in ant colony optimization algorithm, an improved quantum ant colony optimization (IMAQACO) algorithm based on combing quantum evolutionary algorithm with ant colony optimization algorithm is proposed for solving complex function problems in this paper.In the IMAQACO algorithm, the quantum state vectors are used to represent the pheromone, the adaptively dynamical updating strategy is used to control pheromone evaporation factor, the quantum rotation gate is used to realize the ant movement and change the convergence tend of quantum probability amplitude, quantum non-gate is used to realize ant location variation, so the IMAQACO algorithm has better global search ability and population diversity than ACO algorithm.In order to test the optimization performance of IMAQACO algorithm, several benchmark functions are selected in here.The tested results indicate that the IMAQACO can effectively improve the convergence speed and avoid falling into the local optimum, and has a stronger global optimization ability and higher convergence speed in solving complex function problems.