{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:03:29Z","timestamp":1780711409552,"version":"3.54.1"},"reference-count":27,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T00:00:00Z","timestamp":1689292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["62072259"],"award-info":[{"award-number":["62072259"]}]},{"name":"National Natural Science Foundation of China","award":["BK20151274"],"award-info":[{"award-number":["BK20151274"]}]},{"name":"Jiangsu Province Natural Science Foundation of China","award":["62072259"],"award-info":[{"award-number":["62072259"]}]},{"name":"Jiangsu Province Natural Science Foundation of China","award":["BK20151274"],"award-info":[{"award-number":["BK20151274"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>The execution of quantum algorithms requires two key considerations. On the one hand, it should meet the connectivity constraint requirements of quantum circuit mapping for quantum architectures, and on the other hand, it needs to consider reducing the probability of errors in the execution of quantum circuits as much as possible. This paper proposes a novel optimization technique based on template matching that to satisfy both requirements. The template matching optimization method can significantly reduce the number of gates in a quantum circuit and further enhance its practicality. It stands as advanced optimization technology available today. Our method optimizes quantum logic circuits mapped onto quantum architecture by initially selecting their linear substructure. We then zone the circuit according to the gate dependency graph and optimize each block through template matching. Finally, we reorganize the circuit to obtain the optimized version as the final result. Our proposed method is amenable to various quantum architectures. To evaluate its efficacy, we conduct a comparative analysis with the t|ket\u27e9 and Qiskit compiler using a set of benchmark test circuits. Specifically, compare to the t|ket\u27e9 compiler method, the highest average optimization rate of our method can reach 25.75%. Compare with the Qiskit compiler method, the highest average optimization rate can reach 32.72%. Overall, our approach has significant optimization advantages.<\/jats:p>","DOI":"10.3390\/axioms12070687","type":"journal-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T08:40:06Z","timestamp":1689324006000},"page":"687","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantum Circuit Template Matching Optimization Method for Constrained Connectivity"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5067-2245","authenticated-orcid":false,"given":"Xiaofeng","family":"Gao","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Nantong University, Nantong 226001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhijin","family":"Guan","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Nantong University, Nantong 226001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5110-3881","authenticated-orcid":false,"given":"Shiguang","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-Sen University, Guangzhou 510006, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yibo","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Nantong University, Nantong 226001, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,7,14]]},"reference":[{"key":"ref_1","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_2","unstructured":"Nielsen, M.A., and Chuang, I.L. (2010). Quantum Computation and Quantum Information, Cambridge University Press. [10th ed.]."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2643","DOI":"10.1145\/3498325","article-title":"Exact and practical pattern matching for quantum circuit optimization","volume":"3","author":"Iten","year":"2022","journal-title":"ACM Trans. Quantum Comput."},{"key":"ref_4","unstructured":"Pointing, J., Padon, O., Jia, Z., Ma, H., Hirth, A., and Palsberg, J. (2021). Quanto: Optimizing Quantum Circuits with Automatic Generation of Circuit Identities. arXiv."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Bandyopadhyay, C., Wille, R., Drechsler, R., and Rahaman, H. (2020, January 23\u201325). Post Synthesis-Optimization of Reversible Circuit using Template Matching. Proceedings of the 24th International Symposium on VLSI Design and Test (VDAT), Bhubaneswar, India.","DOI":"10.1109\/VDAT50263.2020.9190279"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"580","DOI":"10.22331\/q-2021-11-16-580","article-title":"Clifford Circuit Optimization with Templates and Symbolic Pauli Gates","volume":"5","author":"Bravyi","year":"2021","journal-title":"Quantum"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Li, G., Ding, Y., and Xie, Y. (2019, January 13\u201317). 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_8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.vlsi.2019.10.004","article-title":"Optimization of quantum circuit mapping using gate transformation and commutation","volume":"70","author":"Itoko","year":"2020","journal-title":"Integration"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Wille, R., Burgholzer, L., and Zulehner, A. (2019, January 2\u20136). Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H operations. Proceedings of the 2019 56th ACM\/IEEE Design Automation Conference (DAC), Las Vegas, NV, USA.","DOI":"10.1145\/3316781.3317859"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s11128-022-03698-0","article-title":"The complexity of quantum circuit mapping with fixed parameters","volume":"21","author":"Zhu","year":"2022","journal-title":"Quantum Inf. Process."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"4721","DOI":"10.1109\/TCAD.2020.2970594","article-title":"A dynamic look-ahead heuristic for the qubit mapping problem of NISQ computers","volume":"39","author":"Zhu","year":"2020","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"014003","DOI":"10.1088\/2058-9565\/ab8e92","article-title":"T|ket\u232a: A retargetable compiler for nisq devices","volume":"6","author":"Sivarajah","year":"2020","journal-title":"Quantum Sci. Technol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1088\/0034-4885\/61\/2\/002","article-title":"Quantum computing","volume":"61","author":"Steane","year":"1997","journal-title":"Rep. Prog. Phys."},{"key":"ref_14","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_15","first-page":"561","article-title":"The cost of quantum gate primitives","volume":"12","author":"Lee","year":"2006","journal-title":"J. Mult.-Valued Log. Soft Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1103\/PhysRevLett.110.190502","article-title":"Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits","volume":"110","author":"Kliuchnikov","year":"2013","journal-title":"Phys. Rev. Lett."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41534-018-0072-4","article-title":"Automated optimization of large quantum circuits with continuous parameters","volume":"4","author":"Nam","year":"2018","journal-title":"NPJ Quantum Inf."},{"key":"ref_18","unstructured":"Patel, T., Younis, E., Iancu, C., Jong, W.D., and Tiwari, D. (2021). Robust and Resource-Efficient Quantum Circuit Approximation. arXiv."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1142\/S0219749905001067","article-title":"\u201cNon-Identity-Check\u201d Is Qma-Complete","volume":"3","author":"Janzing","year":"2005","journal-title":"Int. J. Quantum Inf."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/1216396.1216399","article-title":"Data structures and algorithms for simplifying reversible circuits","volume":"2","author":"Prasad","year":"2006","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1109\/TCAD.2007.911334","article-title":"Quantum circuit simplification and level compaction","volume":"27","author":"Maslov","year":"2008","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.22331\/q-2020-06-04-279","article-title":"Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus","volume":"4","author":"Duncan","year":"2020","journal-title":"Quantum"},{"key":"ref_23","unstructured":"(2022, December 11). IBM Quantum Experience. Available online: https:\/\/quantum-computing.ibm.com\/."},{"key":"ref_24","unstructured":"(2023, May 14). Qiskit\u2014An Open-Source Framework for Working with Noisy Quantum Computers at the Level of Pulses, Circuits, and Algorithms. Available online: https:\/\/github.com\/Qiskit."},{"key":"ref_25","unstructured":"Rahman, M.M., and Dueck, G.W. (2012, January 2\u20133). Properties of quantum templates. Proceedings of the 4th International Workshop, RC 2012, Berlin\/Heidelberg, Germany."},{"key":"ref_26","unstructured":"Rahman, M.M., Dueck, G.W., and Horton, J.D. (2015). An Algorithm for Quantum Template Matching, Association for Computing Machinery."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Nath, R.K., Sharma, M., Dutta, P., and Shang, Y. (2021). On r-Noncommuting Graph of Finite Rings. Axioms, 10.","DOI":"10.3390\/axioms10030233"}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/7\/687\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:11:46Z","timestamp":1760127106000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/7\/687"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,14]]},"references-count":27,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2023,7]]}},"alternative-id":["axioms12070687"],"URL":"https:\/\/doi.org\/10.3390\/axioms12070687","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,14]]}}}