Gérard Fleury, Philippe Lacomme^*

Journal of Quantum Computing, Vol.4, No.2, pp. 97-111, 2022, DOI:10.32604/jqc.2022.032973

Abstract The objective of this paper concerns at first the motivation and the method of Shor’s algorithm including remarks on quantum computing introducing an algorithmic description of the method. The corner stone of the Shor’s algorithm is the modular exponentiation that is the most computational component (in time and space). A linear depth unit based on phase estimation is introduced and a description of a generic version of a modular multiplier based on phases is introduced to build block of a gates to efficient modular exponentiation circuit. Our proposal includes numerical experiments achieved on both the IBM simulator using the Qiskit… 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

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 novel multi-party phase estimation algorithm… More >