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

Quantum Machine Intelligence

Swarm-intelligence-based quantum-inspired optimization techniques for enhancing algorithmic efficiency and empirical assessment

Ishaani Priyadarshini

Published Oct 24, 2024• 25 citations
Publisher
DOI
10.1007/s42484-024-00201-z

Related papers

A Modified Quantum-Inspired Particle Swarm Optimization Algorithm

Ling Wang, Mingde Zhang, Qun Niu +1 more

Lecture notes in computer science•Jan 1, 2011•5 citations

A study of linear weighted sum optimization based on quantum-annealing-inspired swarm intelligence

Akio Yoshizawa

The Japan Society of Applied Physics•Jan 28, 2020•0 citations

基于生物启发算法的量子寻址编码优化

Jincheng Zhang

This paper explores the application of bio-inspired algorithms for optimizing quantum addressing codes. Quantum addressing is a crucial component in quantum computing, directly impacting the fidelity and efficiency of quantum operations. Traditional quantum addressing schemes often struggle with optimization, leading to suboptimal performance. This work proposes a novel framework leveraging biological optimization algorithms – specifically, a modified Particle Swarm Optimization (PSO) – to refine quantum addressing code configurations. The core idea is to mimic the swarm intelligence found in nature, where individuals (particles) iteratively adjust their positions based on their own experience and the collective knowledge of the swarm, to find the best possible address mapping. The optimization process aims to minimize the error rate associated with quantum operations by strategically assigning qubits to addresses. We present a detailed methodology incorporating PSO, outlining the objective function, constraints, and the algorithm's parameters. Simulation results demonstrate the efficacy of this approach, showcasing a significant improvement in addressing efficiency and accuracy compared to conventional methods. The key contribution lies in the systematic integration of a biologically inspired algorithm into the quantum addressing problem, offering a potentially scalable and robust solution for enhancing quantum computing performance.

•Sep 6, 2026•0 citations

Quantum-Inspired Algorithms for Scalable Optimization in Big Data Analytics

M. Venkata Subramanian, Amjad Ali Syed, Ashish Avasthi +3 more

As modern data environments continue to scale in volume and dimensionality, classical metaheuristics like Genetic Algorithms (GA) and Particle Swarm Optimization (PSO) struggle to balance convergence efficiency with solution quality. The challenge is further amplified in big data optimization, where stagnation in local minima and prohibitive computation time impede real-time applicability. Existing methods fail to simultaneously address the need for global search intelligence and computational scalability, especially under high-dimensional constraints and distributed workloads. To bridge this gap, we propose QIESO—a Quantum-Inspired Evolutionary Swarm Optimizer that integrates quantum amplitude encoding, probabilistic gate rotation, swarm coordination, and tunnelingbased mutation to escape local traps and accelerate convergence. Unlike traditional optimizers, QIESO leverages quantum principles simulated classically to maintain coherence across the search space while reducing evaluation overhead. Empirical validation across datasets up to 100 million records shows QIESO achieves a 51.7% reduction in runtime over GA and 42.7% faster convergence than PSO, with a relative error margin consistently under 2.1%. The method exhibits sublinear scalability in time complexity due to dimensionality-agnostic encoding. This work significantly advances scalable optimization for high-throughput environments, making it ideal for applications in autonomous systems, real-time analytics, and next-gen intelligent infrastructures.

International Conference on Advances in Computation, Communication and Information Technology (ICAICCIT)•Oct 31, 2025•0 citations

Hybrid quantum particle swarm optimization algorithm and its application

Yukun Wang, Xuebo Chen

Science China Information Sciences•Sep 10, 2019•30 citations

Quantum-Inspired Optimization for High-Dimensional Data Classification in Healthcare Analytics

Hanae Sugimoto, Kaito Morishita

High-dimensional medical datasets pose a persistent challenge for artificial intelligence because traditional classification algorithms often incur escalating computational costs and reduced predictive accuracy. As healthcare systems generate increasingly complex clinical records, imaging outputs, and genomic profiles, scalable analytic methods that balance precision and efficiency are critical. This study proposes a Quantum-Inspired Optimization (QIO) framework for efficient and accurate classification of high-dimensional healthcare data. Leveraging the exploratory power of variational quantum algorithms, specifically techniques analogous to the Quantum Approximate Optimization Algorithm, the framework integrates quantum-style search strategies with classical computation to achieve global optimization and numerical stability. Publicly available medical datasets with hundreds of features were used to evaluate the approach. Classification models were trained and tested across varying feature dimensionalities, and performance was assessed using accuracy, runtime, and scalability metrics. Empirical results demonstrate that QIO achieves up to 95.4% classification accuracy and reduces computational time by 40% compared with state-of-the-art classical baselines. The method demonstrates stable convergence and clear decision boundaries even as feature dimensionality grows, highlighting its resilience to the curse of dimensionality. These results indicate that QIO can enable fast and reliable healthcare analytics in data-rich clinical environments. Future research may examine domain-specific adaptations, real-time deployment, and integration with emerging quantum hardware to enhance the impact of quantum-inspired artificial intelligence further.

Journal of Technology Informatics and Engineering•Dec 20, 2025•2 citations
This paper explores the application of bio-inspired algorithms for optimizing quantum addressing codes. Quantum addressing is a crucial component in quantum computing, directly impacting the fidelity and efficiency of quantum operations. Traditional quantum addressing schemes often struggle with optimization, leading to suboptimal performance. This work proposes a novel framework leveraging biological optimization algorithms – specifically, a modified Particle Swarm Optimization (PSO) – to refine quantum addressing code configurations. The core idea is to mimic the swarm intelligence found in nature, where individuals (particles) iteratively adjust their positions based on their own experience and the collective knowledge of the swarm, to find the best possible address mapping. The optimization process aims to minimize the error rate associated with quantum operations by strategically assigning qubits to addresses. We present a detailed methodology incorporating PSO, outlining the objective function, constraints, and the algorithm's parameters. Simulation results demonstrate the efficacy of this approach, showcasing a significant improvement in addressing efficiency and accuracy compared to conventional methods. The key contribution lies in the systematic integration of a biologically inspired algorithm into the quantum addressing problem, offering a potentially scalable and robust solution for enhancing quantum computing performance.
As modern data environments continue to scale in volume and dimensionality, classical metaheuristics like Genetic Algorithms (GA) and Particle Swarm Optimization (PSO) struggle to balance convergence efficiency with solution quality. The challenge is further amplified in big data optimization, where stagnation in local minima and prohibitive computation time impede real-time applicability. Existing methods fail to simultaneously address the need for global search intelligence and computational scalability, especially under high-dimensional constraints and distributed workloads. To bridge this gap, we propose QIESO—a Quantum-Inspired Evolutionary Swarm Optimizer that integrates quantum amplitude encoding, probabilistic gate rotation, swarm coordination, and tunnelingbased mutation to escape local traps and accelerate convergence. Unlike traditional optimizers, QIESO leverages quantum principles simulated classically to maintain coherence across the search space while reducing evaluation overhead. Empirical validation across datasets up to 100 million records shows QIESO achieves a 51.7% reduction in runtime over GA and 42.7% faster convergence than PSO, with a relative error margin consistently under 2.1%. The method exhibits sublinear scalability in time complexity due to dimensionality-agnostic encoding. This work significantly advances scalable optimization for high-throughput environments, making it ideal for applications in autonomous systems, real-time analytics, and next-gen intelligent infrastructures.
High-dimensional medical datasets pose a persistent challenge for artificial intelligence because traditional classification algorithms often incur escalating computational costs and reduced predictive accuracy. As healthcare systems generate increasingly complex clinical records, imaging outputs, and genomic profiles, scalable analytic methods that balance precision and efficiency are critical. This study proposes a Quantum-Inspired Optimization (QIO) framework for efficient and accurate classification of high-dimensional healthcare data. Leveraging the exploratory power of variational quantum algorithms, specifically techniques analogous to the Quantum Approximate Optimization Algorithm, the framework integrates quantum-style search strategies with classical computation to achieve global optimization and numerical stability. Publicly available medical datasets with hundreds of features were used to evaluate the approach. Classification models were trained and tested across varying feature dimensionalities, and performance was assessed using accuracy, runtime, and scalability metrics. Empirical results demonstrate that QIO achieves up to 95.4% classification accuracy and reduces computational time by 40% compared with state-of-the-art classical baselines. The method demonstrates stable convergence and clear decision boundaries even as feature dimensionality grows, highlighting its resilience to the curse of dimensionality. These results indicate that QIO can enable fast and reliable healthcare analytics in data-rich clinical environments. Future research may examine domain-specific adaptations, real-time deployment, and integration with emerging quantum hardware to enhance the impact of quantum-inspired artificial intelligence further.