Optimization Techniques on Quantum and Classical Systems: A Comprehensive Comparative Study
Quantum optimization is a promising field revolutionizing problem-solving across domains. This study compares Particle Swarm Optimization (PSO), Moth Flame Optimization (MFO), and Genetic Algorithm (GA) on three platforms : a local computer, a local computer with quantum integration, and an IBM quan...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2025-01-01
|
| Series: | E3S Web of Conferences |
| Online Access: | https://www.e3s-conferences.org/articles/e3sconf/pdf/2025/16/e3sconf_icregcsd2025_02024.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Quantum optimization is a promising field revolutionizing problem-solving across domains. This study compares Particle Swarm Optimization (PSO), Moth Flame Optimization (MFO), and Genetic Algorithm (GA) on three platforms : a local computer, a local computer with quantum integration, and an IBM quantum machine. Results indicate PSO’s consistent performance across all setups, with the IBM quantum machine having a longer elapsed time. For MFO, the optimal solution is found using the IBM quantum machine, despite its longer execution time. Similarly, GA achieves the best results on the IBM quantum machine. These findings suggest that while quantum computers excel in solving complex problems, their execution time for simpler tasks remains higher than classical setups. Future research should address challenges like noise, limited qubits, and high material costs to improve quantum computers’ efficiency and availability. |
|---|---|
| ISSN: | 2267-1242 |