Some Bounds On The Minimum Number Of Queries Required For Quantum Channel Perfect Discrimination

Publisher:
Rinton Press, Inc
Publication Type:
Journal Article
Citation:
Quantum Information and Computation, 2012, 12 (1-2), pp. 138 - 148
Issue Date:
2012-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011005488OK.pdf169.37 kB
Adobe PDF
We prove a lower bound on the q-maximal fidelities between two quantum channels epsilon(0) and epsilon(1) and an upper bound on the q-maximal fidelities between a quantum channel epsilon and an identity tau. Then we apply these two bounds to provide a si
Please use this identifier to cite or link to this item: