{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SL6JVJXDSNFBK25USF7OKGV5RX","short_pith_number":"pith:SL6JVJXD","schema_version":"1.0","canonical_sha256":"92fc9aa6e3934a156bb4917ee51abd8df682e83b40de85a8fcbfcf3d03ff192c","source":{"kind":"arxiv","id":"2410.02753","version":2},"attestation_state":"computed","paper":{"title":"Fault-tolerant logical measurements via homological measurement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin Ide, Guillaume Dauphinais, Manoj G. Gowda, Priya J. Nadkarni","submitted_at":"2024-10-03T17:58:20Z","abstract_excerpt":"We introduce homological measurement, a framework for measuring the logical Pauli operators encoded in CSS stabilizer codes. The framework is based on the algebraic description of such codes as chain complexes. Protocols such as lattice surgery some of its recent generalizations are shown to be special cases of homological measurement. Using this framework, we develop a specific protocol called edge expanded homological measurement for fault-tolerant measurement of arbitrary logical Pauli operators of general qLDPC codes, requiring a number of ancillary qubits growing only linearly with the we"},"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":"2410.02753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-10-03T17:58:20Z","cross_cats_sorted":[],"title_canon_sha256":"c74b69e3904aa18bfd77fdb051eda7cd5296d3e8763a5ee8788d1e3f32288e4a","abstract_canon_sha256":"c975e9cb392537098a8ef25cd18c298c4c5bd4d986e2aee38379056ce6e87f99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:43.989168Z","signature_b64":"sk2QpIGES5obqLyK3ggcuTBgekwaakboz/jxk3qlp+cjmH6uiHXC8l3cZUoxbuTNvq9UqHuuEXWjcb1ZSdPGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92fc9aa6e3934a156bb4917ee51abd8df682e83b40de85a8fcbfcf3d03ff192c","last_reissued_at":"2026-07-05T11:34:43.988659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:43.988659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fault-tolerant logical measurements via homological measurement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin Ide, Guillaume Dauphinais, Manoj G. Gowda, Priya J. Nadkarni","submitted_at":"2024-10-03T17:58:20Z","abstract_excerpt":"We introduce homological measurement, a framework for measuring the logical Pauli operators encoded in CSS stabilizer codes. The framework is based on the algebraic description of such codes as chain complexes. Protocols such as lattice surgery some of its recent generalizations are shown to be special cases of homological measurement. Using this framework, we develop a specific protocol called edge expanded homological measurement for fault-tolerant measurement of arbitrary logical Pauli operators of general qLDPC codes, requiring a number of ancillary qubits growing only linearly with the we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02753","kind":"arxiv","version":2},"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/2410.02753/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":"2410.02753","created_at":"2026-07-05T11:34:43.988731+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.02753v2","created_at":"2026-07-05T11:34:43.988731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02753","created_at":"2026-07-05T11:34:43.988731+00:00"},{"alias_kind":"pith_short_12","alias_value":"SL6JVJXDSNFB","created_at":"2026-07-05T11:34:43.988731+00:00"},{"alias_kind":"pith_short_16","alias_value":"SL6JVJXDSNFBK25U","created_at":"2026-07-05T11:34:43.988731+00:00"},{"alias_kind":"pith_short_8","alias_value":"SL6JVJXD","created_at":"2026-07-05T11:34:43.988731+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23738","citing_title":"Optimizing Parallel Execution of Commuting Pauli Product Rotations","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2410.10194","citing_title":"Wire Codes","ref_index":68,"is_internal_anchor":false},{"citing_arxiv_id":"2508.10714","citing_title":"Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2603.28627","citing_title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SL6JVJXDSNFBK25USF7OKGV5RX","json":"https://pith.science/pith/SL6JVJXDSNFBK25USF7OKGV5RX.json","graph_json":"https://pith.science/api/pith-number/SL6JVJXDSNFBK25USF7OKGV5RX/graph.json","events_json":"https://pith.science/api/pith-number/SL6JVJXDSNFBK25USF7OKGV5RX/events.json","paper":"https://pith.science/paper/SL6JVJXD"},"agent_actions":{"view_html":"https://pith.science/pith/SL6JVJXDSNFBK25USF7OKGV5RX","download_json":"https://pith.science/pith/SL6JVJXDSNFBK25USF7OKGV5RX.json","view_paper":"https://pith.science/paper/SL6JVJXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.02753&json=true","fetch_graph":"https://pith.science/api/pith-number/SL6JVJXDSNFBK25USF7OKGV5RX/graph.json","fetch_events":"https://pith.science/api/pith-number/SL6JVJXDSNFBK25USF7OKGV5RX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SL6JVJXDSNFBK25USF7OKGV5RX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SL6JVJXDSNFBK25USF7OKGV5RX/action/storage_attestation","attest_author":"https://pith.science/pith/SL6JVJXDSNFBK25USF7OKGV5RX/action/author_attestation","sign_citation":"https://pith.science/pith/SL6JVJXDSNFBK25USF7OKGV5RX/action/citation_signature","submit_replication":"https://pith.science/pith/SL6JVJXDSNFBK25USF7OKGV5RX/action/replication_record"}},"created_at":"2026-07-05T11:34:43.988731+00:00","updated_at":"2026-07-05T11:34:43.988731+00:00"}