{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:SC42J4UXRIYSUJK6JGBDVSGV43","short_pith_number":"pith:SC42J4UX","schema_version":"1.0","canonical_sha256":"90b9a4f2978a312a255e49823ac8d5e6c9dc4a499abd2f1b36c1e79da43c4603","source":{"kind":"arxiv","id":"quant-ph/0412187","version":1},"attestation_state":"computed","paper":{"title":"Quantum Computing, Postselection, and Probabilistic Polynomial-Time","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson","submitted_at":"2004-12-23T15:09:31Z","abstract_excerpt":"I study the class of problems efficiently solvable by a quantum computer, given the ability to \"postselect\" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic Polynomial-Time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. The result also implies, as an easy corollary, a celebrated theorem of Beigel, Reingold, and Spielman that PP is closed under intersection, as well as a generalization of that theorem due to Fortnow and R"},"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":"quant-ph/0412187","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2004-12-23T15:09:31Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4109c37dc342cdf4346d76e7ddc5ad2283b5aaf0427e33b0696e3b37ae017d16","abstract_canon_sha256":"c28f06b77d8f7f2554dace3bf19d2e43b6d564ecd42f2aa13eee966fefa6a0cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:53.547492Z","signature_b64":"Q3QphAjaS1JVXHqkWS+hHO56hBmiKUCRZb/tgAaFo29Yn5pwst6Rj+zeD9D80kGT7njWgykIG9YtuupyxJxXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90b9a4f2978a312a255e49823ac8d5e6c9dc4a499abd2f1b36c1e79da43c4603","last_reissued_at":"2026-07-04T14:46:53.547091Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:53.547091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Computing, Postselection, and Probabilistic Polynomial-Time","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Scott Aaronson","submitted_at":"2004-12-23T15:09:31Z","abstract_excerpt":"I study the class of problems efficiently solvable by a quantum computer, given the ability to \"postselect\" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic Polynomial-Time. Using this result, I show that several simple changes to the axioms of quantum mechanics would let us solve PP-complete problems efficiently. The result also implies, as an easy corollary, a celebrated theorem of Beigel, Reingold, and Spielman that PP is closed under intersection, as well as a generalization of that theorem due to Fortnow and R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0412187","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/quant-ph/0412187/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":"quant-ph/0412187","created_at":"2026-07-04T14:46:53.547158+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0412187v1","created_at":"2026-07-04T14:46:53.547158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0412187","created_at":"2026-07-04T14:46:53.547158+00:00"},{"alias_kind":"pith_short_12","alias_value":"SC42J4UXRIYS","created_at":"2026-07-04T14:46:53.547158+00:00"},{"alias_kind":"pith_short_16","alias_value":"SC42J4UXRIYSUJK6","created_at":"2026-07-04T14:46:53.547158+00:00"},{"alias_kind":"pith_short_8","alias_value":"SC42J4UX","created_at":"2026-07-04T14:46:53.547158+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.14275","citing_title":"Generalized Complexity Distances and Non-Invertible Symmetries","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43","json":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43.json","graph_json":"https://pith.science/api/pith-number/SC42J4UXRIYSUJK6JGBDVSGV43/graph.json","events_json":"https://pith.science/api/pith-number/SC42J4UXRIYSUJK6JGBDVSGV43/events.json","paper":"https://pith.science/paper/SC42J4UX"},"agent_actions":{"view_html":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43","download_json":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43.json","view_paper":"https://pith.science/paper/SC42J4UX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0412187&json=true","fetch_graph":"https://pith.science/api/pith-number/SC42J4UXRIYSUJK6JGBDVSGV43/graph.json","fetch_events":"https://pith.science/api/pith-number/SC42J4UXRIYSUJK6JGBDVSGV43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43/action/storage_attestation","attest_author":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43/action/author_attestation","sign_citation":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43/action/citation_signature","submit_replication":"https://pith.science/pith/SC42J4UXRIYSUJK6JGBDVSGV43/action/replication_record"}},"created_at":"2026-07-04T14:46:53.547158+00:00","updated_at":"2026-07-04T14:46:53.547158+00:00"}