{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:J4GBZXCOFTYEDT5C7S5KNNLSBG","short_pith_number":"pith:J4GBZXCO","schema_version":"1.0","canonical_sha256":"4f0c1cdc4e2cf041cfa2fcbaa6b57209a145f0e729464d2a30019bb59bd2421a","source":{"kind":"arxiv","id":"1005.1407","version":1},"attestation_state":"computed","paper":{"title":"Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dan J. Shepherd, Michael J. Bremner, Richard Jozsa","submitted_at":"2010-05-09T16:37:11Z","abstract_excerpt":"We consider quantum computations comprising only commuting gates, known as IQP computations, and provide compelling evidence that the task of sampling their output probability distributions is unlikely to be achievable by any efficient classical means. More specifically we introduce the class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selection, and prove first that post-IQP equals the classical class PP. Using this result we show that if the output distributions of uniform IQP circuit families could be classically efficiently sampled, even u"},"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":"1005.1407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-05-09T16:37:11Z","cross_cats_sorted":[],"title_canon_sha256":"9502ad2a78aaac65840f649f534647d9cf0848c88dba876ce3a7567e77952335","abstract_canon_sha256":"46941dce158d4961768d33f49d69449ffaa918852db1fb874bdd063cbc194ba2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:48.928149Z","signature_b64":"JheiqrWsh0jTi0OCX9fYDNjp7RMwpvVNUIo/IjftOBQFEWpYNHiXpHmEvSsMGJGjfEREH0nrrw4OPZv12LFLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f0c1cdc4e2cf041cfa2fcbaa6b57209a145f0e729464d2a30019bb59bd2421a","last_reissued_at":"2026-05-18T04:35:48.927551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:48.927551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dan J. Shepherd, Michael J. Bremner, Richard Jozsa","submitted_at":"2010-05-09T16:37:11Z","abstract_excerpt":"We consider quantum computations comprising only commuting gates, known as IQP computations, and provide compelling evidence that the task of sampling their output probability distributions is unlikely to be achievable by any efficient classical means. More specifically we introduce the class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selection, and prove first that post-IQP equals the classical class PP. Using this result we show that if the output distributions of uniform IQP circuit families could be classically efficiently sampled, even u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1407","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":""},"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":"1005.1407","created_at":"2026-05-18T04:35:48.927642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.1407v1","created_at":"2026-05-18T04:35:48.927642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1407","created_at":"2026-05-18T04:35:48.927642+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4GBZXCOFTYE","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4GBZXCOFTYEDT5C","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4GBZXCO","created_at":"2026-05-18T12:26:09.077623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08224","citing_title":"The one clean qubit model without entanglement is classically simulable","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.07611","citing_title":"Compositional Quantum Heuristics for Max-Clique Detection","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4GBZXCOFTYEDT5C7S5KNNLSBG","json":"https://pith.science/pith/J4GBZXCOFTYEDT5C7S5KNNLSBG.json","graph_json":"https://pith.science/api/pith-number/J4GBZXCOFTYEDT5C7S5KNNLSBG/graph.json","events_json":"https://pith.science/api/pith-number/J4GBZXCOFTYEDT5C7S5KNNLSBG/events.json","paper":"https://pith.science/paper/J4GBZXCO"},"agent_actions":{"view_html":"https://pith.science/pith/J4GBZXCOFTYEDT5C7S5KNNLSBG","download_json":"https://pith.science/pith/J4GBZXCOFTYEDT5C7S5KNNLSBG.json","view_paper":"https://pith.science/paper/J4GBZXCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.1407&json=true","fetch_graph":"https://pith.science/api/pith-number/J4GBZXCOFTYEDT5C7S5KNNLSBG/graph.json","fetch_events":"https://pith.science/api/pith-number/J4GBZXCOFTYEDT5C7S5KNNLSBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4GBZXCOFTYEDT5C7S5KNNLSBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4GBZXCOFTYEDT5C7S5KNNLSBG/action/storage_attestation","attest_author":"https://pith.science/pith/J4GBZXCOFTYEDT5C7S5KNNLSBG/action/author_attestation","sign_citation":"https://pith.science/pith/J4GBZXCOFTYEDT5C7S5KNNLSBG/action/citation_signature","submit_replication":"https://pith.science/pith/J4GBZXCOFTYEDT5C7S5KNNLSBG/action/replication_record"}},"created_at":"2026-05-18T04:35:48.927642+00:00","updated_at":"2026-05-18T04:35:48.927642+00:00"}