دسته بندی:

محاسبات کوانتومی - Quantum-Computing

---

سال انتشار:

2022

---

عنوان انگلیسی مقاله:

Quantum Algorithm for Fidelity Estimation

---

ترجمه فارسی عنوان مقاله:

الگوریتم کوانتومی برای برآورد وفاداری

---

منبع:

ieee - ieee Transactions on Information Theory;2022;PP;99;10:1109/TIT:2022:3203985

---

نویسنده:

Qisheng Wang; Zhicheng Zhang; Kean Chen; Ji Guan; Wang Fang; Junyi Liu; Mingsheng Ying

---

چکیده انگلیسی:

For two unknown mixed quantum states ρ and σ in an N-dimensional Hilbert space, computing their fidelity F (ρ, σ) is a basic problem with many important applications in quantum computing and quantum information, for example verification and characterization of the outputs of a quantum computer, and design and analysis of quantum algorithms. In this paper, we propose a quantum algorithm that solves this problem in poly(log(N ), r, 1/ε) time, where r is the lower rank of ρ and σ, and ε is the desired precision, provided that the purifications of ρ and σ are prepared by quantum oracles. This algorithm exhibits an exponential speedup over the best known algorithm (based on quantum state tomography) which has time complexity polynomial in N.
keywords: Quantum computing | quantum algorithms | quantum fidelity | quantum states.

---

---

قیمت: رایگان

---

توضیحات اضافی:

---

---

---