Advertisement

Performance Analysis for Genetic Quantum Circuit Synthesis

  • Cristian Ruican
  • Mihai Udrescu
  • Lucian Prodan
  • Mircea Vladutiu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6114)

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.

Keywords

Genetic Algorithm Adaptive Algorithm Genetic Operator Quantum Circuit Dynamic Adjustment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Spector, L.: Automatic Quantum Computer Programming. In: A Genetic Programming Approach, 2nd printing edn. Springer, Heidelberg (2006)Google Scholar
  2. 2.
    Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)zbMATHGoogle Scholar
  3. 3.
    Yao, X.: An Empirical Study of Genetic Operators in Genetic Algorithms. Microprocessing and Microprogramming 38(1-5), 707–714 (1993)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Smit, S.K., Eiben, A.E.: Comparing Parameter Tuning Methods for Evolutionary Algorithms. In: IEEE Congress on Evolutionary Computation, pp. 399–406 (2009)Google Scholar
  7. 7.
    Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Ruican, C.: Projects Web Site Page (2009), http://www.cs.utt.ro/~crys/index_files/public/qsyn.tar.gz
  11. 11.
    Maslov, D.: Reversible Logic Synthesis Benchmarks Page (2008), http://www.cs.uvic.ca/%7Edmaslov/
  12. 12.
    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
  13. 13.
    Luke, S.: Essentials of Metaheuristics. Zeroth Edition (2009), http://cs.gmu.edu/~sean/book/metaheuristics/

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Cristian Ruican
    • 1
  • Mihai Udrescu
    • 1
  • Lucian Prodan
    • 1
  • Mircea Vladutiu
    • 1
  1. 1.Advanced Computing Systems and Architectures LaboratoryUniversity ”Politehnica” TimisoaraTimisoaraRomania

Personalised recommendations