Pith. sign in

REVIEW 1 cited by

Entanglement-assisted capacity of constrained quantum channel

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 quant-ph/0211170 v2 pith:PRXBPZ2E submitted 2002-11-26 quant-ph

Entanglement-assisted capacity of constrained quantum channel

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

In this paper we fill the gap in previous works by proving the formula for entanglement-assisted capacity of quantum channel with additive constraint (such as bosonic Gaussian channel). The main tools are the coding theorem for classical-quantum constrained channels and a finite dimensional approximation of the input density operators for entanglement-assisted capacity. The new version contains improved formulation of sufficient conditions under which suprema in the capacity formulas are attained.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Semidefinite optimization of the quantum relative entropy of channels

    quant-ph 2024-10 unverdicted novelty 6.0

    Semidefinite optimization yields arbitrarily tight upper and lower bounds on the quantum relative entropy of channels via discretized linearization of an integral representation.