{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T00:01:30Z","timestamp":1778716890630,"version":"3.51.4"},"reference-count":89,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T00:00:00Z","timestamp":1742515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Quantum algorithms will likely play a key role in future high-performance-computing (HPC) environments. These algorithms are typically expressed as quantum circuits composed of arbitrary gates or as unitary matrices. Executing these on physical devices, however, requires translation to device-compatible circuits, in a process called quantum compilation or circuit synthesis, since these devices support a limited number of native gates. Moreover, these devices typically have specific qubit topologies, which constrain how and where gates can be applied. Consequently, logical qubits in input circuits and unitaries may need to be mapped to and routed between physical qubits. Furthermore, current Noisy Intermediate-Scale Quantum (NISQ) devices present additional constraints. They are vulnerable to errors during gate application and their short decoherence times lead to qubits rapidly succumbing to accumulated noise and possibly corrupting computations. Therefore, circuits synthesized for NISQ devices need to minimize gates and execution times. The problem of synthesizing device-compatible circuits, while optimizing for low gate count and short execution times, can be shown to be computationally intractable using analytical methods. Therefore, interest has grown towards heuristics-based synthesis techniques, which are able to produce approximations of the desired algorithm, while optimizing depth and gate-count. In this work, we investigate using genetic algorithms (GA)\u2014a proven gradient-free optimization technique based on natural selection\u2014for circuit synthesis. In particular, we formulate the quantum synthesis problem as a multi-objective optimization (MOO) problem, with the objectives of minimizing the approximation error, number of multi-qubit gates, and circuit depth. We also employ fuzzy logic for runtime parameter adaptation of GA to enhance search efficiency and solution quality in our proposed method.<\/jats:p>","DOI":"10.3390\/a18040178","type":"journal-article","created":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T10:10:08Z","timestamp":1742551808000},"page":"178","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Quantum Circuit Synthesis Using Fuzzy-Logic-Assisted Genetic Algorithms"],"prefix":"10.3390","volume":"18","author":[{"given":"Ishraq","family":"Islam","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinayak","family":"Jha","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sneha","family":"Thomas","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kieran F.","family":"Egan","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5440-923X","authenticated-orcid":false,"given":"Alvir","family":"Nobel","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serom","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manu","family":"Chaudhary","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunday","family":"Ogundele","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dylan","family":"Kneidel","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Phillips","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manish","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5028-5596","authenticated-orcid":false,"given":"Kareem","family":"El-Araby","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Devon","family":"Bontrager","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4575-1049","authenticated-orcid":false,"given":"Esam","family":"El-Araby","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"key":"ref_1","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/S0036144598347011","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"41","author":"Shor","year":"1999","journal-title":"SIAM Rev."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Aaronson, S., and Arkhipov, A. (2011, January 6\u20138). The computational complexity of linear optics. Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, San Jose, CA, USA.","DOI":"10.1145\/1993636.1993682"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1140\/epjqt\/s40507-021-00114-x","article-title":"Industry quantum computing applications","volume":"8","author":"Bayerstadler","year":"2021","journal-title":"EPJ Quantum Technol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"025009","DOI":"10.1088\/2058-9565\/ab73e0","article-title":"Impact of qubit connectivity on quantum algorithm performance","volume":"5","author":"Holmes","year":"2020","journal-title":"Quantum Sci. Technol."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","article-title":"Quantum Computing in the NISQ era and beyond","volume":"2","author":"Preskill","year":"2018","journal-title":"Quantum"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF00708656","article-title":"On the interpretation of measurement in quantum theory","volume":"1","author":"Zeh","year":"1970","journal-title":"Found. Phys."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1103\/RevModPhys.76.1267","article-title":"Decoherence, the measurement problem, and interpretations of quantum mechanics","volume":"76","author":"Schlosshauer","year":"2005","journal-title":"Rev. Mod. Phys."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"080505","DOI":"10.1103\/PhysRevLett.109.080505","article-title":"Efficient measurement of quantum gate error by interleaved randomized benchmarking","volume":"109","author":"Magesan","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Siraichi, M.Y., Santos, V.F.d., Collange, C., and Pereira, F.M.Q. (2018, January 24\u201328). Qubit allocation. Proceedings of the 2018 International Symposium on Code Generation and Optimization, Vienna Austria. CGO 2018.","DOI":"10.1145\/3179541.3168822"},{"key":"ref_11","unstructured":"Younis, E., Iancu, C.C., Lavrijsen, W., Davis, M., Smith, E., and USDOE (2021). Berkeley Quantum Synthesis Toolkit (BQSKit), v1."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","article-title":"Genetic algorithms","volume":"267","author":"Holland","year":"1992","journal-title":"Sci. Am."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., and Smith, J.E. (2015). Introduction to Evolutionary Computing, Springer.","DOI":"10.1007\/978-3-662-44874-8"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Deb, K., Agrawal, S., Pratap, A., and Meyarivan, T. (2000, January 18\u201320). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Proceedings of the Parallel Problem Solving from Nature PPSN VI: 6th International Conference, Paris, France. Proceedings 6.","DOI":"10.1007\/3-540-45356-3_83"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/72.265964","article-title":"Convergence analysis of canonical genetic algorithms","volume":"5","author":"Rudolph","year":"1994","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/2.53","article-title":"Fuzzy logic","volume":"21","author":"Zadeh","year":"1988","journal-title":"Computer"},{"key":"ref_17","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information: 10th Anniversary Edition, Cambridge University Press."},{"key":"ref_18","unstructured":"Williams, C.P. (2010). Explorations in Quantum Computing, Springer Science & Business Media."},{"key":"ref_19","unstructured":"Rowland, T., and Weisstein, E.W. (2025, February 27). Unitary Matrix. Available online: https:\/\/mathworld.wolfram.com\/UnitaryMatrix.html."},{"key":"ref_20","first-page":"97","article-title":"Quantum theory, the Church\u2013Turing principle and the universal quantum computer","volume":"400","author":"Deutsch","year":"1985","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Sci."},{"key":"ref_21","unstructured":"Chow, J., Dial, O., and Gambetta, J. (2021). IBM Quantum breaks the 100-qubit processor barrier. IBM Res. Blog, Available online: https:\/\/www.ibm.com\/quantum\/blog\/127-qubit-quantum-processor-eagle."},{"key":"ref_22","unstructured":"Cowtan, A., Dilkes, S., Duncan, R., Krajenbrink, A., Simmons, W., and Sivarajah, S. (2019). On the qubit routing problem. arXiv."},{"key":"ref_23","unstructured":"Javadi-Abhari, A., Treinish, M., Krsulich, K., Wood, C.J., Lishman, J., Gacon, J., Martiel, S., Nation, P.D., Bishop, L.S., and Cross, A.W. (2024). Quantum computing with Qiskit. arXiv."},{"key":"ref_24","first-page":"355","article-title":"An intelligent genetic algorithm designed for global optimization of multi-minima functions","volume":"178","author":"Xing","year":"2006","journal-title":"Appl. Math. Comput."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","article-title":"Muiltiobjective optimization using nondominated sorting in genetic algorithms","volume":"2","author":"Srinivas","year":"1994","journal-title":"Evol. Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","article-title":"MOEA\/D: A multiobjective evolutionary algorithm based on decomposition","volume":"11","author":"Zhang","year":"2007","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1162\/EVCO_a_00109","article-title":"MOEA\/D with adaptive weight adjustment","volume":"22","author":"Qi","year":"2014","journal-title":"Evol. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Vesikar, Y., Deb, K., and Blank, J. (2018, January 18\u201321). Reference point based NSGA-III for preferred solutions. Proceedings of the 2018 IEEE Symposium Series on Computational Intelligence (SSCI), Bangalore, India.","DOI":"10.1109\/SSCI.2018.8628819"},{"key":"ref_29","unstructured":"Tamaki, H., Kita, H., and Kobayashi, S. (1996, January 20\u201322). Multi-objective optimization by genetic algorithms: A review. Proceedings of the IEEE International Conference on Evolutionary Computation, Nagoya, Japan."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Mamdani, E.H. (1974, January 1). Application of fuzzy algorithms for control of simple dynamic plant. Proceedings of the Institution of Electrical Engineers, IET, London, UK.","DOI":"10.1049\/piee.1974.0328"},{"key":"ref_31","unstructured":"Hellmann, M. (2001). Fuzzy logic introduction. Univ. Rennes, 1, Available online: https:\/\/www.researchgate.net\/publication\/238684924_Fuzzy_Logic_Introduction."},{"key":"ref_32","unstructured":"Tucci, R.R. (1999). A rudimentary quantum compiler (2nd ed.). arXiv."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Shende, V.V., Bullock, S.S., and Markov, I.L. (2005, January 21). Synthesis of quantum logic circuits. Proceedings of the 2005 Asia and South Pacific Design Automation Conference, Shanghai, China.","DOI":"10.1145\/1120725.1120847"},{"key":"ref_34","unstructured":"Khaneja, N., and Glaser, S. (2000). Cartan Decomposition of SU (2^ n), Constructive Controllability of Spin systems and Universal Quantum Computing. arXiv."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"032318","DOI":"10.1103\/PhysRevA.93.032318","article-title":"Quantum circuits for isometries","volume":"93","author":"Iten","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","article-title":"Elementary gates for quantum computation","volume":"52","author":"Barenco","year":"1995","journal-title":"Phys. Rev. A"},{"key":"ref_37","unstructured":"Helgason, S. (1979). Differential Geometry, Lie Groups, and Symmetric Spaces, Academic Press."},{"key":"ref_38","unstructured":"Qiskit, I. (2025, February 27). Qiskit SDK: TwoQubitBasisDecomposer. Available online: https:\/\/docs.quantum.ibm.com\/api\/qiskit\/qiskit.synthesis.TwoQubitBasisDecomposer."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Li, G., Ding, Y., and Xie, Y. (2019, January 13\u201319). Tackling the qubit mapping problem for NISQ-era quantum devices. Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, Providence, RI, USA.","DOI":"10.1145\/3297858.3304023"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Wu, X.C., Davis, M.G., Chong, F.T., and Iancu, C. (December, January 30). Reoptimization of quantum circuits via hierarchical synthesis. Proceedings of the 2021 International Conference on Rebooting Computing (ICRC), Los Alamitos, CA, USA.","DOI":"10.1109\/ICRC53822.2021.00016"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Davis, M.G., Smith, E., Tudor, A., Sen, K., Siddiqi, I., and Iancu, C. (2020, January 12\u201316). Towards optimal topology aware quantum circuit synthesis. Proceedings of the 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), Denver, CO, USA.","DOI":"10.1109\/QCE49297.2020.00036"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Younis, E., Sen, K., Yelick, K., and Iancu, C. (2021, January 17\u201322). Qfast: Conflating search and numerical optimization for scalable quantum circuit synthesis. Proceedings of the 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), Broomfield, CO, USA.","DOI":"10.1109\/QCE52317.2021.00041"},{"key":"ref_43","unstructured":"Patel, T., Younis, E., Iancu, C., de Jong, W., and Tiwari, D. (March, January 28). Quest: Systematically approximating quantum circuits for higher output fidelity. Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Lausanne, Switzerland."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Kukliansky, A., Younis, E., Cincio, L., and Iancu, C. (2023, January 17\u201322). QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation. Proceedings of the 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Bellevue, WA, USA.","DOI":"10.1109\/QCE57702.2023.00096"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Liu, J., Younis, E., Weiden, M., Hovland, P., Kubiatowicz, J., and Iancu, C. (2023, January 17\u201322). Tackling the qubit mapping problem with permutation-aware synthesis. Proceedings of the 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), Bellevue, WA, USA.","DOI":"10.1109\/QCE57702.2023.00090"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"20190161","DOI":"10.1098\/rsta.2019.0161","article-title":"Boolean satisfiability in quantum compilation","volume":"378","author":"Soeken","year":"2020","journal-title":"Philos. Trans. R. Soc. A"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3505181","article-title":"Best approximate quantum compiling problems","volume":"3","author":"Madden","year":"2022","journal-title":"ACM Trans. Quantum Comput."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TQE.2021.3068355","article-title":"Survey on quantum circuit compilation for noisy intermediate-scale quantum computers: Artificial intelligence to heuristics","volume":"2","author":"Kusyk","year":"2021","journal-title":"IEEE Trans. Quantum Eng."},{"key":"ref_49","unstructured":"Yabuki, T., and Iba, H. (2000, January 8\u201312). Genetic algorithms for quantum circuit design-evolving a simpler teleportation circuit. Proceedings of the Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, Las Vegas, NV, USA."},{"key":"ref_50","unstructured":"Lukac, M., and Perkowski, M. (2002, January 15\u201318). Evolving quantum circuits using genetic algorithm. Proceedings of the 2002 NASA\/DoD Conference on Evolvable Hardware, Alexandria, VA, USA."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1023\/B:AIRE.0000006605.86111.79","article-title":"Evolutionary approach to quantum and reversible circuits synthesis","volume":"20","author":"Lukac","year":"2003","journal-title":"Artif. Intell. Rev."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1162\/evco.2006.14.1.21","article-title":"Human-competitive evolution of quantum computing artefacts by genetic programming","volume":"14","author":"Massey","year":"2006","journal-title":"Evol. Comput."},{"key":"ref_53","unstructured":"Koza, J.R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Ruican, C., Udrescu, M., Prodan, L., and Vladutiu, M. (2009, January 18\u201321). Genetic algorithm based quantum circuit synthesis with adaptive parameters control. Proceedings of the 2009 IEEE Congress on Evolutionary Computation, Trondheim, Norway.","DOI":"10.1109\/CEC.2009.4983040"},{"key":"ref_55","unstructured":"Krylov, G., and Lukac, M. (May, January 30). Quantum encoded quantum evolutionary algorithm for the design of quantum circuits. Proceedings of the 16th ACM International Conference on Computing Frontiers, Alghero, Sardinia."},{"key":"ref_56","unstructured":"Miranda, F.T., Balbi, P.P., and Costa, P. (2021). Synthesis of quantum circuits with an island genetic algorithm. arXiv."},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Whitley, D., Rana, S., and Heckendorn, R.B. (1997, January 7\u20138). Island model genetic algorithms and linearly separable problems. Proceedings of the Evolutionary Computing: AISB International Workshop, Manchester, UK. Selected Papers.","DOI":"10.1007\/BFb0027170"},{"key":"ref_58","unstructured":"S\u00fcnkel, L., Martyniuk, D., Mattern, D., Jung, J., and Paschke, A. (2023). GA4QCO: Genetic algorithm for quantum circuit optimization. arXiv."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.3938\/jkps.65.2001","article-title":"A genetic-algorithm-based method to find unitary transformations for any desired quantum computation and application to a one-bit oracle decision problem","volume":"65","author":"Bang","year":"2014","journal-title":"J. Korean Phys. Soc."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1515\/qmetro-2017-0001","article-title":"Approximate quantum adders with genetic algorithms: An IBM quantum experience","volume":"4","author":"Li","year":"2017","journal-title":"Quantum Meas. Quantum Metrol."},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Bhattacharjee, A., Bandyopadhyay, C., Mukherjee, A., Wille, R., Drechsler, R., and Rahaman, H. (2020, January 9\u201311). Efficient implementation of nearest neighbor quantum circuits using clustering with genetic algorithm. Proceedings of the 2020 IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL), Miyazaki, Japan.","DOI":"10.1109\/ISMVL49045.2020.00-32"},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Creevey, F.M., Hill, C.D., and Hollenberg, L.C. (2023). GASP: A genetic algorithm for state preparation on quantum computers. Sci. Rep., 13.","DOI":"10.1038\/s41598-023-37767-w"},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"128860","DOI":"10.1016\/j.physleta.2023.128860","article-title":"Exploring the optimality of approximate state preparation quantum circuits with a genetic algorithm","volume":"475","author":"Rindell","year":"2023","journal-title":"Phys. Lett. A"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Ding, L., and Spector, L. (2022, January 9\u201313). Evolutionary quantum architecture search for parametrized quantum circuits. Proceedings of the Genetic and Evolutionary Computation Conference Companion, Boston, MA, USA.","DOI":"10.1145\/3520304.3534012"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Ding, L., and Spector, L. (2023). Multi-objective evolutionary architecture search for parameterized quantum circuits. Entropy, 25.","DOI":"10.3390\/e25010093"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Giovagnoli, A., Tresp, V., Ma, Y., and Schubert, M. (2023, January 15\u201319). Qneat: Natural evolution of variational quantum circuit architecture. Proceedings of the Companion Conference on Genetic and Evolutionary Computation, Lisbon, Portugal.","DOI":"10.1145\/3583133.3590675"},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Acampora, G., Chiatto, A., and Vitiello, A. (2022, January 18\u201323). Training variational quantum circuits through genetic algorithms. Proceedings of the 2022 IEEE Congress on Evolutionary Computation (CEC), Padua, Italy.","DOI":"10.1109\/CEC55065.2022.9870242"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"052414","DOI":"10.1103\/PhysRevA.105.052414","article-title":"Robust resource-efficient quantum variational ansatz through an evolutionary algorithm","volume":"105","author":"Huang","year":"2022","journal-title":"Phys. Rev. A"},{"key":"ref_69","unstructured":"Syswerda, G. (1989, January 1). Uniform crossover in genetic algorithms. Proceedings of the ICGA, Fairfax, VA, USA."},{"key":"ref_70","first-page":"193","article-title":"Genetic algorithms, tournament selection, and the effects of noise","volume":"9","author":"Miller","year":"1995","journal-title":"Complex Syst."},{"key":"ref_71","unstructured":"Back, T. (1994, January 27\u201329). Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, Orlando, FL, USA."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Shukla, A., Pandey, H.M., and Mehrotra, D. (2015, January 25\u201327). Comparative review of selection techniques in genetic algorithm. Proceedings of the 2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE), Greater Noida, India.","DOI":"10.1109\/ABLAZE.2015.7154916"},{"key":"ref_73","unstructured":"Weisstein, E.W. (2025, February 27). Frobenius Norm. Available online: https:\/\/mathworld.wolfram.com\/FrobeniusNorm.html."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","article-title":"SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python","volume":"17","author":"Virtanen","year":"2020","journal-title":"Nat. Methods"},{"key":"ref_75","unstructured":"Wright, S.J. (2006). Numerical Optimization, Springer."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/imamat\/6.1.76","article-title":"The convergence of a class of double-rank minimization algorithms 1. general considerations","volume":"6","author":"Broyden","year":"1970","journal-title":"IMA J. Appl. Math."},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/13.3.317","article-title":"A new approach to variable metric algorithms","volume":"13","author":"Fletcher","year":"1970","journal-title":"Comput. J."},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1090\/S0025-5718-1970-0258249-6","article-title":"A family of variable-metric methods derived by variational means","volume":"24","author":"Goldfarb","year":"1970","journal-title":"Math. Comput."},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1090\/S0025-5718-1970-0274029-X","article-title":"Conditioning of quasi-Newton methods for function minimization","volume":"24","author":"Shanno","year":"1970","journal-title":"Math. Comput."},{"key":"ref_80","doi-asserted-by":"crossref","unstructured":"Sadollah, A. (2018). Introductory chapter: Which membership function is appropriate in fuzzy system. Fuzzy Logic Based in Optimization Methods and Control Systems and Its Applications, IntechOpen.","DOI":"10.5772\/intechopen.79552"},{"key":"ref_81","unstructured":"(2025, February 27). multiprocessing\u2014Process-Based Parallelism. Available online: https:\/\/docs.python.org\/3.10\/library\/multiprocessing.html."},{"key":"ref_82","unstructured":"(2025, February 27). Cluster Hardware. Available online: https:\/\/help.ittc.ku.edu\/Cluster_Hardware."},{"key":"ref_83","unstructured":"(2025, February 27). Release Notes for Rocky Linux 9.4. Available online: https:\/\/docs.rockylinux.org\/release_notes\/9_4."},{"key":"ref_84","unstructured":"(2025, February 27). SciKit-Fuzzy. Available online: https:\/\/scikit-fuzzy.readthedocs.io\/en\/latest\/overview.html."},{"key":"ref_85","unstructured":"(2025, February 27). Qiskit. Available online: https:\/\/github.com\/Qiskit\/qiskit\/releases\/tag\/1.2.4."},{"key":"ref_86","unstructured":"(2025, February 27). BQSkit. Available online: https:\/\/github.com\/BQSKit\/bqskit\/releases\/tag\/1.2.0."},{"key":"ref_87","unstructured":"(2025, February 27). Random Unitary Operator. Available online: https:\/\/github.com\/Qiskit\/qiskit\/blob\/896d1c8b72888a52a46081a6d1f4de8c56db8aea\/qiskit\/quantum_info\/operators\/random.py#L32-L56."},{"key":"ref_88","unstructured":"(2025, February 27). TranspileLayout. Available online: https:\/\/docs.quantum.ibm.com\/api\/qiskit\/qiskit.transpiler.TranspileLayout."},{"key":"ref_89","unstructured":"(2025, February 27). Equiv Method for the Operator Class. Available online: https:\/\/github.com\/Qiskit\/qiskit\/blob\/1263d82877ba5183232db9bac5bc2c61a7da7a26\/qiskit\/quantum_info\/operators\/operator.py#L688-L710."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/4\/178\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:57:58Z","timestamp":1760029078000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/4\/178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,21]]},"references-count":89,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["a18040178"],"URL":"https:\/\/doi.org\/10.3390\/a18040178","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,21]]}}}