{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YYUPL5KDJ5YL2ZCZ7DWHQ54TEX","short_pith_number":"pith:YYUPL5KD","schema_version":"1.0","canonical_sha256":"c628f5f5434f70bd6459f8ec78779325ec4ac88f9143252090effcff5a66bf36","source":{"kind":"arxiv","id":"2408.14848","version":1},"attestation_state":"computed","paper":{"title":"Practical quantum advantage on partially fault-tolerant quantum computer","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-27T07:58:09Z","abstract_excerpt":"Achieving quantum speedups in practical tasks remains challenging for current noisy intermediate-scale quantum (NISQ) devices. These devices always encounter significant obstacles such as inevitable physical errors and the limited scalability of current near-term algorithms. Meanwhile, assuming a typical architecture for fault-tolerant quantum computing (FTQC), realistic applications inevitably require a vast number of qubits, typically exceeding $10^6$, which seems far beyond near-term realization. In this work, to bridge the gap between the NISQ and FTQC eras, we propose an alternative appro"},"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.14848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-08-27T07:58:09Z","cross_cats_sorted":["cond-mat.str-el"],"title_canon_sha256":"dfc76fd479190e009dba33ba0fc771a435cce26a8cfba3b05c26f1a60498a335","abstract_canon_sha256":"eaa023983b48d3c82a2bbb1c1e73d0f4d38faa3f1146c63f83ad243393d0361b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:39.753047Z","signature_b64":"aFm5kD0+E3WQggDODGzz/TNfgMHUcElT/lZ7sutgsekcKBDudeKj2hxMn+Fe/yK+c3JYc55vgw2P5d96mw4+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c628f5f5434f70bd6459f8ec78779325ec4ac88f9143252090effcff5a66bf36","last_reissued_at":"2026-07-05T08:59:39.752515Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:39.752515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical quantum advantage on partially fault-tolerant quantum computer","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-27T07:58:09Z","abstract_excerpt":"Achieving quantum speedups in practical tasks remains challenging for current noisy intermediate-scale quantum (NISQ) devices. These devices always encounter significant obstacles such as inevitable physical errors and the limited scalability of current near-term algorithms. Meanwhile, assuming a typical architecture for fault-tolerant quantum computing (FTQC), realistic applications inevitably require a vast number of qubits, typically exceeding $10^6$, which seems far beyond near-term realization. In this work, to bridge the gap between the NISQ and FTQC eras, we propose an alternative appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.14848","kind":"arxiv","version":1},"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.14848/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.14848","created_at":"2026-07-05T08:59:39.752578+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.14848v1","created_at":"2026-07-05T08:59:39.752578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.14848","created_at":"2026-07-05T08:59:39.752578+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYUPL5KDJ5YL","created_at":"2026-07-05T08:59:39.752578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYUPL5KDJ5YL2ZCZ","created_at":"2026-07-05T08:59:39.752578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYUPL5KD","created_at":"2026-07-05T08:59:39.752578+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10430","citing_title":"Efficient Magic State Cultivation for $\\sqrt{T}$ Gates","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2505.09133","citing_title":"Quantum Error-Corrected Computation of Molecular Energies","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2508.10997","citing_title":"Reliable high-accuracy error mitigation for utility-scale quantum circuits","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX","json":"https://pith.science/pith/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX.json","graph_json":"https://pith.science/api/pith-number/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX/graph.json","events_json":"https://pith.science/api/pith-number/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX/events.json","paper":"https://pith.science/paper/YYUPL5KD"},"agent_actions":{"view_html":"https://pith.science/pith/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX","download_json":"https://pith.science/pith/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX.json","view_paper":"https://pith.science/paper/YYUPL5KD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.14848&json=true","fetch_graph":"https://pith.science/api/pith-number/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX/graph.json","fetch_events":"https://pith.science/api/pith-number/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX/action/storage_attestation","attest_author":"https://pith.science/pith/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX/action/author_attestation","sign_citation":"https://pith.science/pith/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX/action/citation_signature","submit_replication":"https://pith.science/pith/YYUPL5KDJ5YL2ZCZ7DWHQ54TEX/action/replication_record"}},"created_at":"2026-07-05T08:59:39.752578+00:00","updated_at":"2026-07-05T08:59:39.752578+00:00"}