{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EDDQ5JJVTTS3YPZAQNJLXU4NV6","short_pith_number":"pith:EDDQ5JJV","schema_version":"1.0","canonical_sha256":"20c70ea5359ce5bc3f208352bbd38daf9febcae215396f293e6a0411829aba10","source":{"kind":"arxiv","id":"2008.05177","version":3},"attestation_state":"computed","paper":{"title":"Statistical Aspects of the Quantum Supremacy Demonstration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.TH"],"primary_cat":"quant-ph","authors_text":"Gil Kalai, Tomer Shoham, Yosef Rinott","submitted_at":"2020-08-12T08:46:02Z","abstract_excerpt":"The notable claim of quantum supremacy presented by Google's team in 2019 consists of demonstrating the ability of a quantum circuit to generate, albeit with considerable noise, bitstrings from a distribution that is considered hard to simulate on classical computers. Verifying that the generated data is indeed from the claimed distribution and assessing the circuit's noise level and its fidelity is a purely statistical undertaking. The objective of this paper is to explain the relations between quantum computing and some of the statistical aspects involved in demonstrating quantum supremacy 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":"2008.05177","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-12T08:46:02Z","cross_cats_sorted":["cs.CC","math.ST","stat.TH"],"title_canon_sha256":"e08ac8310e657037d12bff7b50ed68d364b4c5f151dc09e62fa9a38dd54739bc","abstract_canon_sha256":"e2974b82589dd570221580c1b891e2eee034aabb6b38608e91d0f0ca52cd42ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:50.037283Z","signature_b64":"PYlBtwF2atzMPg7eqrJ3iV2gBQXreJwAGZJr2FyJbL/q0O5e+x39LNWT6h9A0m0TctyA/p7FEycBECM4siNeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20c70ea5359ce5bc3f208352bbd38daf9febcae215396f293e6a0411829aba10","last_reissued_at":"2026-07-05T02:57:50.036846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:50.036846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical Aspects of the Quantum Supremacy Demonstration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.TH"],"primary_cat":"quant-ph","authors_text":"Gil Kalai, Tomer Shoham, Yosef Rinott","submitted_at":"2020-08-12T08:46:02Z","abstract_excerpt":"The notable claim of quantum supremacy presented by Google's team in 2019 consists of demonstrating the ability of a quantum circuit to generate, albeit with considerable noise, bitstrings from a distribution that is considered hard to simulate on classical computers. Verifying that the generated data is indeed from the claimed distribution and assessing the circuit's noise level and its fidelity is a purely statistical undertaking. The objective of this paper is to explain the relations between quantum computing and some of the statistical aspects involved in demonstrating quantum supremacy i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.05177","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/2008.05177/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":"2008.05177","created_at":"2026-07-05T02:57:50.036900+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.05177v3","created_at":"2026-07-05T02:57:50.036900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.05177","created_at":"2026-07-05T02:57:50.036900+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDDQ5JJVTTS3","created_at":"2026-07-05T02:57:50.036900+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDDQ5JJVTTS3YPZA","created_at":"2026-07-05T02:57:50.036900+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDDQ5JJV","created_at":"2026-07-05T02:57:50.036900+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09015","citing_title":"Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EDDQ5JJVTTS3YPZAQNJLXU4NV6","json":"https://pith.science/pith/EDDQ5JJVTTS3YPZAQNJLXU4NV6.json","graph_json":"https://pith.science/api/pith-number/EDDQ5JJVTTS3YPZAQNJLXU4NV6/graph.json","events_json":"https://pith.science/api/pith-number/EDDQ5JJVTTS3YPZAQNJLXU4NV6/events.json","paper":"https://pith.science/paper/EDDQ5JJV"},"agent_actions":{"view_html":"https://pith.science/pith/EDDQ5JJVTTS3YPZAQNJLXU4NV6","download_json":"https://pith.science/pith/EDDQ5JJVTTS3YPZAQNJLXU4NV6.json","view_paper":"https://pith.science/paper/EDDQ5JJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.05177&json=true","fetch_graph":"https://pith.science/api/pith-number/EDDQ5JJVTTS3YPZAQNJLXU4NV6/graph.json","fetch_events":"https://pith.science/api/pith-number/EDDQ5JJVTTS3YPZAQNJLXU4NV6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDDQ5JJVTTS3YPZAQNJLXU4NV6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDDQ5JJVTTS3YPZAQNJLXU4NV6/action/storage_attestation","attest_author":"https://pith.science/pith/EDDQ5JJVTTS3YPZAQNJLXU4NV6/action/author_attestation","sign_citation":"https://pith.science/pith/EDDQ5JJVTTS3YPZAQNJLXU4NV6/action/citation_signature","submit_replication":"https://pith.science/pith/EDDQ5JJVTTS3YPZAQNJLXU4NV6/action/replication_record"}},"created_at":"2026-07-05T02:57:50.036900+00:00","updated_at":"2026-07-05T02:57:50.036900+00:00"}