{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:I2A5YTCIIKIQT5753RBLAEVBBP","short_pith_number":"pith:I2A5YTCI","schema_version":"1.0","canonical_sha256":"4681dc4c48429109f7fddc42b012a10bdfc7ef195f7c8cb82111872c26ff4b3f","source":{"kind":"arxiv","id":"2008.05188","version":2},"attestation_state":"computed","paper":{"title":"The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Gil Kalai","submitted_at":"2020-08-12T09:11:55Z","abstract_excerpt":"My 2018 lecture at the ICA workshop in Singapore dealt with quantum computation as a meeting point of the laws of computation and the laws of quantum mechanics. We described a computational complexity argument against the feasibility of quantum computers: we identified a very low-level complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explained why it would allow neither good-quality quantum error-correction nor a demonstration of \"quantum supremacy,\" namely, the ability of quantum computers to make computations that are impossible or ex"},"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.05188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-08-12T09:11:55Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f28d4b9bfe9bde73d9c2585a57b8a3648295300fcc72a20095506f9408a76461","abstract_canon_sha256":"22e505ca5da2dda40364513a3f116202ee35f99bc367d91ca58b950b519ab416"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:26.951107Z","signature_b64":"mNPU2dQ209YkEQSR+d9Em1XbVb1C52BfczHmopnuYAsgMOci0Atv+Dwy6C01iQFJt8WmB0Gj7HwvNtDXL6PlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4681dc4c48429109f7fddc42b012a10bdfc7ef195f7c8cb82111872c26ff4b3f","last_reissued_at":"2026-07-05T02:26:26.950650Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:26.950650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Gil Kalai","submitted_at":"2020-08-12T09:11:55Z","abstract_excerpt":"My 2018 lecture at the ICA workshop in Singapore dealt with quantum computation as a meeting point of the laws of computation and the laws of quantum mechanics. We described a computational complexity argument against the feasibility of quantum computers: we identified a very low-level complexity class of probability distributions described by noisy intermediate-scale quantum computers, and explained why it would allow neither good-quality quantum error-correction nor a demonstration of \"quantum supremacy,\" namely, the ability of quantum computers to make computations that are impossible or ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.05188","kind":"arxiv","version":2},"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.05188/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.05188","created_at":"2026-07-05T02:26:26.950705+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.05188v2","created_at":"2026-07-05T02:26:26.950705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.05188","created_at":"2026-07-05T02:26:26.950705+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2A5YTCIIKIQ","created_at":"2026-07-05T02:26:26.950705+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2A5YTCIIKIQT575","created_at":"2026-07-05T02:26:26.950705+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2A5YTCI","created_at":"2026-07-05T02:26:26.950705+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00315","citing_title":"Feasibilism, Explication, and the Cobham-Edmonds Thesis","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2A5YTCIIKIQT5753RBLAEVBBP","json":"https://pith.science/pith/I2A5YTCIIKIQT5753RBLAEVBBP.json","graph_json":"https://pith.science/api/pith-number/I2A5YTCIIKIQT5753RBLAEVBBP/graph.json","events_json":"https://pith.science/api/pith-number/I2A5YTCIIKIQT5753RBLAEVBBP/events.json","paper":"https://pith.science/paper/I2A5YTCI"},"agent_actions":{"view_html":"https://pith.science/pith/I2A5YTCIIKIQT5753RBLAEVBBP","download_json":"https://pith.science/pith/I2A5YTCIIKIQT5753RBLAEVBBP.json","view_paper":"https://pith.science/paper/I2A5YTCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.05188&json=true","fetch_graph":"https://pith.science/api/pith-number/I2A5YTCIIKIQT5753RBLAEVBBP/graph.json","fetch_events":"https://pith.science/api/pith-number/I2A5YTCIIKIQT5753RBLAEVBBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2A5YTCIIKIQT5753RBLAEVBBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2A5YTCIIKIQT5753RBLAEVBBP/action/storage_attestation","attest_author":"https://pith.science/pith/I2A5YTCIIKIQT5753RBLAEVBBP/action/author_attestation","sign_citation":"https://pith.science/pith/I2A5YTCIIKIQT5753RBLAEVBBP/action/citation_signature","submit_replication":"https://pith.science/pith/I2A5YTCIIKIQT5753RBLAEVBBP/action/replication_record"}},"created_at":"2026-07-05T02:26:26.950705+00:00","updated_at":"2026-07-05T02:26:26.950705+00:00"}