Coherence Depletion in Quantum Algorithms
AbstractBesides the superior efficiency compared to their classical counterparts, quantum algorithms known so far are basically task-dependent, and scarcely any common features are shared between them. In this work, however, we show that the depletion of quantum coherence turns out to be a common phenomenon in these algorithms. For all the quantum algorithms that we investigated, including Grover’s algorithm, Deutsch–Jozsa algorithm, and Shor’s algorithm, quantum coherence of the system states reduces to the minimum along with the successful execution of the respective processes. Notably, a similar conclusion cannot be drawn using other quantitative measures such as quantum entanglement. Thus, we expect that coherence depletion as a common feature can be useful for devising new quantum algorithms in the future. View Full-Text
Share & Cite This Article
Liu, Y.-C.; Shang, J.; Zhang, X. Coherence Depletion in Quantum Algorithms. Entropy 2019, 21, 260.
Liu Y-C, Shang J, Zhang X. Coherence Depletion in Quantum Algorithms. Entropy. 2019; 21(3):260.Chicago/Turabian Style
Liu, Ye-Chao; Shang, Jiangwei; Zhang, Xiangdong. 2019. "Coherence Depletion in Quantum Algorithms." Entropy 21, no. 3: 260.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.