{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X4A3FLWOPNIY5AQQDYYPH45JH2","short_pith_number":"pith:X4A3FLWO","schema_version":"1.0","canonical_sha256":"bf01b2aece7b518e82101e30f3f3a93e8816637b423edf66be4f59ebe5514950","source":{"kind":"arxiv","id":"1905.10724","version":1},"attestation_state":"computed","paper":{"title":"Empirical determination of the simulation capacity of a near-term quantum computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac Chuang, Kevin Obenland, Rich Rines","submitted_at":"2019-05-26T04:45:31Z","abstract_excerpt":"Experimentally realizable quantum computers are rapidly approaching the threshold of quantum supremacy. Quantum Hamiltonian simulation promises to be one of the first practical applications for which such a device could demonstrate an advantage over all classical systems. However, these early devices will inevitably remain both noisy and small, precluding the use of quantum error correction. We use high-performance classical tools to construct, optimize, and simulate quantum circuits subject to realistic error models in order to empirically determine the \"simulation capacity\" of near-term simu"},"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":"1905.10724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-05-26T04:45:31Z","cross_cats_sorted":[],"title_canon_sha256":"cec6df5cbd4c8f4602f4f6102be431e69c2c3c0fcf1f747f97649416d31f8c5e","abstract_canon_sha256":"a01f5e211bad41dc783fc3b07bfcde030227f0d398207d43f8120a87d6ea0547"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:05.441691Z","signature_b64":"PmFFc4fi0QVoR67B9rpXyTbJTeNHJbXSiRvPYjEi/LQnDJECtOTb6RZwqnSgQBCG/Jh7CEsBZeCehtf43tC7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf01b2aece7b518e82101e30f3f3a93e8816637b423edf66be4f59ebe5514950","last_reissued_at":"2026-05-17T23:45:05.440890Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:05.440890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Empirical determination of the simulation capacity of a near-term quantum computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Isaac Chuang, Kevin Obenland, Rich Rines","submitted_at":"2019-05-26T04:45:31Z","abstract_excerpt":"Experimentally realizable quantum computers are rapidly approaching the threshold of quantum supremacy. Quantum Hamiltonian simulation promises to be one of the first practical applications for which such a device could demonstrate an advantage over all classical systems. However, these early devices will inevitably remain both noisy and small, precluding the use of quantum error correction. We use high-performance classical tools to construct, optimize, and simulate quantum circuits subject to realistic error models in order to empirically determine the \"simulation capacity\" of near-term simu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10724","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":""},"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":"1905.10724","created_at":"2026-05-17T23:45:05.441031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10724v1","created_at":"2026-05-17T23:45:05.441031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10724","created_at":"2026-05-17T23:45:05.441031+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4A3FLWOPNIY","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4A3FLWOPNIY5AQQ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4A3FLWO","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2406.09340","citing_title":"Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers","ref_index":63,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X4A3FLWOPNIY5AQQDYYPH45JH2","json":"https://pith.science/pith/X4A3FLWOPNIY5AQQDYYPH45JH2.json","graph_json":"https://pith.science/api/pith-number/X4A3FLWOPNIY5AQQDYYPH45JH2/graph.json","events_json":"https://pith.science/api/pith-number/X4A3FLWOPNIY5AQQDYYPH45JH2/events.json","paper":"https://pith.science/paper/X4A3FLWO"},"agent_actions":{"view_html":"https://pith.science/pith/X4A3FLWOPNIY5AQQDYYPH45JH2","download_json":"https://pith.science/pith/X4A3FLWOPNIY5AQQDYYPH45JH2.json","view_paper":"https://pith.science/paper/X4A3FLWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10724&json=true","fetch_graph":"https://pith.science/api/pith-number/X4A3FLWOPNIY5AQQDYYPH45JH2/graph.json","fetch_events":"https://pith.science/api/pith-number/X4A3FLWOPNIY5AQQDYYPH45JH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4A3FLWOPNIY5AQQDYYPH45JH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4A3FLWOPNIY5AQQDYYPH45JH2/action/storage_attestation","attest_author":"https://pith.science/pith/X4A3FLWOPNIY5AQQDYYPH45JH2/action/author_attestation","sign_citation":"https://pith.science/pith/X4A3FLWOPNIY5AQQDYYPH45JH2/action/citation_signature","submit_replication":"https://pith.science/pith/X4A3FLWOPNIY5AQQDYYPH45JH2/action/replication_record"}},"created_at":"2026-05-17T23:45:05.441031+00:00","updated_at":"2026-05-17T23:45:05.441031+00:00"}