Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

De Gruyter eBooks

11 Optimal and pretty good receivers

Joseph M. Renes

Published Jul 18, 2022• 0 citations
Publisher
DOI
10.1515/9783110570250-011

Related papers

For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets

MooreCristopher, RussellAlexander

Recently Bacon, Childs and van Dam showed that the pretty good measurement(PGM) is optimal for the Hidden Subgroup Problem on the dihedral group Dn in the casewhere the hidden subgroup is chosen ...

Quantum Information and Computation•Nov 1, 2007•0 citations

Selective Opening Security for Receivers

Carmit Hazay, Arpita Patra, Bogdan Warinschi

Lecture notes in computer science•Jan 1, 2015•39 citations

For distinguishing conjugate Hidden subgroups, the pretty good measurement is as good as it gets

Cristopher Moore, Alexander C. Russell

Recently Bacon, Childs and van Dam showed that the ``pretty good measurement'' (PGM) is optimal for the Hidden Subgroup Problem on the dihedral group $D_n$ in the case where the hidden subgroup is chosen uniformly from the $n$ involutions. We show that, for any group and any subgroup $H$, the PGM is the optimal one-register experiment in the case where the hidden subgroup is a uniformly random conjugate of $H$. We go on to show that when $H$ forms a Gel'fand pair with its parent group, the PGM is the optimal measurement for any number of registers. In both cases we bound the probability that the optimal measurement succeeds. This generalizes the case of the dihedral group, and includes a number of other examples of interest.

arXiv:quant-ph/0501177•Quantum Information and Computation•Nov 1, 2007•51 citations

A few good photons

Anonymous

Physics•Mar 2, 2011•0 citations

An Optimally Fair Coin Toss

Tal Moran, Moni Naor, Gil Segev

Lecture notes in computer science•Jan 1, 2009•88 citations

Pretty Good Measures in Quantum Information Theory

Raban Iten, Joseph M. Renes, David Sutter

Quantum generalizations of Rényi's entropies are a useful tool to describe a variety of operational tasks in quantum information processing. Two families of such generalizations turn out to be particularly useful: the Petz quantum Rényi divergence D̅αand the minimal quantum Rényi divergence D̃α. In this paper, we prove a reverse Araki-Lieb-Thirring inequality that implies a new relation between these two families of divergences, namely, αD̅α(Q∥σ) ≤ D̃α(Q∥σ) for α ∈[0,1] and where Q and σ are density operators. This bound suggests defining a ”pretty good fidelity,” whose relation to the usual fidelity implies the known relations between the optimal and pretty good measurement as well as the optimal and pretty good singlet fraction. We also find a new necessary and sufficient condition for optimality of the pretty good measurement and singlet fraction.

arXiv:1608.08229•IEEE Transactions on Information Theory•Dec 14, 2016•25 citations
Recently Bacon, Childs and van Dam showed that the ``pretty good measurement'' (PGM) is optimal for the Hidden Subgroup Problem on the dihedral group DnD_nDn​ in the case where the hidden subgroup is chosen uniformly from the nnn involutions. We show that, for any group and any subgroup HHH, the PGM is the optimal one-register experiment in the case where the hidden subgroup is a uniformly random conjugate of HHH. We go on to show that when HHH forms a Gel'fand pair with its parent group, the PGM is the optimal measurement for any number of registers. In both cases we bound the probability that the optimal measurement succeeds. This generalizes the case of the dihedral group, and includes a number of other examples of interest.
Quantum generalizations of Rényi's entropies are a useful tool to describe a variety of operational tasks in quantum information processing. Two families of such generalizations turn out to be particularly useful: the Petz quantum Rényi divergence D̅αand the minimal quantum Rényi divergence D̃α. In this paper, we prove a reverse Araki-Lieb-Thirring inequality that implies a new relation between these two families of divergences, namely, αD̅α(Q∥σ) ≤ D̃α(Q∥σ) for α ∈[0,1] and where Q and σ are density operators. This bound suggests defining a ”pretty good fidelity,” whose relation to the usual fidelity implies the known relations between the optimal and pretty good measurement as well as the optimal and pretty good singlet fraction. We also find a new necessary and sufficient condition for optimality of the pretty good measurement and singlet fraction.