{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:TGVSAKD5V4LUDAVR56HLJRDY43","short_pith_number":"pith:TGVSAKD5","schema_version":"1.0","canonical_sha256":"99ab20287daf174182b1ef8eb4c478e6cfa222166d12471a0acde11487096704","source":{"kind":"arxiv","id":"0709.0738","version":2},"attestation_state":"computed","paper":{"title":"A quantum characterization of NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alain Tapp, Hugue Blier","submitted_at":"2007-09-05T20:25:53Z","abstract_excerpt":"In this article we introduce a new complexity class called PQMA_log(2). Informally, this is the class of languages for which membership has a logarithmic-size quantum proof with perfect completeness and soundness which is polynomially close to 1 in a context where the verifier is provided a proof with two unentangled parts. We then show that PQMA_log(2) = NP. For this to be possible, it is important, when defining the class, not to give too much power to the verifier. This result, when compared to the fact that QMA_log = BQP, gives us new insight on the power of quantum information and the imp"},"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":"0709.0738","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2007-09-05T20:25:53Z","cross_cats_sorted":[],"title_canon_sha256":"390918d9b2a90fdb2a97b87b76cc23660b312fa524364dad4338a19765931752","abstract_canon_sha256":"53f771b1be782d5677dbfacbbd381ae117bd9aed5b03edbdaa77ef4ae7a6bb07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:58.758094Z","signature_b64":"hFkWfaZhtcHHXAwwonIPiuKXUaGmsNuxuPrccDbCRcRqqfsiD/SiVV3koS0s6/ekij5q0VB+eS+60BlXHsiYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99ab20287daf174182b1ef8eb4c478e6cfa222166d12471a0acde11487096704","last_reissued_at":"2026-05-18T00:56:58.757470Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:58.757470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantum characterization of NP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alain Tapp, Hugue Blier","submitted_at":"2007-09-05T20:25:53Z","abstract_excerpt":"In this article we introduce a new complexity class called PQMA_log(2). Informally, this is the class of languages for which membership has a logarithmic-size quantum proof with perfect completeness and soundness which is polynomially close to 1 in a context where the verifier is provided a proof with two unentangled parts. We then show that PQMA_log(2) = NP. For this to be possible, it is important, when defining the class, not to give too much power to the verifier. This result, when compared to the fact that QMA_log = BQP, gives us new insight on the power of quantum information and the imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.0738","kind":"arxiv","version":2},"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":"0709.0738","created_at":"2026-05-18T00:56:58.757570+00:00"},{"alias_kind":"arxiv_version","alias_value":"0709.0738v2","created_at":"2026-05-18T00:56:58.757570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.0738","created_at":"2026-05-18T00:56:58.757570+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGVSAKD5V4LU","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGVSAKD5V4LUDAVR","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGVSAKD5","created_at":"2026-05-18T12:25:56.245647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.16249","citing_title":"The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TGVSAKD5V4LUDAVR56HLJRDY43","json":"https://pith.science/pith/TGVSAKD5V4LUDAVR56HLJRDY43.json","graph_json":"https://pith.science/api/pith-number/TGVSAKD5V4LUDAVR56HLJRDY43/graph.json","events_json":"https://pith.science/api/pith-number/TGVSAKD5V4LUDAVR56HLJRDY43/events.json","paper":"https://pith.science/paper/TGVSAKD5"},"agent_actions":{"view_html":"https://pith.science/pith/TGVSAKD5V4LUDAVR56HLJRDY43","download_json":"https://pith.science/pith/TGVSAKD5V4LUDAVR56HLJRDY43.json","view_paper":"https://pith.science/paper/TGVSAKD5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0709.0738&json=true","fetch_graph":"https://pith.science/api/pith-number/TGVSAKD5V4LUDAVR56HLJRDY43/graph.json","fetch_events":"https://pith.science/api/pith-number/TGVSAKD5V4LUDAVR56HLJRDY43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGVSAKD5V4LUDAVR56HLJRDY43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGVSAKD5V4LUDAVR56HLJRDY43/action/storage_attestation","attest_author":"https://pith.science/pith/TGVSAKD5V4LUDAVR56HLJRDY43/action/author_attestation","sign_citation":"https://pith.science/pith/TGVSAKD5V4LUDAVR56HLJRDY43/action/citation_signature","submit_replication":"https://pith.science/pith/TGVSAKD5V4LUDAVR56HLJRDY43/action/replication_record"}},"created_at":"2026-05-18T00:56:58.757570+00:00","updated_at":"2026-05-18T00:56:58.757570+00:00"}