{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:PBBACDXB4NBNZ2HYPHRCMSOM7V","short_pith_number":"pith:PBBACDXB","schema_version":"1.0","canonical_sha256":"7842010ee1e342dce8f879e22649ccfd74e351b998987a66d0777ee65a61d61a","source":{"kind":"arxiv","id":"quant-ph/0308125","version":1},"attestation_state":"computed","paper":{"title":"Quantum NP and a Quantum Hierarchy","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Tomoyuki Yamakami","submitted_at":"2003-08-23T20:39:56Z","abstract_excerpt":"The complexity class NP is quintessential and ubiquitous in theoretical computer science. Two different approaches have been made to define \"Quantum NP,\" the quantum analogue of NP: NQP by Adleman, DeMarrais, and Huang, and QMA by Knill, Kitaev, and Watrous. From an operator point of view, NP can be viewed as the result of the exists-operator applied to P. Recently, Green, Homer, Moore, and Pollett proposed its quantum version, called the N-operator, which is an abstraction of NQP. This paper introduces the exists^{Q}-operator, which is an abstraction of QMA, and its complement, the forall^{Q}"},"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/0308125","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2003-08-23T20:39:56Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"429c622e99d11757d4eb81dd4aefaaba98aaa0c1f8a2969405ccf69b5123e2e9","abstract_canon_sha256":"bf8193d2c50bebd8cfcab0d428066057b7451b7536ba853fbc00384501c27d03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:46:23.520708Z","signature_b64":"caqY60pZdzmiJqr6PC0KbGNYAhK3Gdutf0mvFjN/sC7/+tHnmCeiopChTX9rfNt4pt8M8FHpYIcAyonKHiCqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7842010ee1e342dce8f879e22649ccfd74e351b998987a66d0777ee65a61d61a","last_reissued_at":"2026-07-04T14:46:23.520299Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:46:23.520299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum NP and a Quantum Hierarchy","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Tomoyuki Yamakami","submitted_at":"2003-08-23T20:39:56Z","abstract_excerpt":"The complexity class NP is quintessential and ubiquitous in theoretical computer science. Two different approaches have been made to define \"Quantum NP,\" the quantum analogue of NP: NQP by Adleman, DeMarrais, and Huang, and QMA by Knill, Kitaev, and Watrous. From an operator point of view, NP can be viewed as the result of the exists-operator applied to P. Recently, Green, Homer, Moore, and Pollett proposed its quantum version, called the N-operator, which is an abstraction of NQP. This paper introduces the exists^{Q}-operator, which is an abstraction of QMA, and its complement, the forall^{Q}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0308125","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/0308125/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/0308125","created_at":"2026-07-04T14:46:23.520372+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0308125v1","created_at":"2026-07-04T14:46:23.520372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0308125","created_at":"2026-07-04T14:46:23.520372+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBBACDXB4NBN","created_at":"2026-07-04T14:46:23.520372+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBBACDXB4NBNZ2HY","created_at":"2026-07-04T14:46:23.520372+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBBACDXB","created_at":"2026-07-04T14:46:23.520372+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19792","citing_title":"Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBBACDXB4NBNZ2HYPHRCMSOM7V","json":"https://pith.science/pith/PBBACDXB4NBNZ2HYPHRCMSOM7V.json","graph_json":"https://pith.science/api/pith-number/PBBACDXB4NBNZ2HYPHRCMSOM7V/graph.json","events_json":"https://pith.science/api/pith-number/PBBACDXB4NBNZ2HYPHRCMSOM7V/events.json","paper":"https://pith.science/paper/PBBACDXB"},"agent_actions":{"view_html":"https://pith.science/pith/PBBACDXB4NBNZ2HYPHRCMSOM7V","download_json":"https://pith.science/pith/PBBACDXB4NBNZ2HYPHRCMSOM7V.json","view_paper":"https://pith.science/paper/PBBACDXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0308125&json=true","fetch_graph":"https://pith.science/api/pith-number/PBBACDXB4NBNZ2HYPHRCMSOM7V/graph.json","fetch_events":"https://pith.science/api/pith-number/PBBACDXB4NBNZ2HYPHRCMSOM7V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBBACDXB4NBNZ2HYPHRCMSOM7V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBBACDXB4NBNZ2HYPHRCMSOM7V/action/storage_attestation","attest_author":"https://pith.science/pith/PBBACDXB4NBNZ2HYPHRCMSOM7V/action/author_attestation","sign_citation":"https://pith.science/pith/PBBACDXB4NBNZ2HYPHRCMSOM7V/action/citation_signature","submit_replication":"https://pith.science/pith/PBBACDXB4NBNZ2HYPHRCMSOM7V/action/replication_record"}},"created_at":"2026-07-04T14:46:23.520372+00:00","updated_at":"2026-07-04T14:46:23.520372+00:00"}