{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TWHQNFXLLCVVNBZ73XW5TO7M4O","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3f9710114fc3bda0d27b9ecd5f0ddf8a1667d4a370a611a8462c49c6a87b70d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-29T15:25:08Z","title_canon_sha256":"c23dd6070d78cabaf2489cd82b3c8e3b1599f2737c3725bf3560f4c707558dd8"},"schema_version":"1.0","source":{"id":"2604.26792","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26792","created_at":"2026-05-21T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26792v2","created_at":"2026-05-21T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26792","created_at":"2026-05-21T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"TWHQNFXLLCVV","created_at":"2026-05-21T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"TWHQNFXLLCVVNBZ7","created_at":"2026-05-21T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"TWHQNFXL","created_at":"2026-05-21T02:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:2b80878c7dec60b93f1afd98855b83e3e185f2dde7c983c172497a9701727c2d","target":"graph","created_at":"2026-05-21T02:05:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Within the constructive models studied here, product-formula implementations would require an exponentially stronger per-primitive synthesis advantage for qudits to win asymptotically, while in the LCU setting the qubit encoding is asymptotically cheaper in d. Nevertheless, the finite-d threshold analysis identifies low dimensional regions in which qudits can yield meaningful constant-factor savings, particularly for LCU-based implementations."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Because tight synthesis bounds for general single-qudit rotations are not known, we express the qudit constructions in terms of embedded two-level SU(2) rotations; this modeling choice and the idealized negligible-overhead qubit-qudit code-switching model are load-bearing for the break-even conditions and T-count comparisons."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Qudit encodings for quadratic diagonal evolutions require exponentially stronger synthesis advantages than qubits to win asymptotically in product formulas but can yield constant-factor savings in LCU at low d."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Qudit encodings can cut non-Clifford costs by constant factors over qubits for diagonal quadratic operators at small d in LCU settings, but qubits scale better asymptotically and dominate product formulas."}],"snapshot_sha256":"b1ff8257426a046ffe41476da38fb4a1dd834a8265c3e1910639d21aa9126708"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T23:41:45.090461Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:46:05.247669Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.26792/integrity.json","findings":[],"snapshot_sha256":"ef433e25d6b8a13751c0e865de0d4b835e01fb70b73f6ed99ed8b6cded1d1e78","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings, but their fault-tolerant advantage over qubit encodings remains unclear. We compare the non-Clifford cost of implementing quadratic diagonal evolutions, exemplified by $U=e^{-it\\phi_x^2}$ in a uniform field-amplitude discretization of a real scalar field, using either one logical $d$-level qudit or $n_b=\\lceil \\log_2 d\\rceil$ logical qubits. We analyze two standard settings: product-formula simulation and LCU/block encoding, taking the resource metric to be the ","authors_text":"Alessandro Roggero, Do\\u{g}a Murat K\\\"urk\\c{c}\\\"uo\\u{g}lu, Gabriel N. Perdue, Marina Maneyro, Samuel Godwood","cross_cats":[],"headline":"Qudit encodings can cut non-Clifford costs by constant factors over qubits for diagonal quadratic operators at small d in LCU settings, but qubits scale better asymptotically and dominate product formulas.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-29T15:25:08Z","title":"Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.26792","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T13:10:14.911795Z","id":"94c2b9b1-6bd4-4f6a-87e9-3d05052b0332","model_set":{"reader":"grok-4.3"},"one_line_summary":"Qudit encodings for quadratic diagonal evolutions require exponentially stronger synthesis advantages than qubits to win asymptotically in product formulas but can yield constant-factor savings in LCU at low d.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Qudit encodings can cut non-Clifford costs by constant factors over qubits for diagonal quadratic operators at small d in LCU settings, but qubits scale better asymptotically and dominate product formulas.","strongest_claim":"Within the constructive models studied here, product-formula implementations would require an exponentially stronger per-primitive synthesis advantage for qudits to win asymptotically, while in the LCU setting the qubit encoding is asymptotically cheaper in d. Nevertheless, the finite-d threshold analysis identifies low dimensional regions in which qudits can yield meaningful constant-factor savings, particularly for LCU-based implementations.","weakest_assumption":"Because tight synthesis bounds for general single-qudit rotations are not known, we express the qudit constructions in terms of embedded two-level SU(2) rotations; this modeling choice and the idealized negligible-overhead qubit-qudit code-switching model are load-bearing for the break-even conditions and T-count comparisons."}},"verdict_id":"94c2b9b1-6bd4-4f6a-87e9-3d05052b0332"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d5769e52fb60fb1f969288f28692392f4cdd44d00d30ba03552c00e4cb73e63f","target":"record","created_at":"2026-05-21T02:05:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3f9710114fc3bda0d27b9ecd5f0ddf8a1667d4a370a611a8462c49c6a87b70d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-04-29T15:25:08Z","title_canon_sha256":"c23dd6070d78cabaf2489cd82b3c8e3b1599f2737c3725bf3560f4c707558dd8"},"schema_version":"1.0","source":{"id":"2604.26792","kind":"arxiv","version":2}},"canonical_sha256":"9d8f0696eb58ab56873fddedd9bbece3b2ec1ce678d25a567fc2a285b2ba8b08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d8f0696eb58ab56873fddedd9bbece3b2ec1ce678d25a567fc2a285b2ba8b08","first_computed_at":"2026-05-21T02:05:03.597506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T02:05:03.597506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m0dxiHeKkG2uEO+1kJCq5yHtB+qzkrGag+Pq/ZznRARKnZTm0ySWzRMkmbwsdF7TnIFoPBNpW0K+bJ47uECPBg==","signature_status":"signed_v1","signed_at":"2026-05-21T02:05:03.598116Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.26792","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5769e52fb60fb1f969288f28692392f4cdd44d00d30ba03552c00e4cb73e63f","sha256:2b80878c7dec60b93f1afd98855b83e3e185f2dde7c983c172497a9701727c2d"],"state_sha256":"898b5f304f9c7058949b0ad93107e1605fbc8ea16f8de55c0901245236233722"}