Evren Daglarli^*

CMC-Computers, Materials & Continua, Vol.84, No.3, pp. 4511-4537, 2025, DOI:10.32604/cmc.2025.065572 - 30 July 2025

Abstract This study aims to develop a quantum computing-based neurocognitive architecture that allows an agent to perform autonomous behaviors. Therefore, we present a brain-inspired cognitive architecture for autonomous agents that integrates a prefrontal cortex–inspired model with modern deep learning (a transformer-based reinforcement learning module) and quantum algorithms. In particular, our framework incorporates quantum computational routines (Deutsch–Jozsa, Bernstein–Vazirani, and Grover’s search) to enhance decision-making efficiency. As a novelty of this research, this comprehensive computational structure is empowered by quantum computing operations so that superiority in speed and robustness of learning compared to classical methods can be demonstrated.… More >

Dingjie Lu¹, Zhao Wang¹, Jun Liu¹, Yangfan Li¹, Wei-Bin Ewe¹, Liu Zhuangjian^1,*

The International Conference on Computational & Experimental Engineering and Sciences, Vol.31, No.2, pp. 1-1, 2024, DOI:10.32604/icces.2024.010961

Abstract This study heralds a new era in computational mechanics through the integration of Quantum Computing with the Finite Element Method (FEM), representing a quantum leap forward in addressing complex engineering simulations. Our approach utilizes Variational Quantum Algorithms (VQAs) to tackle challenges that have been traditionally well-solved on classical computers yet pose significant obstacles in the quantum computing domain. This innovation not only surmounts these challenges but also extends the applicability of quantum computing to real-world engineering problems, moving beyond mere conceptual demonstrations of quantum computing in numerical methods. The development of a novel strategy for… More >

Giuseppe Corrente^1,2,*, Carlo Vincenzo Stanzione^3,4, Vittoria Stanzione⁵

Journal of Quantum Computing, Vol.5, pp. 55-70, 2023, DOI:10.32604/jqc.2023.044786 - 14 December 2023

Abstract The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a Hamiltonian cycle problem, using different models of computations and especially the probabilistic and quantum ones. Starting from the classical probabilistic approach of random walks, we take a step to the quantum direction by involving an ad hoc designed Quantum Turing Machine (QTM), which can be a useful conceptual project tool for quantum algorithms. Introducing several More >

Mohammed Zidan^1,2,*, Manal G. Eldin³, Mahmoud Y. Shams⁴, Mohamed Tolan^5,6, Ayman Abd-Elhamed^2,7, Mahmoud Abdel-Aty⁸

CMC-Computers, Materials & Continua, Vol.71, No.1, pp. 1065-1078, 2022, DOI:10.32604/cmc.2022.020103 - 03 November 2021

Abstract We present a novel quantum algorithm to evaluate the hamming distance between two unknown oracles via measuring the degree of entanglement between two ancillary qubits. In particular, we use the power of the entanglement degree based quantum computing model that preserves at most the locality of interactions within the quantum model structure. This model uses one of two techniques to retrieve the solution of a quantum computing problem at hand. In the first technique, the solution of the problem is obtained based on whether there is an entanglement between the two ancillary qubits or not.… More >

Peng Gao^*, Marek Perkowski, Yiwei Li, Xiaoyu Song

CMC-Computers, Materials & Continua, Vol.70, No.3, pp. 4545-4561, 2022, DOI:10.32604/cmc.2022.020483 - 11 October 2021

Abstract After Google reported its realization of quantum supremacy, Solving the classical problems with quantum computing is becoming a valuable research topic. Switching function minimization is an important problem in Electronic Design Automation (EDA) and logic synthesis, most of the solutions are based on heuristic algorithms with a classical computer, it is a good practice to solve this problem with a quantum processer. In this paper, we introduce a new hybrid classic quantum algorithm using Grover’s algorithm and symmetric functions to minimize small Disjoint Sum of Product (DSOP) and Sum of Product (SOP) for Boolean switching More >

Wenbin Yu¹, Hao Feng¹, Yinsong Xu¹, Na Yin¹, Yadang Chen^2,3, Zhi-Xin Yang^3,*

CMC-Computers, Materials & Continua, Vol.67, No.1, pp. 241-252, 2021, DOI:10.32604/cmc.2021.012649 - 12 January 2021

Abstract Security and privacy issues have attracted the attention of researchers in the field of IoT as the information processing scale grows in sensor networks. Quantum computing, theoretically known as an absolutely secure way to store and transmit information as well as a speed-up way to accelerate local or distributed classical algorithms that are hard to solve with polynomial complexity in computation or communication. In this paper, we focus on the phase estimation method that is crucial to the realization of a general multi-party computing model, which is able to be accelerated by quantum algorithms. A More >

Wenjie Liu^{1, 2, *}, Junxiu Chen², Yinsong Xu², Jiahao Tang², Lian Tong³, Xiaoyu Song⁴

CMC-Computers, Materials & Continua, Vol.65, No.2, pp. 1671-1689, 2020, DOI:10.32604/cmc.2020.07564 - 20 August 2020

Abstract With the rapid development of quantum theory and technology in recent years, especially the emergence of some quantum cloud computing platforms, more and more researchers are not satisfied with the theoretical derivation and simulation verification of quantum computation (especially quantum algorithms), experimental verification on real quantum devices has become a new trend. In this paper, three representative quantum algorithms, namely Deutsch-Jozsa, Grover, and Shor algorithms, are briefly depicted, and then their implementation circuits are presented, respectively. We program these circuits on python with QISKit to connect the remote real quantum devices (i.e., ibmqx4, ibmqx5) on More >

Wenbin Yu^{1, 2, 3, *}, Yinsong Xu^{1, 2, 3}, Wenjie Liu^{1, 2, 3}, Alex Xiangyang Liu⁴, Baoyu Zheng⁵

Journal of Quantum Computing, Vol.1, No.2, pp. 111-118, 2019, DOI:10.32604/jqc.2019.07412

Abstract Suppose a practical scene that when two or more parties want to schedule an appointment, they need to share their calendars with each other in order to make it possible. According to the present result the whole communication cost to solve this problem should be their calendars’ length by using a classical algorithm. In this work, we investigate the appointment schedule issue made by N users and try to accomplish it in quantum information case. Our study shows that the total communication cost will be quadratic times smaller than the conventional case if we apply More >