{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GASO2VENEVKTIHDNZSO4KBPYBJ","short_pith_number":"pith:GASO2VEN","schema_version":"1.0","canonical_sha256":"3024ed548d2555341c6dcc9dc505f80a7f987b23fc9bbbce187a6e7973daa36c","source":{"kind":"arxiv","id":"2408.04126","version":3},"attestation_state":"computed","paper":{"title":"Linear-optical quantum computation with arbitrary error-correcting codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben Q. Baragiola, Blayney W. Walshe, Giacomo Pantaleoni, Hugo Ferretti, Ilan Tzitrin, Jos\\'e Gefaell, Michael Vasmer, Nicolas C. Menicucci, Rafael N. Alexander, Ryohei Weil, Takaya Matsuura, Thomas Jaeken, Timo Hillmann, Zhihua Han","submitted_at":"2024-08-07T23:23:28Z","abstract_excerpt":"High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require efficient generation of non-local, many-body entanglement. We provide a linear-optical architecture with these properties, compatible with arbitrary codes and Gottesman-Kitaev-Preskill qubits on generic lattices, and featuring a natural way to leverage physical noise bias. Simulations of hyperbolic surface codes and bivariate bicycle codes, promising families of quantum low-density parity-check codes, reveal a threshold comparable to the 2D surface code with substantially better"},"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":"2408.04126","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-07T23:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"537671c2dbd43398a1b98105068f70b3298ffc27bf67e9cd5fdd6bb5185acd51","abstract_canon_sha256":"dbee65ed3a4ac6eafe3d75daba81000cbd272b3c54c81984376229f7885493dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:56.114989Z","signature_b64":"SgkpER4ofMWvY03sRYGT6jCXX4bXq6en4hoF7wot0Vn4KzUmHZamx29lpci66TkOoToaXjvXEC2P295my4G4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3024ed548d2555341c6dcc9dc505f80a7f987b23fc9bbbce187a6e7973daa36c","last_reissued_at":"2026-07-05T10:46:56.114511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:56.114511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-optical quantum computation with arbitrary error-correcting codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ben Q. Baragiola, Blayney W. Walshe, Giacomo Pantaleoni, Hugo Ferretti, Ilan Tzitrin, Jos\\'e Gefaell, Michael Vasmer, Nicolas C. Menicucci, Rafael N. Alexander, Ryohei Weil, Takaya Matsuura, Thomas Jaeken, Timo Hillmann, Zhihua Han","submitted_at":"2024-08-07T23:23:28Z","abstract_excerpt":"High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require efficient generation of non-local, many-body entanglement. We provide a linear-optical architecture with these properties, compatible with arbitrary codes and Gottesman-Kitaev-Preskill qubits on generic lattices, and featuring a natural way to leverage physical noise bias. Simulations of hyperbolic surface codes and bivariate bicycle codes, promising families of quantum low-density parity-check codes, reveal a threshold comparable to the 2D surface code with substantially better"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04126","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/2408.04126/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":"2408.04126","created_at":"2026-07-05T10:46:56.114569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.04126v3","created_at":"2026-07-05T10:46:56.114569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04126","created_at":"2026-07-05T10:46:56.114569+00:00"},{"alias_kind":"pith_short_12","alias_value":"GASO2VENEVKT","created_at":"2026-07-05T10:46:56.114569+00:00"},{"alias_kind":"pith_short_16","alias_value":"GASO2VENEVKTIHDN","created_at":"2026-07-05T10:46:56.114569+00:00"},{"alias_kind":"pith_short_8","alias_value":"GASO2VEN","created_at":"2026-07-05T10:46:56.114569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11484","citing_title":"Handbook of Error-Correcting Codes","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GASO2VENEVKTIHDNZSO4KBPYBJ","json":"https://pith.science/pith/GASO2VENEVKTIHDNZSO4KBPYBJ.json","graph_json":"https://pith.science/api/pith-number/GASO2VENEVKTIHDNZSO4KBPYBJ/graph.json","events_json":"https://pith.science/api/pith-number/GASO2VENEVKTIHDNZSO4KBPYBJ/events.json","paper":"https://pith.science/paper/GASO2VEN"},"agent_actions":{"view_html":"https://pith.science/pith/GASO2VENEVKTIHDNZSO4KBPYBJ","download_json":"https://pith.science/pith/GASO2VENEVKTIHDNZSO4KBPYBJ.json","view_paper":"https://pith.science/paper/GASO2VEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.04126&json=true","fetch_graph":"https://pith.science/api/pith-number/GASO2VENEVKTIHDNZSO4KBPYBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GASO2VENEVKTIHDNZSO4KBPYBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GASO2VENEVKTIHDNZSO4KBPYBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GASO2VENEVKTIHDNZSO4KBPYBJ/action/storage_attestation","attest_author":"https://pith.science/pith/GASO2VENEVKTIHDNZSO4KBPYBJ/action/author_attestation","sign_citation":"https://pith.science/pith/GASO2VENEVKTIHDNZSO4KBPYBJ/action/citation_signature","submit_replication":"https://pith.science/pith/GASO2VENEVKTIHDNZSO4KBPYBJ/action/replication_record"}},"created_at":"2026-07-05T10:46:56.114569+00:00","updated_at":"2026-07-05T10:46:56.114569+00:00"}