Lecture 21 : HSP via the Pretty Good Measurement
نویسنده
چکیده
Since our success probability dependents on the probabilities p1, . . . , pn, we call this problem the Average-Case Model. We desire to select the optimal POVM (E1, . . . , Em) so that our probability of success is maximized. Since it is difficult in general to compute the optimal POVM, we use an accurate, elegant approximation, the Pretty Good Measurement (PGM). To compute analyze the success probability of the PGM, we need to understand the fidelity of a pair of mixed states.
منابع مشابه
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that the pretty good measurement is optimal and that its probability of success and unitary implementation are closely related to an average-case algebraic problem...
متن کاملEfficient Quantum Algorithm for the Hidden Parabola Problem
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of the abelian Hidden Subgroup Problem (HSP) over groups of the form Zp × Zp, where the hidden subgroups are generated by (1, a) for different a ∈ Zp. These subgroups and their cosets correspond to graphs of linear functions on Zp. For the Hidden Polynomial Function Graph Problem the functions are not restrict...
متن کاملFamily of generalized “pretty good” measurements and the minimal-error pure-state discrimination problems for which they are optimal
Given a quantum pure state chosen from a set with some a priori probabilities, what is the optimal measurement needed to correctly guess the given state? We show that a good choice is the family of square-root or “pretty good” measurements, as each measurement in the family is optimal for at least one discrimination problem with the same quantum states but possibly different a priori probabilit...
متن کاملLecture 2: Proofs
All of you must have proved lot of mathematical statements by now and have pretty good intuition about what proofs are. So we will take an informal approach of proofs. The ideas of rigorous and correct mathematical proofs will be shown through examples. A more formal approach can be taken through logic, a brief introduction to logic is given at the end of these course notes and is meant as an a...
متن کاملBetter bounds on optimal measurement and entanglement recovery, with applications to uncertainty and monogamy relations
We extend the recent bounds of Sason and Verdú relating Rényi entropy and Bayesian hypothesis testing [arXiv:1701.01974] to the quantum domain and show that they have a number of different applications. First, we obtain a sharper bound relating the optimal probability of correctly distinguishing elements of an ensemble of states to that of the pretty good measurement, and an analogous bound for...
متن کامل