Have a personal or library account? Click to login
Toward an Algorithmic Framework and Grover’s search speedup for Quantum Circuit Design—Leveraging the Minimum Connected Dominating Set Problem as an Example Cover

Toward an Algorithmic Framework and Grover’s search speedup for Quantum Circuit Design—Leveraging the Minimum Connected Dominating Set Problem as an Example

Open Access
|Mar 2026

Authors

Chu-Fu Wang

cfwang@mail.nptu.edu.tw

Department of Computer Science and Artificial Intelligence, National Pingtung University, Pingtung, Taiwan

Yih-Kai Lin

yklin@mail.nptu.edu.tw

Department of Computer Science and Artificial Intelligence, National Pingtung University, Pingtung, Taiwan

Chia-Ho Ou

cho@mail.nptu.edu.tw

Department of Computer Science and Information Engineering, National Pingtung University, Pingtung, Taiwan
Graduate School of Information Sciences, Tohoku University, Sendai, Japan

Jau-Der Shih

jdshih@mail.nptu.edu.tw

Department of Computer Science and Artificial Intelligence, National Pingtung University, Pingtung, Taiwan
DOI: https://doi.org/10.2478/qic-2025-0037 | Journal eISSN: 3106-0544 | Journal ISSN: 1533-7146
Language: English
Page range: 687 - 715
Submitted on: Sep 7, 2025
|
Accepted on: Oct 20, 2025
|
Published on: Mar 9, 2026
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2026 Chu-Fu Wang, Yih-Kai Lin, Chia-Ho Ou, Jau-Der Shih, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.