{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XVJ5MFUHXD3PWXZWFFROJJCS2H","short_pith_number":"pith:XVJ5MFUH","schema_version":"1.0","canonical_sha256":"bd53d61687b8f6fb5f362962e4a452d1ea868f383c6cb8750455564f8adf7ca4","source":{"kind":"arxiv","id":"2412.06744","version":3},"attestation_state":"computed","paper":{"title":"Families of $d=2$ 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel A. Lidar, Phattharaporn Singkanipa, Zihan Xia","submitted_at":"2024-12-09T18:36:38Z","abstract_excerpt":"In the absence of fault tolerant quantum error correction for analog, Hamiltonian quantum computation, error suppression via energy penalties is an effective alternative. We construct families of distance-$2$ stabilizer subsystem codes we call ``trapezoid codes'', that are tailored for energy-penalty schemes. We identify a family of codes achieving the maximum code rate, and by slightly relaxing this constraint, uncover a broader range of codes with enhanced physical locality, thus increasing their practical applicability. Additionally, we provide an algorithm to map the required qubit connect"},"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":"2412.06744","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-12-09T18:36:38Z","cross_cats_sorted":[],"title_canon_sha256":"cae28cd3874f78638e676608c75ab6113ae76e0b385e3df2b1b117e769d55ff6","abstract_canon_sha256":"6146ccee246a8ac6d211ff684842bede5e4fc216baf0ea54ac6bd41ff4f5f584"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:46.903953Z","signature_b64":"1G+hWLex0QFK0FgWjzdRVoiCUZggJSRZ3V34V+kSCu15UpzF3FYnnxyTn8DNfHF/Q8ownfd6WuLOUYAjLVJBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd53d61687b8f6fb5f362962e4a452d1ea868f383c6cb8750455564f8adf7ca4","last_reissued_at":"2026-07-05T11:48:46.903530Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:46.903530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Families of $d=2$ 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel A. Lidar, Phattharaporn Singkanipa, Zihan Xia","submitted_at":"2024-12-09T18:36:38Z","abstract_excerpt":"In the absence of fault tolerant quantum error correction for analog, Hamiltonian quantum computation, error suppression via energy penalties is an effective alternative. We construct families of distance-$2$ stabilizer subsystem codes we call ``trapezoid codes'', that are tailored for energy-penalty schemes. We identify a family of codes achieving the maximum code rate, and by slightly relaxing this constraint, uncover a broader range of codes with enhanced physical locality, thus increasing their practical applicability. Additionally, we provide an algorithm to map the required qubit connect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06744","kind":"arxiv","version":3},"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/2412.06744/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":"2412.06744","created_at":"2026-07-05T11:48:46.903582+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06744v3","created_at":"2026-07-05T11:48:46.903582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06744","created_at":"2026-07-05T11:48:46.903582+00:00"},{"alias_kind":"pith_short_12","alias_value":"XVJ5MFUHXD3P","created_at":"2026-07-05T11:48:46.903582+00:00"},{"alias_kind":"pith_short_16","alias_value":"XVJ5MFUHXD3PWXZW","created_at":"2026-07-05T11:48:46.903582+00:00"},{"alias_kind":"pith_short_8","alias_value":"XVJ5MFUH","created_at":"2026-07-05T11:48:46.903582+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.07764","citing_title":"Robust analog quantum simulators by quantum error-detecting codes","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XVJ5MFUHXD3PWXZWFFROJJCS2H","json":"https://pith.science/pith/XVJ5MFUHXD3PWXZWFFROJJCS2H.json","graph_json":"https://pith.science/api/pith-number/XVJ5MFUHXD3PWXZWFFROJJCS2H/graph.json","events_json":"https://pith.science/api/pith-number/XVJ5MFUHXD3PWXZWFFROJJCS2H/events.json","paper":"https://pith.science/paper/XVJ5MFUH"},"agent_actions":{"view_html":"https://pith.science/pith/XVJ5MFUHXD3PWXZWFFROJJCS2H","download_json":"https://pith.science/pith/XVJ5MFUHXD3PWXZWFFROJJCS2H.json","view_paper":"https://pith.science/paper/XVJ5MFUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06744&json=true","fetch_graph":"https://pith.science/api/pith-number/XVJ5MFUHXD3PWXZWFFROJJCS2H/graph.json","fetch_events":"https://pith.science/api/pith-number/XVJ5MFUHXD3PWXZWFFROJJCS2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XVJ5MFUHXD3PWXZWFFROJJCS2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XVJ5MFUHXD3PWXZWFFROJJCS2H/action/storage_attestation","attest_author":"https://pith.science/pith/XVJ5MFUHXD3PWXZWFFROJJCS2H/action/author_attestation","sign_citation":"https://pith.science/pith/XVJ5MFUHXD3PWXZWFFROJJCS2H/action/citation_signature","submit_replication":"https://pith.science/pith/XVJ5MFUHXD3PWXZWFFROJJCS2H/action/replication_record"}},"created_at":"2026-07-05T11:48:46.903582+00:00","updated_at":"2026-07-05T11:48:46.903582+00:00"}