Abstract
Genetic algorithms have proven their ability in detecting optimal or closed-to-optimal solutions to hard combinational problems. However, determining which crossover, mutation or selector operator is best for a specific problem can be cumbersome. The possibilities for enhancing genetic operators are discussed herein, starting with an analysis of their run-time performance. The contribution of this paper consist of analyzing the performance gain from the dynamic adjustment of the genetic operators, with respect to overall performance, as applied for the task of quantum circuit synthesis. We provide experimental results demonstrating the effectiveness of the approach by comparing our results against a traditional GA, using statistical significance measurements.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Spector, L.: Automatic Quantum Computer Programming. In: A Genetic Programming Approach, 2nd printing edn. Springer, Heidelberg (2006)
Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Yao, X.: An Empirical Study of Genetic Operators in Genetic Algorithms. Microprocessing and Microprogramming 38(1-5), 707–714 (1993)
Hilding, F.G., Ward, K.: Automated Operator Selection on Genetic Algorithms. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds.) KES 2005. LNCS (LNAI), vol. 3684, pp. 903–909. Springer, Heidelberg (2005)
Affenzeller, M., Wagner, S.: Offspring Selection: A New Self-Adaptive Selection Scheme for Genetic Algorithms. In: Adaptive and Natural Computing Algorithms, pp. 218–221 (2005)
Smit, S.K., Eiben, A.E.: Comparing Parameter Tuning Methods for Evolutionary Algorithms. In: IEEE Congress on Evolutionary Computation, pp. 399–406 (2009)
Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)
Ruican, C., Udrescu, M., Prodan, L., Vladutiu, M.: A Genetic Algorithm Framework Applied to Quantum Circuit Synthesis. In: Nature Inspired Cooperative Strategies for Optimization, pp. 419–429 (2007)
Ruican, C., Udrescu, M., Prodan, L., Vladutiu, M.: Quantum Circuit Synthesis with Adaptive Parametres Control. In: Vanneschi, L., Gustafson, S., Moraglio, A., De Falco, I., Ebner, M. (eds.) EuroGP 2009. LNCS, vol. 5481, pp. 339–350. Springer, Heidelberg (2009)
Ruican, C.: Projects Web Site Page (2009), http://www.cs.utt.ro/~crys/index_files/public/qsyn.tar.gz
Maslov, D.: Reversible Logic Synthesis Benchmarks Page (2008), http://www.cs.uvic.ca/%7Edmaslov/
Gheorghies, O., Luchian, H., Gheorghies, A.: Walking the Royal Road with Integrated-Adaptive Genetic Algorithms. University Alexandru Ioan Cuza of Iasi (2005), http://thor.info.uaic.ro/~tr/tr05-04.pdf
Luke, S.: Essentials of Metaheuristics. Zeroth Edition (2009), http://cs.gmu.edu/~sean/book/metaheuristics/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruican, C., Udrescu, M., Prodan, L., Vladutiu, M. (2010). Performance Analysis for Genetic Quantum Circuit Synthesis. In: Rutkowski, L., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds) Artifical Intelligence and Soft Computing. ICAISC 2010. Lecture Notes in Computer Science(), vol 6114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13232-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-13232-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13231-5
Online ISBN: 978-3-642-13232-2
eBook Packages: Computer ScienceComputer Science (R0)