{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5ZJGRUISM5AZS2YVRXQKIOJSLQ","short_pith_number":"pith:5ZJGRUIS","schema_version":"1.0","canonical_sha256":"ee5268d1126741996b158de0a439325c0106190bfa17adcf14a6b19111587817","source":{"kind":"arxiv","id":"2211.03625","version":2},"attestation_state":"computed","paper":{"title":"Homomorphic Logical Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shilin Huang, Theodore J. Yoder, Tomas Jochym-O'Connor","submitted_at":"2022-11-07T15:30:55Z","abstract_excerpt":"Shor and Steane ancilla are two well-known methods for fault-tolerant logical measurements, which are successful on small codes and their concatenations. On large quantum low-density-parity-check (LDPC) codes, however, Shor and Steane measurements have impractical time and space overhead respectively. In this work, we widen the choice of ancilla codes by unifying Shor and Steane measurements into a single framework, called homomorphic measurements. For any Calderbank-Shor-Steane (CSS) code with the appropriate ancilla code, one can avoid repetitive measurements or complicated ancilla state pre"},"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":"2211.03625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-11-07T15:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"14c1f9478521a29b343d7564baada1c611ec0dadd00399dc5bb2a425ef10a508","abstract_canon_sha256":"c65fa77135bb3169be2be2e95867dd11355685b66c8dd1c4544dc673b9644e5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:58.769725Z","signature_b64":"BdYWuPO67PfdN7g//C8AsHxcWtzTYaZLxZoLG4BRHXB1bVPFLTH+7F5IxOr6MshKchuftCrOj3Lfi6WKNd90AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee5268d1126741996b158de0a439325c0106190bfa17adcf14a6b19111587817","last_reissued_at":"2026-07-05T05:13:58.769293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:58.769293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homomorphic Logical Measurements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Shilin Huang, Theodore J. Yoder, Tomas Jochym-O'Connor","submitted_at":"2022-11-07T15:30:55Z","abstract_excerpt":"Shor and Steane ancilla are two well-known methods for fault-tolerant logical measurements, which are successful on small codes and their concatenations. On large quantum low-density-parity-check (LDPC) codes, however, Shor and Steane measurements have impractical time and space overhead respectively. In this work, we widen the choice of ancilla codes by unifying Shor and Steane measurements into a single framework, called homomorphic measurements. For any Calderbank-Shor-Steane (CSS) code with the appropriate ancilla code, one can avoid repetitive measurements or complicated ancilla state pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.03625","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/2211.03625/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":"2211.03625","created_at":"2026-07-05T05:13:58.769356+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.03625v2","created_at":"2026-07-05T05:13:58.769356+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.03625","created_at":"2026-07-05T05:13:58.769356+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZJGRUISM5AZ","created_at":"2026-07-05T05:13:58.769356+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZJGRUISM5AZS2YV","created_at":"2026-07-05T05:13:58.769356+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZJGRUIS","created_at":"2026-07-05T05:13:58.769356+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.28627","citing_title":"Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ZJGRUISM5AZS2YVRXQKIOJSLQ","json":"https://pith.science/pith/5ZJGRUISM5AZS2YVRXQKIOJSLQ.json","graph_json":"https://pith.science/api/pith-number/5ZJGRUISM5AZS2YVRXQKIOJSLQ/graph.json","events_json":"https://pith.science/api/pith-number/5ZJGRUISM5AZS2YVRXQKIOJSLQ/events.json","paper":"https://pith.science/paper/5ZJGRUIS"},"agent_actions":{"view_html":"https://pith.science/pith/5ZJGRUISM5AZS2YVRXQKIOJSLQ","download_json":"https://pith.science/pith/5ZJGRUISM5AZS2YVRXQKIOJSLQ.json","view_paper":"https://pith.science/paper/5ZJGRUIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.03625&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZJGRUISM5AZS2YVRXQKIOJSLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZJGRUISM5AZS2YVRXQKIOJSLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZJGRUISM5AZS2YVRXQKIOJSLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZJGRUISM5AZS2YVRXQKIOJSLQ/action/storage_attestation","attest_author":"https://pith.science/pith/5ZJGRUISM5AZS2YVRXQKIOJSLQ/action/author_attestation","sign_citation":"https://pith.science/pith/5ZJGRUISM5AZS2YVRXQKIOJSLQ/action/citation_signature","submit_replication":"https://pith.science/pith/5ZJGRUISM5AZS2YVRXQKIOJSLQ/action/replication_record"}},"created_at":"2026-07-05T05:13:58.769356+00:00","updated_at":"2026-07-05T05:13:58.769356+00:00"}