{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:V2KED4FSCAU5ONMHFT4JMD5P2A","short_pith_number":"pith:V2KED4FS","schema_version":"1.0","canonical_sha256":"ae9441f0b21029d735872cf8960fafd003afb6896b486e0da136d0fa3f44c6eb","source":{"kind":"arxiv","id":"2306.16372","version":1},"attestation_state":"computed","paper":{"title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Garnet Kin-Lic Chan, Tomislav Begu\\v{s}i\\'c","submitted_at":"2023-06-28T17:08:00Z","abstract_excerpt":"We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor [Nature 618, 500 (2023)]. Our classical simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, as well as faster than the estimated quantum hardware runtime without classical processing, and are in good agreement with the zero-noise extrapolated experimental results."},"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":"2306.16372","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-28T17:08:00Z","cross_cats_sorted":[],"title_canon_sha256":"36bf8a557b70df98ae702d95eda59c2da311065a692822c30fc34beb1bfa062b","abstract_canon_sha256":"f768d334fa2860c3a9cbb4e2170cd79b81b7768a65c7066392159608b4e18e25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:25:55.423101Z","signature_b64":"fqcpAJ/UQYIt9RF8lYwZX8g7GbzOtwMDr3ZvHnpJ+GqpgPWcRL32PlYyFjZ74S6YHSBtfT12puKWmJGtVIINDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae9441f0b21029d735872cf8960fafd003afb6896b486e0da136d0fa3f44c6eb","last_reissued_at":"2026-07-05T06:25:55.422645Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:25:55.422645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast classical simulation of evidence for the utility of quantum computing before fault tolerance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Garnet Kin-Lic Chan, Tomislav Begu\\v{s}i\\'c","submitted_at":"2023-06-28T17:08:00Z","abstract_excerpt":"We show that a classical algorithm based on sparse Pauli dynamics can efficiently simulate quantum circuits studied in a recent experiment on 127 qubits of IBM's Eagle processor [Nature 618, 500 (2023)]. Our classical simulations on a single core of a laptop are orders of magnitude faster than the reported walltime of the quantum simulations, as well as faster than the estimated quantum hardware runtime without classical processing, and are in good agreement with the zero-noise extrapolated experimental results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16372","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/2306.16372/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":"2306.16372","created_at":"2026-07-05T06:25:55.422692+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.16372v1","created_at":"2026-07-05T06:25:55.422692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16372","created_at":"2026-07-05T06:25:55.422692+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2KED4FSCAU5","created_at":"2026-07-05T06:25:55.422692+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2KED4FSCAU5ONMH","created_at":"2026-07-05T06:25:55.422692+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2KED4FS","created_at":"2026-07-05T06:25:55.422692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.15572","citing_title":"Classical Combinatorial Optimization Scaling for Random Ising Models on 2D Heavy-Hex Graphs","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2412.15134","citing_title":"Use of Faulty States in Cat-Code Error Correction","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":201,"is_internal_anchor":false},{"citing_arxiv_id":"2508.10997","citing_title":"Reliable high-accuracy error mitigation for utility-scale quantum circuits","ref_index":77,"is_internal_anchor":false},{"citing_arxiv_id":"2510.19928","citing_title":"Mind the gaps: The fraught road to quantum advantage","ref_index":201,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V2KED4FSCAU5ONMHFT4JMD5P2A","json":"https://pith.science/pith/V2KED4FSCAU5ONMHFT4JMD5P2A.json","graph_json":"https://pith.science/api/pith-number/V2KED4FSCAU5ONMHFT4JMD5P2A/graph.json","events_json":"https://pith.science/api/pith-number/V2KED4FSCAU5ONMHFT4JMD5P2A/events.json","paper":"https://pith.science/paper/V2KED4FS"},"agent_actions":{"view_html":"https://pith.science/pith/V2KED4FSCAU5ONMHFT4JMD5P2A","download_json":"https://pith.science/pith/V2KED4FSCAU5ONMHFT4JMD5P2A.json","view_paper":"https://pith.science/paper/V2KED4FS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.16372&json=true","fetch_graph":"https://pith.science/api/pith-number/V2KED4FSCAU5ONMHFT4JMD5P2A/graph.json","fetch_events":"https://pith.science/api/pith-number/V2KED4FSCAU5ONMHFT4JMD5P2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2KED4FSCAU5ONMHFT4JMD5P2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2KED4FSCAU5ONMHFT4JMD5P2A/action/storage_attestation","attest_author":"https://pith.science/pith/V2KED4FSCAU5ONMHFT4JMD5P2A/action/author_attestation","sign_citation":"https://pith.science/pith/V2KED4FSCAU5ONMHFT4JMD5P2A/action/citation_signature","submit_replication":"https://pith.science/pith/V2KED4FSCAU5ONMHFT4JMD5P2A/action/replication_record"}},"created_at":"2026-07-05T06:25:55.422692+00:00","updated_at":"2026-07-05T06:25:55.422692+00:00"}