Quantum Circuit Optimization Techniques: A Literature Survey
References
- A. Shafaei, M. Saeedi and M. Pedram (2013). Optimization of quantum circuits for interaction distance in linear nearest neighbor architectures, in 2013 50th ACM/EDAC/IEEE Design Automation Conference (DAC), pp. 1–6.
- M. Amy, D. Maslov and M. Mosca (2014). Polynomial-time t-depth optimization of clifford+t circuits via matroid partitioning, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 33(10), pp. 1476–1489.
- A. Bhattacharjee, C. Bandyopadhyay, R. Wille, R. Drechsler and H. Rahaman (2019). Improved look-ahead approaches for nearest neighbor synthesis of 1d quantum circuits, in 2019 32nd International Conference on VLSI Design and 2019 18th International Conference on Embedded Systems (VLSID), pp. 203–208.
- A. Bhattacharjee, C. Bandyopadhyay, R. Wille, R. Drechsler and H. Rahaman (2018). A novel approach for nearest neighbor realization of 2d quantum circuits, in 2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp. 305–310.
- A. Bocharov, M. Roetteler and K. M. Svore (2015). E?icient synthesis of universal repeat-until-success quantum circuits, Physical Review Letters, 114(8).
- A. Chakrabarti, S. Sur-Kolay and A. Chaudhury (2011). Linear nearest neighbor synthesis of reversible circuits by graph partitioning.
- K. Datta, B. Ghuku, D. Sandeep, I. Sengupta and H. Rahaman (2013). A cycle based reversible logic synthesis approach, in 2013 Third International Conference on Advances in Computing and Communications, pp. 316–319.
- M. Houshmand, M. Sedighi, M. S. Zamani and K. Marjoei (2017). Quantum circuit synthesis targeting to improve one-way quantum computation pattern cost metrics, ACM Journal on Emerging Technologies in Computing Systems (JETC), 13, pp. 1–27.
- A. Kole, K. Datta, R. Wille and I. Sengupta (2017). A nearest neighbor quantum cost metric for the reversible circuit level, in TENCON 2017 - 2017 IEEE Region 10 Conference, pp. 2943–2948.
- R. Wille, O. Keszocze, M. Walter, P. Rohrs, A. Chattopadhyay and R. Drechsler (2016). Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits, in 2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 292–297, IEEE, Macao, Macao.
- A. Kole, K. Datta and I. Sengupta (2018). A new heuristic for $n$-dimensional nearest neighbor realization of a quantum circuit, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 37, pp. 182–192.
- C. Lin, A. Chakrabarti and N. Jha (2014). Ftqls: Fault-tolerant quantum logic synthesis, Very Large Scale Integration (VLSI) Systems, IEEE Transactions on, 22, pp. 1350–1363.
- A. Lye, R. Wille and R. Drechsler (2015). Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits, in The 20th Asia and South Pacific Design Automation Conference, pp. 178–183.
- E. A. Martinez, T. Monz, D. Nigg, P. Schindler and R. Blatt (2016). Compiling quantum algorithms for architectures with multi-qubit gates, New Journal of Physics, 18(6), p. 063029.
- D. Miller, R. Wille and Z. Sasanian (2011). Elementary quantum gate realizations for multiple-control toffoli gates, Proceedings of The International Symposium on Multiple-Valued Logic.
- B. Nash, V. Gheorghiu and M. Mosca (2020). Quantum circuit optimizations for nisq architectures, Quantum Science and Technology, 5(2), p. 025010.
- P. Niemann, R. Wille and R. Drechsler (2018). Improved synthesis of Clifford+T quantum functionality, in 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 597–600, IEEE, Dresden, Germany.
- M. Perkowski, D. Shah and M. Kameyama (2011). Synthesis of quantum circuits in linear nearest neighbor model using positive davio lattices, Facta universitatis - series: Electronics and Energetics, 24.
- A. Paetznick and K. M. Svore (2014). Repeat-until-success: non-deterministic decomposition of single-qubit unitaries, Quantum Inf. Comput., 14(15-16), pp. 1277–1301.
- R. R. Shrivastwa, K. Datta and I. Sengupta (2015). Fast qubit placement in 2d architecture using nearest neighbor realization, in 2015 IEEE International Symposium on Nanoelectronic and Information Systems, pp. 95–100.
- Y. Zhang, Z. Guan, L. Ji, Q. F. Luan and Y. Wang (2020). A method of mapping and nearest neighbor optimization for 2-d quantum circuits, Quantum Information and Computation, 20(3 & 4), pp. 194–212.
- A. Zulehner, S. Gasser and R. Wille (2017). Exact Global Reordering for Nearest Neighbor Quantum Circuits Using A*, in I. Phillips and H. Rahaman (editors), Reversible Computation, vol. 10301, pp. 185–201, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- N. Abdessaied, M. Amy, M. Soeken and R. Drechsler (2016). Technology Mapping of Reversible Circuits to Clifford+T Quantum Circuits, in 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), pp. 150–155.
- A. Abdollahi and M. Pedram (2006). Analysis and Synthesis of Quantum Circuits by Using Quantum Decision Diagrams, in Proceedings of the Design Automation & Test in Europe Conference, vol. 1, pp. 1–6.
- M. Y. Abubakar, L. T. Jung, N. Zakaria, A. Younes and A.-H. Abdel-Aty (2017). Reversible circuit synthesis by genetic programming using dynamic gate libraries, Quantum Information Processing, 16(6), p. 160.
- A. V. Aho and K. M. Svore (2003). Compiling Quantum Circuits using the Palindrome Transform. Version Number: 1.
- N. Ain Binti Adnan, K. Kushida and S. Yamashita (2016). A pre-optimization technique to generate initial reversible circuits with low quantum cost, in 2016 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2298–2301, IEEE, Montreal, QC.
- M. G. Alfailakawi, I. Ahmad and S. Hamdan (2016). Harmony-search algorithm for 2D nearest neighbor quantum circuits realization, Expert Systems with Applications, 61, pp. 16–27.
- M. B. Ali, T. Hirayama, K. Yamanaka and Y. Nishitani (2015). Quantum Cost Reduction of Reversible Circuits Using New Toffoli Decomposition Techniques, in 2015 International Conference on Computational Science and Computational Intelligence (CSCI), pp. 59–64.
- M. Amy, D. Maslov, M. Mosca and M. Roetteler (2013). A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32(6), pp. 818–830. Publisher: Institute of Electrical and Electronics Engineers (IEEE).
- M. Arabzadeh, M. Saheb Zamani, M. Sedighi and M. Saeedi (2013). Depth-optimized reversible circuit synthesis, Quantum Information Processing, 12(4), pp. 1677–1699.
- P. M. Arpita, K. Datta, R. Vemula and I. Sengupta (2015). Optimization of reversible circuits using triple-gate templates at quantum gate level, in 2015 International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV), pp. 120–124, IEEE, Shillong, India.
- S. Ashhab, N. Yamamoto, F. Yoshihara and K. Semba (2022). Numerical analysis of quantum circuits for state preparation and unitary operator synthesis, Physical Review A, 106(2), p. 022426.
- J.-H. Bae, P. M. Alsing, D. Ahn and W. A. Miller (2020). Quantum circuit optimization using quantum Karnaugh map, Scientific Reports, 10(1), p. 15651.
- T. Bahreini and N. Mohammadzadeh (2015). An MINLP Model for Scheduling and Placement of Quantum Circuits with a Heuristic Solution Approach, ACM Journal on Emerging Technologies in Computing Systems, 12(3), pp. 1–20.
- C. Bandyopadhyay, S. Parekh and H. Rahaman (2018). Improved circuit synthesis approach for exclusive-sum-of-product-based reversible circuits, IET Computers & Digital Techniques, 12(4), pp. 167–175.
- A. Banerjee and A. Pathak (2009), An algorithm for minimization of quantum cost. Version Number: 2.
- B. Barán, A. Carballude and M. Villagra (2021). A Multiobjective Approach for Nearest Neighbor Optimization of N-Dimensional Quantum Circuits, SN Computer Science, 2(1), p. 19.
- A. Basak, A. Sadhu, K. Das and K. K. Sharma (2019). Cost Optimization Technique for Quantum Circuits, International Journal of Theoretical Physics, 58(9), pp. 3158–3179.
- C. Beaudoin, K. Phalak and S. Ghosh (2024). AltGraph: Redesigning Quantum Circuits Using Generative Graph Models for E?icient Optimization, in Proceedings of the Great Lakes Symposium on VLSI 2024, pp. 44–49, ACM, Clearwater FL USA.
- A. Bhattacharjee, C. Bandyopadhyay, A. Mukherjee, R. Wille, R. Drechsler and H. Rahaman (2021). An ant colony based mapping of quantum circuits to nearest neighbor architectures, Integration, 78, pp. 11–24.
- D. Bhattacharjee and A. Chattopadhyay (2017). Depth-Optimal Quantum Circuit Placement for Arbitrary Topologies. _eprint: 1703.08540.
- L. Biswal, C. Bandyopadhyay, A. Chattopadhyay, R. Wille, R. Drechsler and H. Rahaman (2016). Nearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation, in 2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL), pp. 156–161.
- L. Biswal, R. Das, C. Bandyopadhyay, A. Chattopadhyay and H. Rahaman (2018). A template-based technique for e?icient Clifford+T-based quantum circuit implementation, Microelectronics Journal, 81, pp. 58–68.
- A. Bocharov, M. Roetteler and K. M. Svore (2015). E?icient synthesis of probabilistic quantum circuits with fallback, Physical Review A, 91(5), p. 052317.
- A. Bocharov and K. M. Svore (2012). Resource-Optimal Single-Qubit Quantum Circuits, Physical Review Letters, 109(19), p. 190501.
- K. Booth, M. Do, J. Beck, E. Rieffel, D. Venturelli and J. Frank (2018). Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation, Proceedings of the International Conference on Automated Planning and Scheduling, 28, pp. 366–374.
- S. Bravyi, R. Shaydulin, S. Hu and D. Maslov (2021). Clifford Circuit Optimization with Templates and Symbolic Pauli Gates, Quantum, 5, p. 580. ArXiv:2105.02291 [quant-ph].
- M. Ghosh, N. Dey, D. Mitra and A. Chakrabarti (2020). 2D Qubit Placement of Quantum Circuits Using LONGPATH, in R. Chaki, A. Cortesi, K. Saeed, and N. Chaki (editors), Advanced Computing and Systems for Security, vol. 996, pp. 127–141, Springer Singapore, Singapore. Series Title: Advances in Intelligent Systems and Computing.
- A. Chakrabarti and S. Sur-Kolay (2007). Rules for Synthesizing Quantum Boolean Circuits Using Minimized Nearest-Neighbour Templates, in 15th International Conference on Advanced Computing and Communications (ADCOM 2007), pp. 183–189, IEEE, Guwahati, Assam, India.
- M. Chen, Y. Zhang and Y. Li (2021). A Quantum Circuit Optimization Framework Based on Pattern Matching, SPIN, 11(03), p. 2140008.
- X. Cheng, Z. Guan and W. Ding (2018). Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits, Quantum Information Processing, 17(7), p. 169.
- X. Cheng, Z. Guan and P. Zhu (2020). Nearest Neighbor Transformation of Quantum Circuits in 2D Architecture, IEEE Access, 8, pp. 222466–222475.
- A. M. Childs, E. Schoute and C. M. Unsal (2019). Circuit Transformations for Quantum Architectures, LIPIcs, Volume 135, TQC 2019, 135, pp. 3:1–3:24.
- Y.-H. Chou, C.-Y. Hua, H.-P. Chen, E.-T. Hsu, Y.-C. Jiang and S.-Y. Kuo (2024). Adapting Developing Quantum Circuit Synthesis with a Multi -objective Quantum-inspired Optimization, in 2024 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 559–560, IEEE, Montreal, QC, Canada.
- D. Clarino, S. Kuroda and S. Yamashita (2025). Reducing T-Count in Quantum Circuits Using Alternate Forms of the Relative Phase Toffoli Gate, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E108.A(1), pp. 1–10.
- P. J. Coles, S. Khatri, R. LaRose, A. T. Sornborger, L. Cincio and A. Poremba (2019). Quantum-assisted quantum compiling, arXiv:1807.00800 [quant-ph].
- A. J. Da Silva and D. K. Park (2022). Linear-depth quantum circuits for multiqubit controlled gates, Physical Review A, 106(4), p. 042602.
- K. Datta, G. Rathi, I. Sengupta and H. Rahaman (2012). Synthesis of Reversible Circuits Using Heuristic Search Method, in 2012 25th International Conference on VLSI Design, pp. 328–333, IEEE, Hyderabad, India.
- M. G. Davis, E. Smith, A. Tudor, K. Sen, I. Siddiqi and C. Iancu (2020). Towards Optimal Topology Aware Quantum Circuit Synthesis, in 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 223–234, IEEE, Denver, CO, USA.
- R. Wille, N. Quetschlich, Y. Inoue, N. Yasuda and S.-i. Minato (2016). Using $$\pi $$ DDs for Nearest Neighbor Optimization of Quantum Circuits, in S. Devitt and I. Lanese (editors), Reversible Computation, vol. 9720, pp. 181–196, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- J. Ding and S. Yamashita (2020). Exact Synthesis of Nearest Neighbor Compliant Quantum Circuits in 2-D Architecture and Its Application to Large-Scale Circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39(5), pp. 1045–1058.
- G. W. Dueck, A. Pathak, M. M. Rahman, A. Shukla and A. Banerjee (2018). Optimization of Circuits for IBM’s Five-Qubit Quantum Computers, in 2018 21st Euromicro Conference on Digital System Design (DSD), pp. 680–684, IEEE, Prague.
- R. Duncan, A. Kissinger, S. Perdrix and J. Van De Wetering (2020). Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus, Quantum, 4, p. 279.
- E. Younis, K. Sen, K. Yelick and C. Iancu (2021). Qfast: Conflating search and numerical optimization for scalable quantum circuit synthesis, in 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), p. 232–243, IEEE.
- H. Fan, V. Roychowdhury and T. Szkopek (2005). Optimal two-qubit quantum circuits using exchange interactions, Physical Review A, 72(5), p. 052323.
- H. Fan, C. Guo and W. Luk (2022). Optimizing quantum circuit placement via machine learning, in Proceedings of the 59th ACM/IEEE Design Automation Conference, pp. 19–24, ACM, San Francisco California.
- T. Fösel, M. Y. Niu, F. Marquardt and L. Li (2021). Quantum circuit optimization with deep reinforcement learning. ArXiv:2103.07585 [quant-ph].
- X. Zhang, H. Xiang, and T. Xiang (2019). An E?icient Quantum Circuits Optimizing Scheme Compared with QISKit (Short Paper), in H. Gao, X. Wang, Y. Yin, and M. Iqbal (editors), Collaborative Computing: Networking, Applications and Worksharing, vol. 268, pp. 467–476, Springer International Publishing, Cham. Series Title: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.
- X. Gao, Z. Guan, S. Feng and Y. Jiang (2023). Quantum Circuit Template Matching Optimization Method for Constrained Connectivity, Axioms, 12(7), p. 687.
- P. Gokhale, S. Koretsky, S. Huang, S. Majumder, A. Drucker, K. R. Brown and F. T. Chong (2021). Quantum Fan-out: Circuit Optimizations and Technology Modeling, in 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 276–290, IEEE, Broomfield, CO, USA.
- C. P. Williams and A. G. Gray (1999). Automated Design of Quantum Circuits, in G. Goos, J. Hartmanis, J. Van Leeuwen, and C. P. Williams (editors), Quantum Computing and Quantum Communications, vol. 1509, pp. 113–125, Springer Berlin Heidelberg, Berlin, Heidelberg. Series Title: Lecture Notes in Computer Science.
- J. Gorard, M. Namuduri and X. D. Arsiwalla (2021). ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification. _eprint: 2103.15820.
- D. Gosset, V. Kliuchnikov, M. Mosca and V. Russo (2014). An Algorithm for the T-Count, Quantum Info. Comput., 14(15–16), pp. 1261–1276. Place: Paramus, NJ Publisher: Rinton Press, Incorporated.
- T. Goubault De Brugière, M. Baboulin, B. Valiron and C. Allouche (2020). Quantum circuits synthesis using Householder transformations, Computer Physics Communications, 248, p. 107001.
- D. Grosse, R. Wille, G. W. Dueck and R. Drechsler (2008). Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don’t Cares, in 38th International Symposium on Multiple Valued Logic (ismvl 2008), pp. 214–219, IEEE, Dallas, TX.
- D. Grosse, R. Wille, G. Dueck and R. Drechsler (2009). Exact Multiple-Control Toffoli Network Synthesis With SAT Techniques, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 28(5), pp. 703–715.
- G. G. Guerreschi and J. Park (2018). Two-step approach to scheduling quantum circuits, Quantum Science and Technology, 3(4), p. 045003.
- P. Gupta, A. Agrawal and N. Jha (2006). An Algorithm for Synthesis of Reversible Logic Circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 25(11), pp. 2317–2330.
- L. Gyongyosi and S. Imre (2020). Circuit Depth Reduction for Gate-Model Quantum Computers, Scientific Reports, 10(1), p. 11229.
- A. Hawash, A. Awad and B. Abdalhaq (2020). Reversible Circuit Synthesis Time Reduction Based on Subtree-Circuit Mapping, Applied Sciences, 10(12), p. 4147.
- M. M. Rahman and G. W. Dueck (2013), Properties of Quantum Templates, in D. Hutchison, T. Kanade, J. Kittler, J. M. Kleinberg, F. Mattern, J. C. Mitchell, M. Naor, O. Nierstrasz, C. Pandu Rangan, B. Steffen, M. Sudan, D. Terzopoulos, D. Tygar, M. Y. Vardi, G. Weikum, R. Glück, and T. Yokoyama (editors), Reversible Computation, vol. 7581, pp. 125–137, Springer Berlin Heidelberg, Berlin, Heidelberg. Series Title: Lecture Notes in Computer Science.
- N. Abdessaied, M. Soeken and R. Drechsler (2014). Quantum Circuit Optimization by Hadamard Gate Reduction, in D. Hutchison, T. Kanade, J. Kittler, J. M. Kleinberg, A. Kobsa, F. Mattern, J. C. Mitchell, M. Naor, O. Nierstrasz, C. Pandu Rangan, B. Steffen, D. Terzopoulos, D. Tygar, G. Weikum, S. Yamashita, and S.-i. Minato (editors), Reversible Computation, vol. 8507, pp. 149–162, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- N. Abdessaied, R. Wille, M. Soeken and R. Drechsler (2013). Reducing the Depth of Quantum Circuits Using Additional Circuit Lines, in D. Hutchison, T. Kanade, J. Kittler, J. M. Kleinberg, F. Mattern, J. C. Mitchell, M. Naor, O. Nierstrasz, C. Pandu Rangan, B. Steffen, M. Sudan, D. Terzopoulos, D. Tygar, M. Y. Vardi, G. Weikum, G. W. Dueck, and D. M. Miller (editors), Reversible Computation, vol. 7948, pp. 221–233, Springer Berlin Heidelberg, Berlin, Heidelberg. Series Title: Lecture Notes in Computer Science.
- Z. Sasanian and D. M. Miller (2013). Reversible and Quantum Circuit Optimization: A Functional Approach, in D. Hutchison, T. Kanade, J. Kittler, J. M. Kleinberg, F. Mattern, J. C. Mitchell, M. Naor, O. Nierstrasz, C. Pandu Rangan, B. Steffen, M. Sudan, D. Terzopoulos, D. Tygar, M. Y. Vardi, G. Weikum, R. Glück, and T. Yokoyama (editors), Reversible Computation, vol. 7581, pp. 112–124, Springer Berlin Heidelberg, Berlin, Heidelberg. Series Title: Lecture Notes in Computer Science.
- R. Iten, R. Moyard, T. Metger, D. Sutter and S. Woerner (2022). Exact and Practical Pattern Matching for Quantum Circuit Optimization, ACM Transactions on Quantum Computing, 3(1), pp. 1–41.
- T. Itoko, R. Raymond, T. Imamichi and A. Matsuo (2020). Optimization of quantum circuit mapping using gate transformation and commutation, Integration, 70, pp. 43–50.
- T. Jones and S. C. Benjamin (2022), Robust quantum compilation and circuit optimisation via energy minimisation, Quantum, 6, p. 628.
- J. Jung and I.-C. Choi (2021). A multi-commodity network model for optimal quantum reversible circuit synthesis, PLOS ONE, 16(6), p. e0253140.
- J. Jung, K. Dalmeijer and P. Van Hentenryck (2024). A New Optimization Model for Multiple-Control Toffoli Quantum Circuit Design, LIPIcs, Volume 307, CP 2024, 307, pp. 16:1–16:20.
- M. Sarvaghad-Moghaddam, P. Niemann and R. Drechsler (2018). Multi-objective Synthesis of Quantum Circuits Using Genetic Programming, in J. Kari and I. Ulidowski (editors), Reversible Computation, vol. 11106, pp. 220–227, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- W. Hattori and S. Yamashita (2018). Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures, in J. Kari and I. Ulidowski (editors), Reversible Computation, vol. 11106, pp. 228–243, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- A. Kissinger and J. van de Wetering (2020). Reducing the number of non-clifford gates in quantum circuits, Physical Review A, 102(2).
- V. Kliuchnikov, D. Maslov and M. Mosca (2013). Fast and e?icient exact synthesis of single-qubit unitaries generated by Clifford and T gates, Quantum Information and Computation, 13(7&8), pp. 607–630.
- A. Kole, K. Datta and I. Sengupta (2016). A Heuristic for Linear Nearest Neighbor Realization of Quantum Circuits by SWAP Gate Insertion Using n-Gate Lookahead, IEEE Journal on Emerging and Selected Topics in Circuits and Systems, 6(1), pp. 62–72.
- T. G. De Brugière, M. Baboulin, B. Valiron, S. Martiel and C. Allouche (2020). Quantum CNOT Circuits Synthesis for NISQ Architectures Using the Syndrome Decoding Problem, in I. Lanese and M. Rawski (editors), Reversible Computation, vol. 12227, pp. 189–205, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- Y. Li, W. Liu, M. Li and Y. Li (2023). Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning, Quantum Information Processing, 22(8), p. 295.
- J. Liu, L. Bello and H. Zhou (2021). Relaxed Peephole Optimization: A Novel Compiler Optimization for Quantum Circuits, in 2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO), pp. 301–314, IEEE, Seoul, Korea (South).
- M. Lukac, M. Perkowski, H. Goi, M. Pivtoraiko, C. H. Yu, K. Chung, H. Jeech, B.-G. Kim and Y.-D. Kim (2003). Evolutionary Approach to Quantum and Reversible Circuits Synthesis, Artificial Intelligence Review, 20(3/4), pp. 361–417.
- M. Lukac, D. Shah, M. Perkowski and M. Kameyama (2014). Synthesis of Quantum Arrays from Kronecker Functional Lattice Diagrams, IEICE Transactions on Information and Systems, E97.D(9), pp. 2262–2269.
- D. Maslov and B. Zindorf (2022). Depth Optimization of CZ, CNOT, and Clifford Circuits, IEEE Transactions on Quantum Engineering, 3, pp. 1–8.
- D. Maslov and G. Dueck (2006). Level Compaction in Quantum Circuits, in 2006 IEEE International Conference on Evolutionary Computation, pp. 2405–2409.
- D. Maslov, C. Young, D. Miller and G. Dueck (2005). Quantum Circuit Simplification Using Templates, in Design, Automation and Test in Europe, pp. 1208–1213, IEEE, Munich, Germany.
- D. Maslov, G. Dueck, D. Miller and C. Negrevergne (2008). Quantum Circuit Simplification and Level Compaction, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27(3), pp. 436–444.
- D. Maslov and M. Saeedi (2011). Reversible Circuit Optimization via Leaving the Boolean Domain, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 30(6), pp. 806–816. ArXiv: 1103.0215.
- D. Maslov, G. W. Dueck and D. M. Miller (2007). Techniques for the synthesis of reversible Toffoli networks, ACM Transactions on Design Automation of Electronic Systems, 12(4), p. 42.
- D. Maslov and Y. Nam (2018). Use of global interactions in e?icient quantum circuit constructions, New Journal of Physics, 20(3), p. 033018.
- A. Matsuo, W. Hattori and S. Yamashita (2019). Reducing the Overhead of Mapping Quantum Circuits to IBM Q System, in 2019 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1–5.
- O. D. Matteo and M. Mosca (2016). Parallelizing quantum circuit synthesis, Quantum Science and Technology, 1(1), p. 015003.
- G. Meuli, M. Soeken and G. De Micheli (2018). SAT-based {CNOT, T} Quantum Circuit Synthesis, in J. Kari and I. Ulidowski (editors), Reversible Computation, Lecture Notes in Computer Science, pp. 175–188, Springer International Publishing, Cham.
- D. M. Miller, D. Maslov and G. W. Dueck (2003). A transformation based algorithm for reversible logic synthesis, in Proceedings of the 40th annual Design Automation Conference, pp. 318–323, ACM, Anaheim CA USA.
- I. Moflic and A. Paler (2023). Cost Explosion for E?icient Reinforcement Learning Optimisation of Quantum Circuits, in 2023 IEEE International Conference on Rebooting Computing (ICRC), pp. 1–5, IEEE, San Diego, CA, USA.
- M. Mohammadi, A. Niknafs, M. Eshghi and G. W. Dueck (2012). DESIGN AND OPTIMIZATION OF SINGLE AND MULTIPLE-LOOP REVERSIBLE AND QUANTUM FEEDBACK CIRCUITS, Journal of Circuits, Systems and Computers, 21(03), p. 1250018.
- N. Mohammadzadeh, M. S. Zamani and M. Sedighi (2009). Improving Latency of Quantum Circuits by Gate Exchanging, in 2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools, pp. 67–73.
- M. Möttönen, J. J. Vartiainen, V. Bergholm and M. M. Salomaa (2004). Quantum Circuits for General Multiqubit Gates, Physical Review Letters, 93(13), p. 130502.
- H. Nagarajan, O. Lockwood and C. Coffrin (2021). QuantumCircuitOpt: An Open-source Framework for Provably Optimal Quantum Circuit Design, in 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS), pp. 55–63.
- A. B. Nagy (2021). On an implementation of the Solovay-Kitaev algorithm, arXiv:quant-ph/0606077.
- Y. Nam, N. J. Ross, Y. Su, A. M. Childs and D. Maslov (2018). Automated optimization of large quantum circuits with continuous parameters, npj Quantum Information, 4(1), p. 23.
- P. Niemann, R. Wille and R. Drechsler (2020). Advanced exact synthesis of Clifford+T circuits, Quantum Information Processing, 19(9), p. 317.
- P. Niemann, A. Gupta and R. Drechsler (2019). T-depth Optimization for Fault-Tolerant Quantum Circuits, in 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), pp. 108–113.
- S. Niu, A. Hashim, C. Iancu, W. A. De Jong and E. Younis (2024). Effective Quantum Resource Optimization via Circuit Resizing in BQSKit, in Proceedings of the 61st ACM/IEEE Design Automation Conference, pp. 1–6, ACM, San Francisco CA USA.
- A. Pavlidis and D. Gizopoulos (2016). Hierarchical Synthesis of Quantum and Reversible Architectures, International Journal of Parallel Programming, 44(5), pp. 1028–1053.
- J. Paykin, A. T. Schmitz, M. Ibrahim, X.-C. Wu and A. Y. Matsuura (2023). PCOAST: A Pauli-Based Quantum Circuit Optimization Framework, in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 715–726, IEEE, Bellevue, WA, USA.
- M. Pedram and A. Shafaei (2016). Layout Optimization for Quantum Circuits with Linear Nearest Neighbor Architectures, IEEE Circuits and Systems Magazine, 16(2), pp. 62–74.
- A. K. Prasad, V. V. Shende, I. L. Markov, J. P. Hayes and K. N. Patel (2006). Data structures and algorithms for simplifying reversible circuits, ACM Journal on Emerging Technologies in Computing Systems, 2(4), pp. 277–293.
- Z. Qi, A. Matsuo and S. Yamashita (2024). Optimization for gaussian elimination-based nna-compliant circuit synthesis method by inserting cnot gates, in 2024 IEEE International Conference on Quantum Computing and Engineering (QCE), p. 971–978, IEEE.
- Y. Qian, Z. Guan, S. Zheng and S. Feng (2023). A Method Based on Timing Weight Priority and Distance Optimization for Quantum Circuit Transformation, Entropy, 25(3), p. 465.
- Raban Iten, Roger Colbeck, Ivan Kukuljan, Jonathan Home and Matthias Christandl (2016). Quantum circuits for isometries, PHYSICAL REVIEW A, 93(3), p. 032318.
- M. M. Rahman, G. W. Dueck and J. D. Horton (2014). An Algorithm for Quantum Template Matching, ACM Journal on Emerging Technologies in Computing Systems, 11(3), pp. 1–20.
- T. Goubault de Brugière, M. Baboulin, B. Valiron and C. Allouche (2019). Synthesizing Quantum Circuits via Numerical Optimization, in J. M. F. Rodrigues, P. J. S. Cardoso, J. Monteiro, R. Lam, V. V. Krzhizhanovskaya, M. H. Lees, J. J. Dongarra, and P. M. Sloot (editors), Computational Science – ICCS 2019, vol. 11537, pp. 3–16, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- B. Rosenhahn and T. J. Osborne (2023). Monte Carlo graph search for quantum circuit optimization, Physical Review A, 108(6), p. 062615.
- D. Ruffinelli and B. Barán (2017). Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective, Quantum Information Processing, 16(9), p. 220.
- D. Ruffinelli and B. Baran (2016). A multiobjective approach to linear nearest neighbor optimization for 2D quantum circuits, in 2016 XLII Latin American Computing Conference (CLEI), pp. 1–8.
- C. Ruican, M. Udrescu, L. Prodan and M. Vladutiu (2009). Genetic algorithm based quantum circuit synthesis with adaptive parameters control, in 2009 IEEE Congress on Evolutionary Computation, pp. 896–903.
- M. Saeedi, M. S. Zamani and M. Sedighi (2007). Algebraic Characterization of CNOT-Based Quantum Circuits with its Applications on Logic Synthesis, in 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD 2007), pp. 339–346.
- M. Saeedi, M. Arabzadeh, M. S. Zamani and M. Sedighi (2011). Block-Based Quantum-Logic Synthesis, Quantum Info. Comput., 11(3), pp. 262–277. Place: Paramus, NJ Publisher: Rinton Press, Incorporated.
- M. Saeedi, M. S. Zamani, M. Sedighi and Z. Sasanian (2010). Reversible circuit synthesis using a cycle-based approach, ACM Journal on Emerging Technologies in Computing Systems, 6(4), pp. 1–26.
- M. Saeedi, R. Wille and R. Drechsler (2011). Synthesis of quantum circuits for linear nearest neighbor architectures, Quantum Information Processing, 10(3), pp. 355–377.
- T. N. Sasamal, A. K. Singh and A. Mohan (2015). Reversible Logic Circuit Synthesis and Optimization Using Adaptive Genetic Algorithm, Procedia Computer Science, 70, pp. 407–413.
- M. Sedlák and M. Plesch (2008). Towards optimization of quantum circuits, Open Physics, 6(1).
- G. Sergioli (2017). Quantum circuit optimization for unitary operators over non-adjacent qudits. Version Number: 1.
- V. Shende, S. Bullock and I. Markov (2006). Synthesis of quantum-logic circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 25(6), pp. 1000–1010.
- R. D. d. Silva, E. Pius and E. Kashefi (2013). Global Quantum Circuit Optimization. _eprint: 1301.0351.
- M. Soeken, G. W. Dueck, M. M. Rahman and D. M. Miller (2016). An extension of transformation-based reversible and quantum circuit synthesis, in 2016 IEEE International Symposium on Circuits and Systems (IS-CAS), pp. 2290–2293.
- M. Soeken, D. M. Miller and R. Drechsler (2013). Quantum circuits employing roots of the Pauli matrices, Physical Review A, 88(4), p. 042322.
- M. Soeken, R. Wille, G. W. Dueck and R. Drechsler (2010). Window optimization of reversible and quantum circuits, in 13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, pp. 341–345.
- D. Srinivasan, K. Chakrabarti, N. Chopra and A. Dutt (2023). Quantum Circuit Optimization through Iteratively Pre-Conditioned Gradient Descent, in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 443–449, IEEE, Bellevue, WA, USA.
- K. Staudacher, T. Guggemos, S. Grundner-Culemann and W. Gehrke (2023). Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization, Electronic Proceedings in Theoretical Computer Science, 394, pp. 29–45.
- A. Younes (2018). Using Reed-Muller Expansions in the Synthesis and Optimization of Boolean Quantum Circuits, in S. Stepney and A. Adamatzky (editors), Inspired by Nature, vol. 28, pp. 113–141, Springer International Publishing, Cham. Series Title: Emergence, Complexity and Computation.
- S. Stojković, R. Stankovic, C. Moraga and M. Stankovic (2020). Reversible Circuits Synthesis from Functional Decision Diagrams by using Node Dependency Matrices, Journal of Circuits, Systems and Computers, 29(05), p. 2050079.
- L. Sünkel, D. Martyniuk, D. Mattern, J. Jung and A. Paschke (2023). GA4QCO: Genetic Algorithm for Quantum Circuit Optimization. _eprint: 2302.01303.
- O. Susam and M. Altun (2014). An e?icient algorithm to synthesize quantum circuits and optimization, in 2014 21st IEEE International Conference on Electronics, Circuits and Systems (ICECS), pp. 570–573, IEEE, Marseille, France.
- M. Szyprowski and P. Kerntopf (2011). An approach to quantum cost optimization in reversible circuits, in 2011 11th IEEE International Conference on Nanotechnology, pp. 1521–1526, IEEE, Portland, OR, USA.
- Y.-y. Tan, X.-y. Cheng, Z.-j. Guan, Y. Liu and H. Ma (2018). Multi-strategy based quantum cost reduction of linear nearest-neighbor quantum circuit, Quantum Information Processing, 17(3), p. 61.
- A. Matsuo and S. Yamashita (2019). An E?icient Method for Quantum Circuit Placement Problem on a 2-D Grid, in M. K. Thomsen and M. Soeken (editors), Reversible Computation, vol. 11497, pp. 162–168, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- G. Meuli, B. Schmitt, R. Ehlers, H. Riener and G. De Micheli (2019). Evaluating ESOP Optimization Methods in Quantum Compilation Flows, in M. K. Thomsen and M. Soeken (editors), Reversible Computation, vol. 11497, pp. 191–206, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- W. Van Dam, G. M. D’Ariano, A. Ekert, C. Macchiavello and M. Mosca (2007). Optimal Quantum Circuits for General Phase Estimation, Physical Review Letters, 98(9), p. 090501.
- A. Oddi and R. Rasconi (2018). Greedy Randomized Search for Scalable Compilation of Quantum Circuits, in W.-J. Van Hoeve (editor), Integration of Constraint Programming, Artificial Intelligence, and Operations Research, vol. 10848, pp. 446–461, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- C. Ruican, M. Udrescu, L. Prodan and M. Vladutiu (2009). Quantum Circuit Synthesis with Adaptive Parameters Control, in L. Vanneschi, S. Gustafson, A. Moraglio, I. De Falco, and M. Ebner (editors), Genetic Programming, vol. 5481, pp. 339–350, Springer Berlin Heidelberg, Berlin, Heidelberg. Series Title: Lecture Notes in Computer Science.
- N. Wiebe and M. Roetteler (2014). Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits, arXiv:1406.2040 [quant-ph]. ArXiv: 1406.2040.
- R. Wille and R. Drechsler (2009). BDD-based synthesis of reversible logic for large functions, in Proceedings of the 46th Annual Design Automation Conference, pp. 270–275, ACM, San Francisco California.
- R. Wille, A. Lye and R. Drechsler (2014). Considering nearest neighbor constraints of quantum circuits at the reversible circuit level, Quantum Information Processing, 13(2), pp. 185–199.
- R. Wille and R. Drechsler (2010). Effect of BDD Optimization on Synthesis of Reversible and Quantum Logic, Electronic Notes in Theoretical Computer Science, 253(6), pp. 57–70.
- R. Wille, A. Lye and R. Drechsler (2014). Exact Reordering of Circuit Lines for Nearest Neighbor Quantum Architectures, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 33(12), pp. 1818–1831.
- R. Wille, M. Soeken, C. Otterstedt and R. Drechsler (2013). Improving the mapping of reversible circuits to quantum circuits using multiple target lines, in 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 145–150, IEEE, Yokohama.
- R. Wille, A. Lye and R. Drechsler (2014). Optimal SWAP gate insertion for nearest neighbor quantum circuits, in 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 489–494, IEEE, Singapore.
- R. Wille, M. Saeedi and R. Drechsler (2010). Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost. ArXiv:1004.4609 [quant-ph].
- X.-C. Wu, M. G. Davis, F. T. Chong and C. Iancu (2021). Reoptimization of Quantum Circuits via Hierarchical Synthesis, in 2021 International Conference on Rebooting Computing (ICRC), pp. 35–46.
- Y. Xiao, S. Nazarian and P. Bogdan (2021). A stochastic quantum program synthesis framework based on Bayesian optimization, Scientific Reports, 11(1), p. 13138.
- G. Yang, W. Hung, X. Song and M. Perkowski (2005). Exact synthesis of 3-qubit quantum circuits from nonbinary quantum gates using multiple-valued logic and group theory, in Design, Automation and Test in Europe, pp. 434–435 Vol. 1.
- Y.-S. Yang, H.-K. Chen, S.-Y. Kuo, G.-J. Zeng and Y.-H. Chou (2015). A Novel E?icient Optimal Reversible Circuit Synthesis Algorithm, in 2015 IEEE International Conference on Systems, Man, and Cybernetics, pp. 68–73, IEEE, Kowloon Tong, Hong Kong.
- A. Younes * and J. F. Miller (2004). Representation of Boolean quantum circuits as reed–Muller expansions, International Journal of Electronics, 91(7), pp. 431–444.
- M. Baioletti, R. Rasconi and A. Oddi (2021). A Novel Ant Colony Optimization Strategy for the Quantum Circuit Compilation Problem, in C. Zarges and S. Verel (editors), Evolutionary Computation in Combinatorial Optimization, vol. 12692, pp. 1–16, Springer International Publishing, Cham. Series Title: Lecture Notes in Computer Science.
- S. Zhang, J. Wu and L. Li (2023). Characterization, synthesis, and optimization of quantum circuits over multiple-control Z -rotation gates: A systematic study, Physical Review A, 108(2), p. 022603.
- S. Zhang, K. Huang and L. Li (2024). Depth-optimized quantum circuit synthesis for diagonal unitary operators with asymptotically optimal gate count, Physical Review A, 109(4), p. 042601.
- Z. Zhang, Z. Guan, H. Zhang, H. Ma and W. Ding (2018). A method for synthesis and optimization for linear nearest neighbor quantum circuits by parallel processing, Quantum Information and Computation, 18(13&14), pp. 1095–1114.
- X. Zhou, Y. Feng and S. Li (2020). A monte carlo tree search framework for quantum circuit transformation, in Proceedings of the 39th International Conference on Computer-Aided Design, pp. 1–7, ACM, Virtual Event USA.
- W. Zhu, Z. Li, G. Zhang, S. Pan and W. Zhang (2018). A Reversible Logical Circuit Synthesis Algorithm Based on Decomposition of Cycle Representations of Permutations, International Journal of Theoretical Physics, 57(8), pp. 2466–2474.
- M. Zomorodi-Moghadam and K. Navi (2016). Rotation-Based Design and Synthesis of Quantum Circuits, Journal of Circuits, Systems and Computers, 25(12), p. 1650152.
- X. Wang (2024). Quantum speedup, circuit decoupling, and stochastic modelling: on how quantum theory improves machine-learning, and how machine-learning helps to process quantum information, Ph.D. thesis, Nanyang Technological University.
- S. Hossain (2009), Classical Search and Quantum Search Algorithms for Synthesis of Quantum Circuits and Optimization of Quantum Oracles, Doctor of Philosophy in Electrical and Computer Engineering, Portland State University.
- M. Amy (2013), Algorithms for the Optimization of Quantum Circuits, Master’s thesis, University of Waterloo.
- M. Amy (2019), Formal Methods in Quantum Circuit Design, PhD Thesis.
- Z. Sasanian (2012), Technology Mapping and Optimization for Reversible and Quantum Circuits, PhD Thesis, University of Victoria.
- M. Avitabile (2021), Proposal for a multi-technology, template-based quantum circuits compilation toolchain, PhD Thesis, Politecnico di Torino.
- T. G. de Brugière (2020). Methods for optimizing the synthesis of quantum circuits. (Méthodes pour l’optimisation de la synthèse de circuits quantiques), Ph.D. thesis, University of Paris-Saclay, France.
- M. Saraivanov (2013). Quantum Circuit Synthesis using Group Decomposition and Hilbert Spaces, Master’s thesis, Portland State University.
- K. Staudacher (2021). Optimization Approaches for Quantum Circuits using ZX-calculus, Master’s thesis, Universitaet Muenchen.
- A. Y. Kitaev (1995). Quantum measurements and the abelian stabilizer problem.
- C. Jones (2013). Low-overhead constructions for the fault-tolerant Toffoli gate, Physical Review A, 87(2), p. 022328.
- O. Golubitsky and D. Maslov (2012). A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis, IEEE Transactions on Computers, 61(9), pp. 1341–1353.
- A. J. Kitaev, A. C. Šen and M. N. Vjalyj (2002). Classical and quantum computation, no. volume 47 in Graduate studies in mathematics, American Mathematical Society, Providence, Rhode Island.
- M. A. Nielsen and I. L. Chuang (2010). Quantum computation and quantum information, Cambridge University Press, Cambridge; New York, 10th anniversary ed edn.
- N. Abdessaied and R. Drechsler (2016). Reversible and Quantum Circuits, Springer International Publishing.
- M. Saeedi and I. L. Markov (2013). Synthesis and optimization of reversible circuits—a survey, ACM Computing Surveys, 45(2), pp. 1–34.
- T. N. Sasamal, H. M. Gaur, A. K. Singh and A. Mohan (2020). Reversible Circuit Synthesis Using Evolutionary Algorithms, in A. K. Singh, M. Fujita, and A. Mohan (editors), Design and Testing of Reversible Logic, vol. 577, pp. 115–128, Springer Singapore, Singapore. Series Title: Lecture Notes in Electrical Engineering.
- K. Karuppasamy, V. Puram, S. Johnson and J. P. Thomas (2025). A comprehensive review of quantum circuit optimization: Current trends and future directions, Quantum Reports, 7(1), p. 2.
- M. Möttönen and J. J. Vartiainen (2006). Decompositions of general quantum gates, Trends in quantum computing research, p. 149. ArXiv preprint quant-ph/0504100.
- V. Bergholm, J. J. Vartiainen, M. Möttönen and M. M. Salomaa (2005). Quantum circuits with uniformly controlled one-qubit gates, Physical Review A—Atomic, Molecular, and Optical Physics, 71(5), p. 052330.
- A. Khadieva, O. Salehi and A. Yakaryı lmaz (2024). A representative framework for implementing quantum finite automata on real devices, in Proceedings of UCNC 2024, vol. 14776 of LNCS, pp. 163–177.
- I. Zinnatullin and K. Khadiev (2026). E?icient algorithms for quantum hashing, in Proceedings of UCNC 2025, vol. 16364 of LNCS. ArXiv preprint arXiv:2507.07002, https://doi.org/10.1007/978-3-032-15641-9_21.
- I. Zinnatullin, K. Khadiev and A. Khadieva (2023). E?icient implementation of amplitude form of quantum hashing using state-of-the-art quantum processors, Russian Microelectronics, 52(Suppl 1), pp. S390–S394.
- I. Zinnatullin, K. Khadiev and I. Nikitin (2025). Connectivity-aware qubit mapping and cnot cost minimization for quantum hashing circuits, Russian Microelectronics.
- M. G. Davis, E. Smith, A. Tudor, K. Sen, I. Siddiqi and C. Iancu (2019). Heuristics for Quantum Compiling with a Continuous Gate Set. ArXiv:1912.02727 [quant-ph].
- R. Wille, D. Große, L. Teuber, G. W. Dueck and R. Drechsler (2008). Revlib: An online resource for reversible functions and reversible circuits, in 38th International Symposium on Multiple Valued Logic (ismvl 2008), pp. 220–225.
- D. Pastorello, E. Blanzieri and V. Cavecchia (2021). Learning adiabatic quantum algorithms over optimization problems, Quantum Machine Intelligence, 3(1), p. 2.
- M. A. Maltseva, E. Blanzieri and A. S. Rumyantsev (2024). Quantum Circuit Optimization Via Graph Partitioning by Quantum Annealing, Lobachevskii Journal of Mathematics, 45(10), pp. 5126–5140.
- A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin and H. Weinfurter (1995). Elementary gates for quantum computation, Physical Review A, 52(5), p. 3457–3467.
- T. Sleator and H. Weinfurter (1995). Realizable universal quantum logic gates, Phys. Rev. Lett., 74, pp. 4087–4090.
- Alexis De Vos and Stijn De baerdemacker (2016). Block-ZXZ synthesis of an arbitrary quantum circuit, Phys. Rev. A, 94(5), p. 052317.
- J. Kusyk, S. M. Saeed and M. U. Uyar (2021). Survey on quantum circuit compilation for noisy intermediatescale quantum computers: Artificial intelligence to heuristics, IEEE Transactions on Quantum Engineering, 2, pp. 1–16.
- X.Zhou, S. Li and Y. Feng (2020). Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39(12), pp. 4683–4694. ArXiv:1908.08853 [quant-ph].
- A. Botea, A. Kishimoto and R. Marinescu (2021). On the Complexity of Quantum Circuit Compilation, Proceedings of the International Symposium on Combinatorial Search, 9(1), pp. 138–142.
- P. Zhu, S. Zheng, L. Wei, X. Cheng, Z. Guan and S. Feng (2022). The complexity of quantum circuit mapping with fixed parameters, Quantum Information Processing, 21(10), p. 361.
- C.-Y. Lai and H.-C. Cheng (2022). Learning Quantum Circuits of Some T Gates, IEEE Transactions on Information Theory, 68(6), pp. 3951–3964.
- I. F. Araujo, D. K. Park, F. Petruccione and A. J. Da Silva (2021). A divide-and-conquer algorithm for quantum state preparation, Scientific Reports, 11(1), p. 6329.
- M. Kölle, T. Schubert, P. Altmann, M. Zorn, J. Stein and C. Linnhoff-Popien (2024). A Reinforcement Learning Environment for Directed Quantum Circuit Synthesis, in Proceedings of the 16th International Conference on Agents and Artificial Intelligence, pp. 83–94, SCITEPRESS - Science and Technology Publications, Rome, Italy.
- Z. YU, Y. Li, L. Liu and S. Feng (2022). Survey of Quantum Computing Simulation and Optimization Methods, Computer Engineering, 48(1), pp. 1–11. (In Chinese).
- B. Park and D. Ahn (2023). Reducing cnot count in quantum fourier transform for the linear nearest-neighbor architecture, Scientific Reports, 13(1), p. 8638.
- A. Khadieva (2026). Quantum hashing algorithm implementation, Lobachevskii Journal of Mathematics. ArXiv:quant-ph/2024.
- K. Khadiev, A. Khadieva, Z. Chen and J. Wu (2025). Implementation of quantum fourier transform and quantum hashing for a quantum device with arbitrary qubits connection graphs, Quantum Inforation and computation, 25.
- K. Khadiev, A. Khadieva, V. Sagitov and K. Khasanov (2025). Quantum circuit for quantum fourier transform for arbitrary qubit connectivity graphs, in Proceedings of LATA 2026, LNCS. ArXiv preprint arXiv:2510.09824.
- A. Fowler, S. Devitt and L. Hollenberg (2004). Implementation of shor’s algorithm on a linear nearest neighbour qubit array, Quantum Information & Computation, 4(4), pp. 237–251.
- A. Barenco, A. Ekert, K.-A. Suominen and P. Törmä (1996). Approximate quantum fourier transform and decoherence, Physical Review A, 54(1), p. 139.
- Y. Takahashi, N. Kunihiro and K. Ohta (2007). The quantum fourier transform on a linear nearest neighbor architecture, Quantum Information & Computation, 7(4), pp. 383–391.
- B. Park and D. Ahn (2022). T-count optimization of approximate quantum fourier transform, arXiv preprint arXiv:2203.07739.
- V. V. Shende, S. S. Bullock and I. L. Markov (2005). Synthesis of quantum logic circuits, in Proceedings of the 2005 Asia and South Pacific Design Automation Conference, ASP-DAC ‘05, p. 272–275, Association for Computing Machinery, New York, NY, USA.
- V. V. Shende, I. L. Markov and S. S. Bullock (2004). Minimal universal two-qubit controlled-not-based circuits, Phys. Rev. A, 69, p. 062321.
- V. Shende, I. Markov and S. Bullock (2004). Smaller two-qubit circuits for quantum communication and computation, in Proceedings Design, Automation and Test in Europe Conference and Exhibition, vol. 2, pp. 980–985 Vol.2.
- V. V. Shende, I. L. Markov and S. S. Bullock (2004). Minimal universal two-qubit controlled-NOT-based circuits, Physical Review A, 69(6), p. 062321.
- V. V. Shende and I. L. Markov (2009). On the CNOT-Cost of TOFFOLI Gates, Quantum Info. Comput., 9(5), pp. 461–486. Place: Paramus, NJ Publisher: Rinton Press, Incorporated.
- D. Maslov and W. Yang (2023). CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate, npj Quantum Information, 9(1), p. 96.
- F. Vatan and C. Williams (2004). Optimal quantum circuits for general two-qubit gates, Physical Review A, 69(3), p. 032315.
- G. Vidal and C. M. Dawson (2004). Universal quantum circuit for two-qubit transformations with three controlled-NOT gates, Physical Review A, 69(1), p. 010301.
- A. Zlokapa, B. Villalonga, S. Boixo and D. A. Lidar (2023). Boundaries of quantum supremacy via random circuit sampling, npj Quantum Information, 9(1).
- M. Saeedi, N. MohammadZadeh, M. Sedighi and M. S. Zamani (2008). Evaluation and Improvement of Quantum Synthesis Algorithms based on a Thorough Set of Metrics, in 2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools, pp. 490–493, IEEE, Parma, Italy.
- N. Abdessaied, M. Amy, R. Drechsler and M. Soeken (2016). Complexity of reversible circuits and their quantum implementations, Theoretical Computer Science, 618, pp. 85–106.
Language: English
Page range: 154 - 179
Submitted on: Jan 12, 2026
Accepted on: Feb 3, 2026
Published on: Jun 4, 2026
Published by: Cerebration Science Publishing Co., Limited
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
© 2026 Mariia Makarova, Davide Pastorello, Valter Cavecchia, Enrico Blanzieri, Kamil Khadiev, Alexander Rumyantsev, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.