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
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.
Forward citations
Cited by 2 Pith papers
-
Entanglement-Assisted Quantum Locally Recoverable Codes: Bounds, Optimal Constructions, and Achievability
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.
-
Geometry of the symplectic group and optimal EAQECC codes
EAQECC parameters are translated into additive-code terms and several families of single-logical-qubit EAQECCs are claimed to saturate the EA-Singleton bound.
Discussion (0). Continue with ORCID to comment.