Zhiqi Liu¹, Shihui Zheng¹, Xingyu Yan¹, Ping Pan^1,2, Licheng Wang^1,3,*

Journal of Quantum Computing, Vol.5, pp. 41-54, 2023, DOI:10.32604/jqc.2023.045572

Abstract The hardness of the integer factoring problem (IFP) plays a core role in the security of RSA-like cryptosystems that are widely used today. Besides Shor’s quantum algorithm that can solve IFP within polynomial time, quantum annealing algorithms (QAA) also manifest certain advantages in factoring integers. In experimental aspects, the reported integers that were successfully factored by using the D-wave QAA platform are much larger than those being factored by using Shor-like quantum algorithms. In this paper, we report some interesting observations about the effects of QAA for solving IFP. More specifically, we introduce a metric, called T-factor that measures the… More >

Seth Aishwarya¹, Vaishnav Abeer^1,*, Babu B. Sathish¹, K. N. Subramanya²

Journal of Quantum Computing, Vol.2, No.4, pp. 157-170, 2020, DOI:10.32604/jqc.2020.015018

Abstract The utilization of quantum states for the representation of information and the advances in machine learning is considered as an efficient way of modeling the working of complex systems. The states of mind or judgment outcomes are highly complex phenomena that happen inside the human body. Decoding these states is significant for improving the quality of technology and providing an impetus to scientific research aimed at understanding the functioning of the human mind. One of the key advantages of quantum wave-functions over conventional classical models is the existence of configurable hidden variables, which provide more data density due to its… More >