{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CTY53FLY62LNQSWR26HBQ5KDYG","short_pith_number":"pith:CTY53FLY","schema_version":"1.0","canonical_sha256":"14f1dd9578f696d84ad1d78e187543c19f50d014e16c5e71f5f724f6ba9eb2a1","source":{"kind":"arxiv","id":"1910.12085","version":5},"attestation_state":"computed","paper":{"title":"On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Sam Gunn, Scott Aaronson","submitted_at":"2019-10-26T15:15:51Z","abstract_excerpt":"Recently, Google announced the first demonstration of quantum computational supremacy with a programmable superconducting processor. Their demonstration is based on collecting samples from the output distribution of a noisy random quantum circuit, then applying a statistical test to those samples called Linear Cross-Entropy Benchmarking (Linear XEB). This raises a theoretical question: how hard is it for a classical computer to spoof the results of the Linear XEB test? In this short note, we adapt an analysis of Aaronson and Chen [2017] to prove a conditional hardness result for Linear XEB spo"},"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":"1910.12085","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-26T15:15:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e2eab971527465a5f2cc59a9c3ae646e2460a65226e18056c36227cd3132cad8","abstract_canon_sha256":"fc12e038bb5a034872abef55f24b1897a1585a51fe3cf327ae4d1a3e13c58fce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:46.639327Z","signature_b64":"/nXYKxJX+IY1r7EICKwFBH2eEW0FENBW9bSKV6Ak6T+c99HilxoR6vKAtiOqUPQPiXhWqK9vZbMC+5kP/xxqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14f1dd9578f696d84ad1d78e187543c19f50d014e16c5e71f5f724f6ba9eb2a1","last_reissued_at":"2026-07-05T00:38:46.638822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:46.638822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Sam Gunn, Scott Aaronson","submitted_at":"2019-10-26T15:15:51Z","abstract_excerpt":"Recently, Google announced the first demonstration of quantum computational supremacy with a programmable superconducting processor. Their demonstration is based on collecting samples from the output distribution of a noisy random quantum circuit, then applying a statistical test to those samples called Linear Cross-Entropy Benchmarking (Linear XEB). This raises a theoretical question: how hard is it for a classical computer to spoof the results of the Linear XEB test? In this short note, we adapt an analysis of Aaronson and Chen [2017] to prove a conditional hardness result for Linear XEB spo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.12085","kind":"arxiv","version":5},"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/1910.12085/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":"1910.12085","created_at":"2026-07-05T00:38:46.638881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.12085v5","created_at":"2026-07-05T00:38:46.638881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.12085","created_at":"2026-07-05T00:38:46.638881+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTY53FLY62LN","created_at":"2026-07-05T00:38:46.638881+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTY53FLY62LNQSWR","created_at":"2026-07-05T00:38:46.638881+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTY53FLY","created_at":"2026-07-05T00:38:46.638881+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.22909","citing_title":"Sample-efficient benchmarking of shallow all-to-all random quantum circuits","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CTY53FLY62LNQSWR26HBQ5KDYG","json":"https://pith.science/pith/CTY53FLY62LNQSWR26HBQ5KDYG.json","graph_json":"https://pith.science/api/pith-number/CTY53FLY62LNQSWR26HBQ5KDYG/graph.json","events_json":"https://pith.science/api/pith-number/CTY53FLY62LNQSWR26HBQ5KDYG/events.json","paper":"https://pith.science/paper/CTY53FLY"},"agent_actions":{"view_html":"https://pith.science/pith/CTY53FLY62LNQSWR26HBQ5KDYG","download_json":"https://pith.science/pith/CTY53FLY62LNQSWR26HBQ5KDYG.json","view_paper":"https://pith.science/paper/CTY53FLY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.12085&json=true","fetch_graph":"https://pith.science/api/pith-number/CTY53FLY62LNQSWR26HBQ5KDYG/graph.json","fetch_events":"https://pith.science/api/pith-number/CTY53FLY62LNQSWR26HBQ5KDYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTY53FLY62LNQSWR26HBQ5KDYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTY53FLY62LNQSWR26HBQ5KDYG/action/storage_attestation","attest_author":"https://pith.science/pith/CTY53FLY62LNQSWR26HBQ5KDYG/action/author_attestation","sign_citation":"https://pith.science/pith/CTY53FLY62LNQSWR26HBQ5KDYG/action/citation_signature","submit_replication":"https://pith.science/pith/CTY53FLY62LNQSWR26HBQ5KDYG/action/replication_record"}},"created_at":"2026-07-05T00:38:46.638881+00:00","updated_at":"2026-07-05T00:38:46.638881+00:00"}