Pith. sign in

REVIEW 1 cited by

Correction of circuit faults in a stacked quantum memory using rank-metric 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 2411.09173 v1 pith:HNL3UWSH submitted 2024-11-14 quant-ph cs.ITmath.IT

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

We introduce a model for a stacked quantum memory made with multi-qubit cells, inspired by multi-level flash cells in classical solid-state drive, and we design quantum error correction codes for this model by generalizing rank-metric codes to the quantum setting. Rank-metric codes are used to correct faulty links in classical communication networks. We propose a quantum generalization of Gabidulin codes, which is one of the most popular family of rank-metric codes, and we design a protocol to correct faults in Clifford circuits applied to a stacked quantum memory based on these codes. We envision potential applications to the optimization of stabilizer states and magic states factories, and to variational quantum algorithms. Further work is needed to make this protocol practical. It requires a hardware platform capable of hosting multi-qubit cells with low crosstalk between cells, a fault-tolerant syndrome extraction circuit for rank-metric codes and an associated efficient decoder.

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. Entanglement Cost of Erasure Correction in Quantum MDS Codes

    quant-ph 2025-05 conditional novelty 6.0 of 10

    For an [[n,2t-n]]_Q quantum MDS code, correcting a single erased node over a star network costs exactly 2t qudits when the replacement node is the hub and 2t minus 1 qudits when a helper node is the hub.

Pith tools