{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JNA7ZVRTT25PJ4JA4FJPHUU6NT","short_pith_number":"pith:JNA7ZVRT","schema_version":"1.0","canonical_sha256":"4b41fcd6339ebaf4f120e152f3d29e6ceb037aa11d1b6efcb0b632358f7ac205","source":{"kind":"arxiv","id":"2308.05077","version":3},"attestation_state":"computed","paper":{"title":"Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Garnet Kin-Lic Chan, Johnnie Gray, Tomislav Begu\\v{s}i\\'c","submitted_at":"2023-08-09T17:15:17Z","abstract_excerpt":"A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits that exceed the capabilities of exact classical simulation. We show that several approximate classical methods, based on sparse Pauli dynamics and tensor network algorithms, can simulate these observables orders of magnitude faster than the quantum experiment, and can also be systematically converged beyond the experimental accuracy. Our most accurate technique combines a mixed Schr\\\"{o}dinger and Heisenberg tensor network representation with the Bethe free entropy relation of belief propaga"},"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":"2308.05077","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-08-09T17:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"fbc8a1dac54b93cf047409a8c1b5cbd75cfd2967eb608850d8cecf58006ee19b","abstract_canon_sha256":"3b78bd6abbbfbf202d67dc3efc15e82ab381af5aa14dac6ec7b487c63bc3e57b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:09.374802Z","signature_b64":"Iht3BytyBj9vT7t65a2N9SAyWPnhZbJ6NctKX4AvJpmmK7jORJf1Qm6ts06wQ1P5lDRaLtRrLsSURlOHeVoCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b41fcd6339ebaf4f120e152f3d29e6ceb037aa11d1b6efcb0b632358f7ac205","last_reissued_at":"2026-07-05T07:38:09.374230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:09.374230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Garnet Kin-Lic Chan, Johnnie Gray, Tomislav Begu\\v{s}i\\'c","submitted_at":"2023-08-09T17:15:17Z","abstract_excerpt":"A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits that exceed the capabilities of exact classical simulation. We show that several approximate classical methods, based on sparse Pauli dynamics and tensor network algorithms, can simulate these observables orders of magnitude faster than the quantum experiment, and can also be systematically converged beyond the experimental accuracy. Our most accurate technique combines a mixed Schr\\\"{o}dinger and Heisenberg tensor network representation with the Bethe free entropy relation of belief propaga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.05077","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/2308.05077/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":"2308.05077","created_at":"2026-07-05T07:38:09.374289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.05077v3","created_at":"2026-07-05T07:38:09.374289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.05077","created_at":"2026-07-05T07:38:09.374289+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNA7ZVRTT25P","created_at":"2026-07-05T07:38:09.374289+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNA7ZVRTT25PJ4JA","created_at":"2026-07-05T07:38:09.374289+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNA7ZVRT","created_at":"2026-07-05T07:38:09.374289+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07942","citing_title":"A hardware-efficient variational ansatz with an exact diagonal metric for real- and imaginary-time evolution and Haar sampling","ref_index":82,"is_internal_anchor":true},{"citing_arxiv_id":"2412.15572","citing_title":"Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JNA7ZVRTT25PJ4JA4FJPHUU6NT","json":"https://pith.science/pith/JNA7ZVRTT25PJ4JA4FJPHUU6NT.json","graph_json":"https://pith.science/api/pith-number/JNA7ZVRTT25PJ4JA4FJPHUU6NT/graph.json","events_json":"https://pith.science/api/pith-number/JNA7ZVRTT25PJ4JA4FJPHUU6NT/events.json","paper":"https://pith.science/paper/JNA7ZVRT"},"agent_actions":{"view_html":"https://pith.science/pith/JNA7ZVRTT25PJ4JA4FJPHUU6NT","download_json":"https://pith.science/pith/JNA7ZVRTT25PJ4JA4FJPHUU6NT.json","view_paper":"https://pith.science/paper/JNA7ZVRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.05077&json=true","fetch_graph":"https://pith.science/api/pith-number/JNA7ZVRTT25PJ4JA4FJPHUU6NT/graph.json","fetch_events":"https://pith.science/api/pith-number/JNA7ZVRTT25PJ4JA4FJPHUU6NT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNA7ZVRTT25PJ4JA4FJPHUU6NT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNA7ZVRTT25PJ4JA4FJPHUU6NT/action/storage_attestation","attest_author":"https://pith.science/pith/JNA7ZVRTT25PJ4JA4FJPHUU6NT/action/author_attestation","sign_citation":"https://pith.science/pith/JNA7ZVRTT25PJ4JA4FJPHUU6NT/action/citation_signature","submit_replication":"https://pith.science/pith/JNA7ZVRTT25PJ4JA4FJPHUU6NT/action/replication_record"}},"created_at":"2026-07-05T07:38:09.374289+00:00","updated_at":"2026-07-05T07:38:09.374289+00:00"}