K. Sudharson^1,*, S. Arun²

Intelligent Automation & Soft Computing, Vol.34, No.3, pp. 1769-1784, 2022, DOI:10.32604/iasc.2022.026483

Abstract Quantum Computing (QC). The content of node or sink nodes is processed using the fundamental principles of quantum mechanics. However, cryptography techniques face several other issues, such as availability, integrity, and vulnerability, to name a few. The researchers have overcome many obstacles, yet security remains a crucial concern in QC. However, experimenters recently discovered that the QC has a lot more data hacking than static networks. Moreover, the bitwise error is still present in implementing the Quantum Computing Cryptography Protocol (QCCP). Because all nodes are mobile and dynamic topology occurs, the proposed research uses the Quantum Elliptical Curve Cryptography (QECC)… More >

Hanan Abdullah Mengash¹, Radwa Marzouk¹, Siwar Ben Haj Hassine², Anwer Mustafa Hilal^3,*, Ishfaq Yaseen³, Abdelwahed Motwakel³

CMC-Computers, Materials & Continua, Vol.73, No.1, pp. 327-342, 2022, DOI:10.32604/cmc.2022.026464

Abstract Artificial intelligence (AI) techniques have received significant attention among research communities in the field of networking, image processing, natural language processing, robotics, etc. At the same time, a major problem in wireless sensor networks (WSN) is node localization, which aims to identify the exact position of the sensor nodes (SN) using the known position of several anchor nodes. WSN comprises a massive number of SNs and records the position of the nodes, which becomes a tedious process. Besides, the SNs might be subjected to node mobility and the position alters with time. So, a precise node localization (NL) manner is… More >

Saasha Joshi^*, Deepti Gupta

Journal of Quantum Computing, Vol.3, No.4, pp. 137-150, 2021, DOI:10.32604/jqc.2021.018114

Abstract This paper provides an introduction to a quantum search algorithm, known as Grover’s Algorithm, for unsorted search purposes. The algorithm is implemented in a search space of 4 qubits using the Python-based Qiskit SDK by IBM. While providing detailed proof, the computational complexity of the algorithm is generalized to n qubits. The implementation results obtained from the IBM QASM Simulator and IBMQ Santiago quantum backend are analyzed and compared. Finally, the paper discusses the challenges faced in implementation and real-life applications of the algorithm hitherto. Overall, the implementation and analysis depict the advantages of this quantum search algorithm over its… 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

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. In the second, the solution… More >

Hashem Alyami¹, Mohd Nadeem², Wael Alosaimi³, Abdullah Alharbi³, Rajeev Kumar^4,*, Bineet Kumar Gupta⁴, Alka Agrawal², Raees Ahmad Khan²

Intelligent Automation & Soft Computing, Vol.31, No.2, pp. 707-716, 2022, DOI:10.32604/iasc.2022.020780

Abstract Software or web application security is the main objective in the era of Information Technology (IT) and Artificial Intelligence (AI). Distinguishing proof of security at the initial stage produces significant results to comprehend the administration of security relics for best potential outcomes. A security alternative gives several methods and algorithms to ensure the software security. Security estimation is the vital factor in assessing, administrating, controlling security to improve the nature of security. It is to be realized that assessment of security at early stage of development helps in identifying distinctive worms, dangers, weaknesses and threats. This paper will talk about… More >

Yi-Ming Huang¹, Xiao-Yu Li^1,*, Yi-Xuan Zhu¹, Hang Lei¹, Qing-Sheng Zhu², Shan Yang³

CMC-Computers, Materials & Continua, Vol.68, No.1, pp. 789-803, 2021, DOI:10.32604/cmc.2021.016663

Abstract Quantum machine learning (QML) is a rapidly rising research field that incorporates ideas from quantum computing and machine learning to develop emerging tools for scientific research and improving data processing. How to efficiently control or manipulate the quantum system is a fundamental and vexing problem in quantum computing. It can be described as learning or approximating a unitary operator. Since the success of the hybrid-based quantum machine learning model proposed in recent years, we investigate to apply the techniques from QML to tackle this problem. Based on the Choi–Jamiołkowski isomorphism in quantum computing, we transfer the original problem of learning… More >

Saptarshi Sahoo^1,*, Amit Kumar Mandal¹, Pijus Kanti Samanta², Indranil Basu¹, Pratik Roy¹

Journal of Quantum Computing, Vol.2, No.4, pp. 181-192, 2020, DOI:10.32604/jqc.2020.015688

Abstract Quantum Computing and Quantum Information Science seem very promising and developing rapidly since its inception in early 1980s by Paul Benioff with the proposal of quantum mechanical model of the Turing machine and later By Richard Feynman and Yuri Manin for the proposal of a quantum computers for simulating various problems that classical computer could not. Quantum computers have a computational advantage for some problems, over classical computers and most applications are trying to use an efficient combination of classical and quantum computers like Shor’s factoring algorithm. Other areas that are expected to be benefitted from quantum computing are Machine… More >

Giuseppe Corrente^*

Journal of Quantum Computing, Vol.2, No.3, pp. 137-145, 2020, DOI:10.32604/jqc.2020.014586

Abstract We want in this article to show the usefulness of Quantum Turing Machine (QTM) in a high-level didactic context as well as in theoretical studies. We use QTM to show its equivalence with quantum circuit model for Deutsch and Deutsch-Jozsa algorithms. Further we introduce a strategy of translation from Quantum Circuit to Quantum Turing models by these examples. Moreover we illustrate some features of Quantum Computing such as superposition from a QTM point of view and starting with few simple examples very known in Quantum Circuit form. More >

Kejia Zhang^{1, 2, 3, 4}, Chunguang Ma⁵, Zhiwei Sun^{4, 6, *}, Xue Zhang^{2, 3}, Baomin Zhou², Yukun Wang⁷

CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1915-1928, 2020, DOI:10.32604/cmc.2020.09836

Abstract Oblivious key transfer (OKT) is a fundamental problem in the field of secure multi-party computation. It makes the provider send a secret key sequence to the user obliviously, i.e., the user may only get almost one bit key in the sequence which is unknown to the provider. Recently, a number of works have sought to establish the corresponding quantum oblivious key transfer model and rename it as quantum oblivious key distribution (QOKD) from the well-known expression of quantum key distribution (QKD). In this paper, a new QOKD model is firstly proposed for the provider and user with limited quantum capabilities,… More >