Quantum computation and quantum information
Quantum computation and quantum information
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Quantum Information & Computation
Hi-index | 0.00 |
This paper explores the role of a priori knowledge in the optimization of quantum information processing by investigating optimum unambiguous discrimination problems for both the qubit and qutrit states. In general, a priori knowledge in optimum unambiguous discrimination problems can be classed into two types: a priori knowledge of discriminated states themselves and a priori probabilities of preparing the states. It is clarified that whether a priori probabilities of preparing discriminated states are available or not, what type of discriminators one should design just depends on what kind of the classical knowledge of discriminated states. This is in contrast to the observation that choosing the parameters of discriminators not only relies on the a priori knowledge of discriminated states, but also depends on a priori probabilities of preparing the states. Two types of a priori knowledge can be utilized to improve optimum performance but play the different roles in the optimization from the view point of decision theory.