References
- P.W. Shor (1994). Algorithms for quantum computation: Discrete log and factoring, in Proceeding of the 35th Annual Symposium on Foundations of Computer Science, pp.124-134.
- P.W. Shor (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, Society for Industrial and Applied Mathematics Journal on Computing, Vol.26, No.5, pp.1484-1509.
- E. Rieffel and W. Polak (2000). An introduction to quantum computing for non-physicists. ACM Computing Surveys, Vol.32, Issue 3, pp.300-335.
- A. Montanaro (2016). Quantum algorithms: an overview. NPJ Quantum Information, Vol.2.
- Quantum logic gate (2024). Wikipedia:Quantum logic gate Wikimedia Foundation. en.wikipedia.org/wiki/Quantum-logic-gate.
- L.K. Grover (1996). A fast quantum mechanical algorithm for database search, In the Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp.212-219.
- L.K. Grover (1998). A framework for fast quantum mechanical algorithms, In the Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, pp.53-62.
- S. Pabst and Y. Nam (2022). A quantum algorithm for network reliability. Quantum Physics.
- Y.J. Zhang, X.D. Mua, X.W. Liu, X.Y. Wang, X. Zhang, K. Li, T.Y. Wub, D. Zhao and C. Dong (2022). Applying the quantum approximate optimization algorithm to the minimum vertex cover problem. Applied Soft Computing, Vol.118, pp.1-8.
- R. Wong, W.L. Chang, W.Y. Chung and A.V. Vasilakos (2023). Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks. Scientific Reports, Vol.13, Article No.4205.
- C.H. Bennett, P. Bernstein, P. Brassard and P. Vazirani (1997). Strengths and weaknesses of quantum computing, SIAM Journal on Computing, Vol.26, Issue 5, pp1510-1523.
- F. Glover, G. Kochenberger and R. Hennig (2022). Quantum bridge analytics I: a tutorial on formulating and using QUBO models. Annals of Operations Research, Vol.314, pp.141-183.
- L.P. Yu, C.Y. Chen, C.S. Lai, B. Sheu, S.K. Kao and C.R. Chang (2021). Annealing in the noisy intermediatescale quantum era: key concepts and approaches. IEEE Nanotechnology Magazine, Vol.15, No.6, pp.21-27, 2021.
- G. Kochenberger, J.K. Hao, F. Glover, M. Lewis, Z. Lu, H. Wang and Y. Wang (2014). The unconstrained binary quadratic programming problem: a survey. Journal of Combinatorial Optimization, Vol.28, Issue 1, pp.58-81.
- C.H. Ou, C.Y. Chen, C.F. Wang and C.R. Chang (2023). Quantum-inspired vehicle routing scheme for rebalancing in bike sharing systems, Vol.13, No.2, pp.2340018-1-8, SPIN.
- R. Nikouei, N. Rasoulib, S. Tahmasebic, S. Zolfid and H. Faragardie (2019). A quantum-annealing-based approach to optimize the deployment cost of a multi-sink multi-controller WSN. Procedia Computer Science, Vol.155, pp.250-257.
- T. Krauss and J. Mccollum (2020). Solving the network shortest path problem on a quantum annealer. IEEE Transactions on Quantum Engineering, Vol.1, pp.1-12.
- M.R. Garey and D.H. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company.
- A.H. Karbasi and R.E. Atani (2013). Application of dominating sets in wireless sensor network. International Journal of Security and Its Applications, Vol.7, No.4, pp.185-202.
- J. Yu, N. Wang, G. Wang and D. Yu (2013). Connected dominating sets in wireless ad hoc and sensor networks-A comprehensive survey. Computer Communications, Vol.36, Issue 2, pp.121-134.
- D.Z. Du and P.J. Wan (2013). Connected Dominating Set: Theory and Applications, Springer.
- Z. Zhang, J. Zhou and D. Du (2016). Performance guaranteed approximation algorithm for fault-tolerant connected dominating set in wireless sensor networks, in Proceeding of the 35th Annual IEEE International Conference on Computer Communications (IEEE INFORCOM’16), pp.1-8.
- L. Song, C. Liu, H. Huang, H. Du and X. Jia (2019). Minimum connected dominating set under routing cost constraint in wireless sensor networs with different transmission ranges. IEEE/ACM Transactions on Networking, Vol.27, No.2, pp.546-559.
- H. Tang, T.C.E. Cheng, and C.T. Ng (2009). Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications. Computers & Industrial Engineering, Vol.57, Issue 3, pp.707-71.
- Z. Shao, R. Kosari, R. Anoos, S. Sheikholeslami, J. Dayap and R.L (2020). Gutierrez, Outer-convex dominating set in the corona of graphs as encryption key generator, Complexity, 2020.
- J.R. Jiang and Q.Y. Lin (2023). Utilizing Novel Quantum Counters for Grover’s Algorithm to Solve the Dominating Set Problem. arXiv preprint arXiv:2312.09388.
- A.M. Krol and Z. Al-Ars (2024). Beyond Quantum Shannon: Circuit Construction for General n-Qubit Gates Based on Block ZXZ-Decomposition. arXiv preprint arXiv:2403.13692.
- M. A. Nielsen and I. L. Chuang (2010). Quantum Computation and Quantum Information, Cambridge University Press.
- Qiskit (2017). IBM Quantum. Version 1.0.0. Available at: https://qiskit.org/.
- Guifré Vidal (2003). Efficient classical simulation of slightly entangled quantum computations. Physical review letters, 91(14):147902.
- Ulrich Schollwöck (2011). The density-matrix renormalization group in the age of matrix product states. Annals of physics, 326(1):96–192.