Year: 2020
Type: conference-paper
Abstract: Quantum algorithms are well known for their higher efficiency compared to their classical counterparts.However, the origin of the speed-up offered by quantum algorithms is a debatable question.Using entanglement measure based on coefficient matrix, we investigate the entanglement features of the quantum states used in Shor's factoring algorithm.The results show that if and only if the order r is 1, the algorithm generates no entanglement.Finally, compare with published studies results (Proceedings: Mathematical, Physical and Engineering Sciences, 459(2036): 2011-2032, 2003, Physical Review A, 72(6): 062308, 2005), we give counter examples to show that previous researches neglect partially entanglement.
Authors: Jianing Tan, Zhihao Liu, Hanwu Chen
Institution: Southeast University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Funders: National Natural Science Foundation of China, Government of Jiangsu Province, Natural Science Foundation of Jiangsu Province, Southeast University, Natural Science Foundation of Anhui Province, Key Laboratory of Computer Network and Information Integration, Specialized Research Fund for the Doctoral Program of Higher Education of China
OpenAlex ID: W3015476404
