Quantum-inspired genetic algorithms
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
A novel evolutionary computing method-quantum inspired genetic algorithms-is introduced, where concepts and principles of quantum mechanics are used to inform and inspire more efficient evolutionary computing methods. The basic terminology of quantum mechanics is introduced before a comparison is made between a classical genetic algorithm and a quantum inspired method for the travelling salesperson problem. It is informally shown that the quantum inspired genetic algorithm performs better than the classical counterpart for a small domain. The paper concludes with some speculative comments concerning the relationship between quantum inspired genetic algorithms and various complexity classes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 8×
“However, Shor 10] outlined a quantum algorithm that would factorise RSA-129 in a few seconds, if a quantum computer could be built that ran as fast as a modern PC.”
BackgroundMethodInfluentialSimulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770
Quantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270
Lloyd, S. (1995) · Scientific American · doi:10.1038/scientificamerican1095-140 · Cited by 150
Susskind, R. E. (2019) · Oxford University Press eBooks · doi:10.1093/oso/9780198838364.003.0031 · Cited by 27
Cited by
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
Han, K.-H., & Kim, J.-H. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2002.804320 · Cited by 1,585
Metaheuristic research: a comprehensive survey
Hussain, K., Mohd Salleh, M. N., Cheng, S., & Shi, Y. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-017-9605-z · Cited by 864
Evolutionary algorithms and their applications to engineering problems
Slowik, A., & Kwasnicka, H. (2020) · Neural Computing and Applications · doi:10.1007/s00521-020-04832-8 · Cited by 712
Genetic quantum algorithm and its application to combinatorial optimization problem
Han, K.-H., & Kim, J.-H. (2002) · Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) · doi:10.1109/cec.2000.870809 · Cited by 664
Coelho, L. D. S. (2010) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.06.044 · Cited by 544
Han, K.-H., & Kim, J.-H. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.823467 · Cited by 482
Heap-based optimizer inspired by corporate rank hierarchy for global optimization
Askari, Q., Saeed, M., & Younas, I. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.113702 · Cited by 380
Quantum-inspired evolutionary algorithms: a survey and empirical study
Zhang, G. (2011) · Journal of Heuristics · doi:10.1007/s10732-010-9136-0 · Cited by 295
Cognitive radio spectrum allocation using evolutionary algorithms
Zhao, Z., Peng, Z., Zheng, S., & Shang, J. (2009) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2009.080939 · Cited by 201
“Quantum genetic algorithm (QGA) [11] combines quantum computation and genetic algorithm, while particle swarm optimization (PSO) [12] is inspired by the social behavior of a flock of birds trying to find their destination during migration.”
BackgroundQuantum Optimization and Quantum Learning: A Survey
Li, Y., Tian, M., Liu, G., Peng, C., & Jiao, L. (2020) · IEEE Access · doi:10.1109/access.2020.2970105 · Cited by 177
Quantum multiverse optimization algorithm for optimization problems
Sayed, G. I., Darwish, A., & Hassanien, A. E. (2019) · Neural Computing and Applications · doi:10.1007/s00521-017-3228-9 · Cited by 72
“Quantum inspired evolutionary algorithms were introduced to solve the traveling salesman problem [34], where the crossover operation was performed based on the interference concept.”
MethodBotsinis, P., Ng, S. X., & Hanzo, L. (2013) · IEEE Access · doi:10.1109/access.2013.2259536 · Cited by 64
Metadata
- Authors
- Narayanan, A., & Moore, M.
- Venue
- Proceedings of IEEE International Conference on Evolutionary Computation
- Publisher
- IEEE
- Published
- 2002-12-24
- Pages
- 61-66
- OpenAlex
- W1962752774
- Cited by
- 649
- References
- 7
- FWCI
- 9.24
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.