New Quantum Algorithms for Computing Quantum Entropies and Distances
IEEE Transactions on Information Theory · 2024-08 · 70 (8) · 5653-5680
DOI: 10.1109/tit.2024.3399014 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2024-08. Verfasst von Qisheng Wang und 4 weiteren Autor:innen. Die Arbeit wurde bisher 39-mal zitiert (Crossref) und nennt 106 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Ministry of Education, Culture, Sports, Science and Technology (MEXT) Quantum Leap Flagship Program, Youth Innovation Promotion Association, Chinese Academy of Sciences, Key Research Program of the Chinese Academy of Sciences.
Abstract (Originalsprache)
We propose a series of quantum algorithms for computing a wide range of quantum entropies and distances, including the von Neumann entropy, quantum Rényi entropy, trace distance, and fidelity. The proposed algorithms significantly outperform the prior best (and even quantum) ones in the low-rank case, some of which achieve exponential speedups. In particular, for N-dimensional quantum states of rank r, our proposed quantum algorithms for computing the von Neumann entropy, trace distance and fidelity within additive error $\varepsilon $ have time complexity of $\tilde {O}(r/\varepsilon ^{2})$ , $\tilde {O}(r^{5}/\varepsilon ^{6})$ and $\tilde {O}(r^{6.5}/\varepsilon ^{7.5})$ , respectively. By contrast, prior quantum algorithms for the von Neumann entropy and trace distance usually have time complexity $\Omega (N)$ , and the prior best one for fidelity has time complexity $\tilde {O}(r^{12.5}/\varepsilon ^{13.5})$ . The key idea of our quantum algorithms is to extend block-encoding from unitary operators in previous work to quantum states (i.e., density operators). It is realized by developing several convenient techniques to manipulate quantum states and extract information from them. The advantage of our techniques over the existing methods is that no restrictions on density operators are required; in sharp contrast, the previous methods usually require a lower bound on the minimal non-zero eigenvalue of density operators.
Förderung
- Ministry of Education, Culture, Sports, Science and Technology (MEXT) Quantum Leap Flagship Program
- Youth Innovation Promotion Association, Chinese Academy of Sciences
- Key Research Program of the Chinese Academy of Sciences
- Sydney Quantum Academy, Sydney, NSW, Australia
Zitieren
APA
Wang, Q., Guan, J., Liu, J., Zhang, Z., & Ying, M. (2024). New Quantum Algorithms for Computing Quantum Entropies and Distances. IEEE Transactions on Information Theory, 70(8), 5653-5680. https://doi.org/10.1109/tit.2024.3399014
Vancouver
Wang Q, Guan J, Liu J, Zhang Z, Ying M. New Quantum Algorithms for Computing Quantum Entropies and Distances. IEEE Transactions on Information Theory. 2024;70(8):5653-5680. doi:10.1109/tit.2024.3399014
BibTeX
@article{Wang2024,
author = {Wang, Qisheng and Guan, Ji and Liu, Junyi and Zhang, Zhicheng and Ying, Mingsheng},
title = {New Quantum Algorithms for Computing Quantum Entropies and Distances},
journal = {IEEE Transactions on Information Theory},
year = {2024},
volume = {70},
number = {8},
pages = {5653--5680},
doi = {10.1109/tit.2024.3399014}
}
EUVIMED