Pith. sign in

REVIEW 2 cited by

Accessible information of a general quantum Gaussian ensemble

Not yet reviewed by Pith; the record is open.

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 2102.01981 v3 pith:VBJ6BYBE submitted 2021-02-03 quant-ph

classification quant-ph
keywords gaussianinformationquantumaccessibleensemblegeneralbasicbosonic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Accessible information, which is a basic quantity in quantum information theory, is computed for a general quantum Gaussian ensemble under certain "threshold condition". It is shown that the maximizing measurement is Gaussian, constituting a far-reaching generalization of the optical heterodyning. This substantially extends the previous result concerning the gauge-invariant case, even for a single bosonic mode.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Near-optimal performance of square-root measurement for general score functions and quantum ensembles

    quant-ph 2025-05 accept novelty 7.0 of 10

    For any quantum ensemble and any positive score function, the optimal expected gain is no larger than the square root of the gain of the generalized pretty good measurement, implying a two-fold mean-square-error bound...

  2. Upper bounds on the Holevo quantity arising from the fundamental entropic inequality

    quant-ph 2025-06 conditional novelty 5.0 of 10

    A general inequality bounds the Holevo quantity of any quantum ensemble by a combination of the Holevo quantities of two auxiliary ensembles plus a mean binary entropy term, yielding simple distance-based upper bounds.

Pith tools