{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ETXSZHE3OFQBSVDWVDUTG4FDVS","short_pith_number":"pith:ETXSZHE3","schema_version":"1.0","canonical_sha256":"24ef2c9c9b7160195476a8e93370a3ac8993cc0988e9034bcd3cab3003cf3425","source":{"kind":"arxiv","id":"1412.6507","version":1},"attestation_state":"computed","paper":{"title":"The space \"just above\" BQP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Adam Bouland, Joseph Fitzsimons, Mitchell Lee, Scott Aaronson","submitted_at":"2014-12-19T20:06:58Z","abstract_excerpt":"We explore the space \"just above\" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to an oracle. The class is defined by imagining that quantum computers can perform measurements that do not collapse the wavefunction. This (non-physical) model of computation can efficiently solve problems such as Graph Isomorphism and Approximate Shortest Vector which are believed to be intractable for quantum computers. Furthermore, it can search an unstructured N-element list in $\\tilde O$(N^{1/3}) time, but no faste"},"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":"1412.6507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-12-19T20:06:58Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cc91ddd5e518b6cd16c2e146dfb88191aa8d12c6330604731890a70a8544af25","abstract_canon_sha256":"0a084d6dcbcce4b2ac1413c6d0e87b8b5690a6d6d2e4fa517bdf3c6548c400cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:48.222685Z","signature_b64":"xu/kED4pY1lLssI6J32l/KlNCT9dwvKs0bYtbsiH8y7xn+adI+EUQvpXXBFHiN0c6rynj8kAv7ETr6VZ2oY6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24ef2c9c9b7160195476a8e93370a3ac8993cc0988e9034bcd3cab3003cf3425","last_reissued_at":"2026-05-18T02:30:48.222043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:48.222043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The space \"just above\" BQP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Adam Bouland, Joseph Fitzsimons, Mitchell Lee, Scott Aaronson","submitted_at":"2014-12-19T20:06:58Z","abstract_excerpt":"We explore the space \"just above\" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to an oracle. The class is defined by imagining that quantum computers can perform measurements that do not collapse the wavefunction. This (non-physical) model of computation can efficiently solve problems such as Graph Isomorphism and Approximate Shortest Vector which are believed to be intractable for quantum computers. Furthermore, it can search an unstructured N-element list in $\\tilde O$(N^{1/3}) time, but no faste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6507","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":"1412.6507","created_at":"2026-05-18T02:30:48.222147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6507v1","created_at":"2026-05-18T02:30:48.222147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6507","created_at":"2026-05-18T02:30:48.222147+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETXSZHE3OFQB","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETXSZHE3OFQBSVDW","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETXSZHE3","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ETXSZHE3OFQBSVDWVDUTG4FDVS","json":"https://pith.science/pith/ETXSZHE3OFQBSVDWVDUTG4FDVS.json","graph_json":"https://pith.science/api/pith-number/ETXSZHE3OFQBSVDWVDUTG4FDVS/graph.json","events_json":"https://pith.science/api/pith-number/ETXSZHE3OFQBSVDWVDUTG4FDVS/events.json","paper":"https://pith.science/paper/ETXSZHE3"},"agent_actions":{"view_html":"https://pith.science/pith/ETXSZHE3OFQBSVDWVDUTG4FDVS","download_json":"https://pith.science/pith/ETXSZHE3OFQBSVDWVDUTG4FDVS.json","view_paper":"https://pith.science/paper/ETXSZHE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6507&json=true","fetch_graph":"https://pith.science/api/pith-number/ETXSZHE3OFQBSVDWVDUTG4FDVS/graph.json","fetch_events":"https://pith.science/api/pith-number/ETXSZHE3OFQBSVDWVDUTG4FDVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETXSZHE3OFQBSVDWVDUTG4FDVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETXSZHE3OFQBSVDWVDUTG4FDVS/action/storage_attestation","attest_author":"https://pith.science/pith/ETXSZHE3OFQBSVDWVDUTG4FDVS/action/author_attestation","sign_citation":"https://pith.science/pith/ETXSZHE3OFQBSVDWVDUTG4FDVS/action/citation_signature","submit_replication":"https://pith.science/pith/ETXSZHE3OFQBSVDWVDUTG4FDVS/action/replication_record"}},"created_at":"2026-05-18T02:30:48.222147+00:00","updated_at":"2026-05-18T02:30:48.222147+00:00"}