Analytical fully adaptive GLOCC bound

Derive an analytical bound for fully adaptive Gaussian local operations and classical communication (GLOCC) in the non-destructive discrimination of two-mode squeezed vacuum states.

Background

The paper derives an analytical success-probability–fidelity tradeoff for one-stage local Gaussian operations and classical communication (GLOCC₁), while the corresponding optimization over fully adaptive GLOCC protocols is not analytically established. A general analytical derivation would extend the paper’s one-stage bound to arbitrary numbers of adaptive stages and clarify the ultimate performance of fully adaptive Gaussian protocols.