{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HNL3UWSHL27ORCBWSGR23UGQTN","short_pith_number":"pith:HNL3UWSH","schema_version":"1.0","canonical_sha256":"3b57ba5a475ebee8883691a3add0d09b6380d8e3b2d8690b9d957fc3a1759d84","source":{"kind":"arxiv","id":"2411.09173","version":1},"attestation_state":"computed","paper":{"title":"Correction of circuit faults in a stacked quantum memory using rank-metric codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Gilles Z\\'emor, Nicolas Delfosse","submitted_at":"2024-11-14T04:19:40Z","abstract_excerpt":"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 envi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.09173","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-14T04:19:40Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cef3e01207b18e78272cf6f16afb640cb546d607d8add4ccade00dc335c01486","abstract_canon_sha256":"fc79792bb781b866d58a17d258cf347ffe5b477d7e4b7b4cdc4173b8a2f5dbd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:21.881864Z","signature_b64":"KFiffyyNgP71HLXZiEStVfWpunvRVMZRN1DeW7//uMrUt27AHCxm8oGFHyWPYJ+8Q7qJoFlDh+vsKxKgfJxMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b57ba5a475ebee8883691a3add0d09b6380d8e3b2d8690b9d957fc3a1759d84","last_reissued_at":"2026-07-05T09:35:21.881398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:21.881398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correction of circuit faults in a stacked quantum memory using rank-metric codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Gilles Z\\'emor, Nicolas Delfosse","submitted_at":"2024-11-14T04:19:40Z","abstract_excerpt":"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 envi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.09173","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.09173/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.09173","created_at":"2026-07-05T09:35:21.881460+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.09173v1","created_at":"2026-07-05T09:35:21.881460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.09173","created_at":"2026-07-05T09:35:21.881460+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNL3UWSHL27O","created_at":"2026-07-05T09:35:21.881460+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNL3UWSHL27ORCBW","created_at":"2026-07-05T09:35:21.881460+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNL3UWSH","created_at":"2026-07-05T09:35:21.881460+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20109","citing_title":"Hermitian hull-variation of vector rank-metric codes and self-orthogonal generalized Gabidulin codes","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02571","citing_title":"Construction of Quantum Rank-Metric Codes Using Hermitian Orthogonality","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HNL3UWSHL27ORCBWSGR23UGQTN","json":"https://pith.science/pith/HNL3UWSHL27ORCBWSGR23UGQTN.json","graph_json":"https://pith.science/api/pith-number/HNL3UWSHL27ORCBWSGR23UGQTN/graph.json","events_json":"https://pith.science/api/pith-number/HNL3UWSHL27ORCBWSGR23UGQTN/events.json","paper":"https://pith.science/paper/HNL3UWSH"},"agent_actions":{"view_html":"https://pith.science/pith/HNL3UWSHL27ORCBWSGR23UGQTN","download_json":"https://pith.science/pith/HNL3UWSHL27ORCBWSGR23UGQTN.json","view_paper":"https://pith.science/paper/HNL3UWSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.09173&json=true","fetch_graph":"https://pith.science/api/pith-number/HNL3UWSHL27ORCBWSGR23UGQTN/graph.json","fetch_events":"https://pith.science/api/pith-number/HNL3UWSHL27ORCBWSGR23UGQTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNL3UWSHL27ORCBWSGR23UGQTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNL3UWSHL27ORCBWSGR23UGQTN/action/storage_attestation","attest_author":"https://pith.science/pith/HNL3UWSHL27ORCBWSGR23UGQTN/action/author_attestation","sign_citation":"https://pith.science/pith/HNL3UWSHL27ORCBWSGR23UGQTN/action/citation_signature","submit_replication":"https://pith.science/pith/HNL3UWSHL27ORCBWSGR23UGQTN/action/replication_record"}},"created_at":"2026-07-05T09:35:21.881460+00:00","updated_at":"2026-07-05T09:35:21.881460+00:00"}