{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UUKHQRSRBX6HZP2U53FF6RCJXV","short_pith_number":"pith:UUKHQRSR","schema_version":"1.0","canonical_sha256":"a5147846510dfc7cbf54eeca5f4449bd4d38f385dbc0454cccd88aae5b6b85fe","source":{"kind":"arxiv","id":"2408.14929","version":2},"attestation_state":"computed","paper":{"title":"Compilation of Trotter-Based Time Evolution for Partially Fault-Tolerant Quantum Computing Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Hirotaka Oshima, Jun Fujisaki, Keisuke Fujii, Riki Toshio, Shintaro Sato, Yutaro Akahoshi","submitted_at":"2024-08-27T10:07:34Z","abstract_excerpt":"Achieving practical quantum speedup with limited resources is a crucial challenge in both academic and industrial communities. To address this, a partially fault-tolerant quantum computing architecture called ``space-time efficient analog rotation quantum computing architecture (STAR architecture)'' has been recently proposed. This architecture focuses on minimizing resource requirements while maximizing the precision of non-Clifford gates, essential for universal quantum computation. However, non-deterministic processes such as the repeat-until-success (RUS) protocol and state injection can i"},"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.14929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-27T10:07:34Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"e467278562d6ea341f91b854d484d46f866829589a695bd4b9346c346c2a3ea2","abstract_canon_sha256":"057e3b0de14695f71ab199c30c8979c89a2527f4c92885014f415ed26e3a3689"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:37.990636Z","signature_b64":"Qn1GBvwmnhjb75SZUtqZ4Lcsfa2llrWO5gpNuj/IpTrigb6NgKFn6mUBpPtb6sePLm9UzlvqjzruC1RDjsrUBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5147846510dfc7cbf54eeca5f4449bd4d38f385dbc0454cccd88aae5b6b85fe","last_reissued_at":"2026-07-05T09:24:37.990054Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:37.990054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compilation of Trotter-Based Time Evolution for Partially Fault-Tolerant Quantum Computing Architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Hirotaka Oshima, Jun Fujisaki, Keisuke Fujii, Riki Toshio, Shintaro Sato, Yutaro Akahoshi","submitted_at":"2024-08-27T10:07:34Z","abstract_excerpt":"Achieving practical quantum speedup with limited resources is a crucial challenge in both academic and industrial communities. To address this, a partially fault-tolerant quantum computing architecture called ``space-time efficient analog rotation quantum computing architecture (STAR architecture)'' has been recently proposed. This architecture focuses on minimizing resource requirements while maximizing the precision of non-Clifford gates, essential for universal quantum computation. However, non-deterministic processes such as the repeat-until-success (RUS) protocol and state injection can i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.14929","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/2408.14929/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.14929","created_at":"2026-07-05T09:24:37.990133+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.14929v2","created_at":"2026-07-05T09:24:37.990133+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.14929","created_at":"2026-07-05T09:24:37.990133+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUKHQRSRBX6H","created_at":"2026-07-05T09:24:37.990133+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUKHQRSRBX6HZP2U","created_at":"2026-07-05T09:24:37.990133+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUKHQRSR","created_at":"2026-07-05T09:24:37.990133+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2408.14828","citing_title":"Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UUKHQRSRBX6HZP2U53FF6RCJXV","json":"https://pith.science/pith/UUKHQRSRBX6HZP2U53FF6RCJXV.json","graph_json":"https://pith.science/api/pith-number/UUKHQRSRBX6HZP2U53FF6RCJXV/graph.json","events_json":"https://pith.science/api/pith-number/UUKHQRSRBX6HZP2U53FF6RCJXV/events.json","paper":"https://pith.science/paper/UUKHQRSR"},"agent_actions":{"view_html":"https://pith.science/pith/UUKHQRSRBX6HZP2U53FF6RCJXV","download_json":"https://pith.science/pith/UUKHQRSRBX6HZP2U53FF6RCJXV.json","view_paper":"https://pith.science/paper/UUKHQRSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.14929&json=true","fetch_graph":"https://pith.science/api/pith-number/UUKHQRSRBX6HZP2U53FF6RCJXV/graph.json","fetch_events":"https://pith.science/api/pith-number/UUKHQRSRBX6HZP2U53FF6RCJXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUKHQRSRBX6HZP2U53FF6RCJXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUKHQRSRBX6HZP2U53FF6RCJXV/action/storage_attestation","attest_author":"https://pith.science/pith/UUKHQRSRBX6HZP2U53FF6RCJXV/action/author_attestation","sign_citation":"https://pith.science/pith/UUKHQRSRBX6HZP2U53FF6RCJXV/action/citation_signature","submit_replication":"https://pith.science/pith/UUKHQRSRBX6HZP2U53FF6RCJXV/action/replication_record"}},"created_at":"2026-07-05T09:24:37.990133+00:00","updated_at":"2026-07-05T09:24:37.990133+00:00"}