Pith. sign in

REVIEW 1 cited by

Improved quantum capacity bounds of Gaussian loss channels and achievable rates with Gottesman-Kitaev-Preskill codes

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 1801.07271 v2 pith:OUUOR5L4 submitted 2018-01-22 quant-ph

classification quant-ph
keywords channelscodesgaussianlosscapacityimprovedoptimizationquantum
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Gaussian loss channels are of particular importance since they model realistic optical communication channels. Except for special cases, quantum capacity of Gaussian loss channels is not yet known completely. In this paper, we provide improved upper bounds of Gaussian loss channel capacity, both in the energy-constrained and unconstrained scenarios. We briefly review the Gottesman-Kitaev-Preskill (GKP) codes and discuss their experimental implementation. We then prove, in the energy-unconstrained case, that the GKP codes achieve the quantum capacity of Gaussian loss channels up to at most a constant gap from the improved upper bound. In the energy-constrained case, we formulate a biconvex encoding and decoding optimization problem to maximize the entanglement fidelity. The biconvex optimization is solved by an alternating semidefinite programming (SDP) method and we report that, starting from random initial codes, our numerical optimization yields GKP codes as the optimal encoding in a practically relevant regime.

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

  1. Optimized four-qubit quantum error correcting code for amplitude damping channel

    quant-ph 2024-11 conditional novelty 5.0 of 10

    A gamma-adapted four-qubit code found by biconvex optimization outperforms the standard Leung-Nielsen-Chuang-Yamamoto code against amplitude damping, with analytical recovery achieving Fent = 1 - 1.85 gamma^2.

Pith tools