How well can you know the edge of a quantum pyramid?

Berthold-Georg Englert; Jaroslav \v{R}eh\'a\v{c}ek

How well can you know the edge of a quantum pyramid?

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0905.0510 v1 pith:5MC7EUHA submitted 2009-05-04 quant-ph

Berthold-Georg Englert , Jaroslav Řeháček This is my paper · ORCID

classification quant-ph

keywords quantumarbitraryedgeextractinformationmeasurementprobabilitypyramid

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We consider a symmetric quantum communication scenario in which the signal states are edges of a quantum pyramid of arbitrary dimension and arbitrary shape, and all edge states are transmitted with the same probability. The receiver could employ different decoding strategies: he could minimize the error probability, or discriminate without ambiguity, or extract the accessible information. We state the optimal measurement scheme for each strategy. For large parameter ranges, the standard square-root measurement does not extract the information optimally.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Quantum accessible information and classical entropy inequalities
quant-ph 2025-06 conditional novelty 7.0 of 10

New parametric entropy inequalities are derived from an accessible-information optimality criterion, reducing the quantum-pyramid conjecture to proving these inequalities.

Pith tools