Advances in Evolutionary Optimization of Quantum Operators

被引：0
作者：
Zufan P. [1 ]
Bidlo M. [1 ]
机构：
[1] Brno University of Technology, FIT, IT4Innovations Center of Excellence, Brno
来源：
Mendel | 2021年 / 27卷 / 02期
关键词：
Differential evolution; Evolution strategy; Quantum operator; Self-adaptation of control parameters; Unitary matrix;
D O I：
10.13164/mendel.2021.2.012
中图分类号：
学科分类号：
摘要：
A comparative study is presented regarding the evolutionary design of quantum operators in the form of unitary matrices. Three existing techniques (represen-tations) which allow generating unitary matrices are used in various evolutionary algorithms in order to optimize their coefficients. The objective is to obtain as pre-cise quantum operators (the resulting unitary matrices) as possible for given quantum transformations. Ordinary evolution strategy, self-adaptive evolution strategy and differential evolution are applied with various settings as the optimization algorithms for the quantum operators. These algorithms are evaluated on the tasks of designing quantum operators for the 3-qubit and 4-qubit maximum amplitude detector and a solver of a logic function of three variables in conjunctive normal form. These tasks require unitary matrices of various sizes. It will be demon-strated that the self-adaptive evolution strategy and differential evolution are able to produce remarkably better results than the ordinary evolution strategy. More-over, the results can be improved by selecting a proper settings for the evolution as presented by a comparative evaluation. © 2021, Brno University of Technology. All rights reserved.
引用
收藏
页码：12 / 22
页数：10
相关论文
共 26 条
  • [1] Acampora G., Vitiello A., Implement-ing evolutionary optimization on actual quantum processors, Information Sciences, 575, pp. 542-562, (2021)
  • [2] Bang J., Yoo S., A genetic-algorithm-based method to find unitary transformations for any desired quantum computation and application to a one-bit oracle decision problem, Journal of the Korean Physical Society, 65, 12, pp. 2001-2008, (2014)
  • [3] Bidlo M., Zufan P., On comparison of some representations for the evolution of quantum operators, 2020 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 2101-2108, (2020)
  • [4] Brabazon A., O'Neill M., McGar-raghy S., Natural computing algorithms, 554, (2015)
  • [5] Caires L. F. V., Neto O. P. V., Noronha T. F., Evolutionary synthesis of robust qca circuits, 2013 IEEE Congress on Evolutionary Computation, pp. 2802-2808, (2013)
  • [6] Chuang I. L., Gershenfeld N., Ku-binec M., Experimental implementation of fast quantum searching, Physical review letters, 80, 15, (1998)
  • [7] Gander W., Algorithms for the qr decomposi-tion, Res. Rep, 80, pp. 1251-1268, (1980)
  • [8] Gepp A., Stocks P., A review of pro-cedures to evolve quantum algorithms, Genetic programming and evolvable machines, 10, 2, pp. 181-228, (2009)
  • [9] Gregor C., Construction of Unitary Matrices and Bounding Minimal Quantum Gate Fidelity Using Genetic Algorithms, (2018)
  • [10] Hota A. R., Pat A., An adaptive quantum-inspired differential evolution algorithm for 0–1 knapsack problem, 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC), pp. 703-708, (2010)
123