{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZFFEVJ7IMOR22HOKMKNKH4U5TH","short_pith_number":"pith:ZFFEVJ7I","schema_version":"1.0","canonical_sha256":"c94a4aa7e863a3ad1dca629aa3f29d99f07bda1484963f373895e6129e53b0d5","source":{"kind":"arxiv","id":"2410.20935","version":1},"attestation_state":"computed","paper":{"title":"Improved separation between quantum and classical computers for sampling and functional tasks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson, Simon C. Marshall, Vedran Dunjko","submitted_at":"2024-10-28T11:30:10Z","abstract_excerpt":"This paper furthers existing evidence that quantum computers are capable of computations beyond classical computers. Specifically, we strengthen the collapse of the polynomial hierarchy to the second level if: (i) Quantum computers with postselection are as powerful as classical computers with postselection ($\\mathsf{PostBQP=PostBPP}$), (ii) any one of several quantum sampling experiments ($\\mathsf{BosonSampling}$, $\\mathsf{IQP}$, $\\mathsf{DQC1}$) can be approximately performed by a classical computer (contingent on existing assumptions). This last result implies that if any of these experimen"},"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":"2410.20935","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2024-10-28T11:30:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"95f00bd4ab7e0be380b2373ca848dfbeb6fc15ba2c177637e786072c85489c98","abstract_canon_sha256":"026a5997c7929744c603c1b1bac977e7663ba8a2ea5981f8c5291aaa36eb9ae6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:13.305858Z","signature_b64":"+crCYpOCIGW+0/I36+KatxnsO9FhjnXRp2sqPlThsS0ITNyWWzGTcmqlGFPgkyD88/H9VuxbU4kH4Up0EEi4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c94a4aa7e863a3ad1dca629aa3f29d99f07bda1484963f373895e6129e53b0d5","last_reissued_at":"2026-07-05T09:27:13.305440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:13.305440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved separation between quantum and classical computers for sampling and functional tasks","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson, Simon C. Marshall, Vedran Dunjko","submitted_at":"2024-10-28T11:30:10Z","abstract_excerpt":"This paper furthers existing evidence that quantum computers are capable of computations beyond classical computers. Specifically, we strengthen the collapse of the polynomial hierarchy to the second level if: (i) Quantum computers with postselection are as powerful as classical computers with postselection ($\\mathsf{PostBQP=PostBPP}$), (ii) any one of several quantum sampling experiments ($\\mathsf{BosonSampling}$, $\\mathsf{IQP}$, $\\mathsf{DQC1}$) can be approximately performed by a classical computer (contingent on existing assumptions). This last result implies that if any of these experimen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20935","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/2410.20935/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":"2410.20935","created_at":"2026-07-05T09:27:13.305502+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20935v1","created_at":"2026-07-05T09:27:13.305502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20935","created_at":"2026-07-05T09:27:13.305502+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFFEVJ7IMOR2","created_at":"2026-07-05T09:27:13.305502+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFFEVJ7IMOR22HOK","created_at":"2026-07-05T09:27:13.305502+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFFEVJ7I","created_at":"2026-07-05T09:27:13.305502+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06675","citing_title":"Spectral Born machines: classically trainable quantum generative models for discrete data","ref_index":47,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28236","citing_title":"Qudit extension of parameterized IQP circuits: A generative quantum machine learning approach to integer data","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2501.04776","citing_title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZFFEVJ7IMOR22HOKMKNKH4U5TH","json":"https://pith.science/pith/ZFFEVJ7IMOR22HOKMKNKH4U5TH.json","graph_json":"https://pith.science/api/pith-number/ZFFEVJ7IMOR22HOKMKNKH4U5TH/graph.json","events_json":"https://pith.science/api/pith-number/ZFFEVJ7IMOR22HOKMKNKH4U5TH/events.json","paper":"https://pith.science/paper/ZFFEVJ7I"},"agent_actions":{"view_html":"https://pith.science/pith/ZFFEVJ7IMOR22HOKMKNKH4U5TH","download_json":"https://pith.science/pith/ZFFEVJ7IMOR22HOKMKNKH4U5TH.json","view_paper":"https://pith.science/paper/ZFFEVJ7I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20935&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFFEVJ7IMOR22HOKMKNKH4U5TH/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFFEVJ7IMOR22HOKMKNKH4U5TH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFFEVJ7IMOR22HOKMKNKH4U5TH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFFEVJ7IMOR22HOKMKNKH4U5TH/action/storage_attestation","attest_author":"https://pith.science/pith/ZFFEVJ7IMOR22HOKMKNKH4U5TH/action/author_attestation","sign_citation":"https://pith.science/pith/ZFFEVJ7IMOR22HOKMKNKH4U5TH/action/citation_signature","submit_replication":"https://pith.science/pith/ZFFEVJ7IMOR22HOKMKNKH4U5TH/action/replication_record"}},"created_at":"2026-07-05T09:27:13.305502+00:00","updated_at":"2026-07-05T09:27:13.305502+00:00"}