تقرير
The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization
| العنوان: | The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization |
|---|---|
| المؤلفون: | Jafarizadeh, M. A., Mazhari, Y., Aali, M. |
| المصدر: | Quantum Inf Process (2011) 10: 155 |
| سنة النشر: | 2009 |
| المجموعة: | Quantum Physics |
| مصطلحات موضوعية: | Quantum Physics |
| الوصف: | Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum states. The given examples which use our method include: 1. Diagonal N mixed states; 2. N equiprobable states and equidistant from center of the Bloch ball which their corresponding Bloch vectors are inclined at the equal angle from z axis; 3. Three mirror-symmetric states; 4. States that have been prepared with equal prior probabilities on vertices of a Platonic solid. Keywords: minimum-error discrimination, success probability, measurement, POVM elements, Helstrom family of ensembles, convex optimization, conjugate states PACS Nos: 03.67.Hk, 03.65.Ta Comment: 15 pages |
| نوع الوثيقة: | Working Paper |
| DOI: | 10.1007/s11128-010-0185-y |
| URL الوصول: | http://arxiv.org/abs/0910.5415 |
| رقم الأكسشن: | edsarx.0910.5415 |
| قاعدة البيانات: | arXiv |
| DOI: | 10.1007/s11128-010-0185-y |
|---|