Pith. sign in

REVIEW 2 cited by

How Much Entanglement Does a Quantum Code Need?

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 2207.05647 v2 pith:JKYR3U4R submitted 2022-07-12 quant-ph cs.ITmath.IT

classification quant-phcs.ITmath.IT
keywords entanglementcodesquantumbettereaqeccserrorhandlingparameters
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In the setting of entanglement-assisted quantum error-correcting codes (EAQECCs), the sender and the receiver have access to pre-shared entanglement. Such codes promise better information rates or improved error handling properties. Entanglement incurs costs and must be judiciously calibrated in designing quantum codes with good performance, relative to their deployment parameters. Revisiting known constructions, we devise tools from classical coding theory to better understand how the amount of entanglement can be varied. We present three new propagation rules and discuss how each of them affects the error handling. Tables listing the parameters of the best performing qubit and qutrit EAQECCs that we can explicitly construct are supplied for reference and comparison.

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. Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability

    cs.IT 2026-08 conditional novelty 6.0 of 10

    Entanglement-assisted quantum locally recoverable codes can be constructed from arbitrary classical LRC pairs, and this paper proves bounds, optimality conditions, and explicit constructions for them.

  2. Geometry of the symplectic group and optimal EAQECC codes

    quant-ph 2025-01 reject novelty 5.0 of 10

    EAQECC parameters are translated into additive-code terms and several families of single-logical-qubit EAQECCs are claimed to saturate the EA-Singleton bound.

Pith tools