{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:E6JJSNN3QAJAYGCLJOWIGI5LXB","short_pith_number":"pith:E6JJSNN3","schema_version":"1.0","canonical_sha256":"27929935bb80120c184b4bac8323abb86d608c64ec6c4baf4c2a61aa3df59f52","source":{"kind":"arxiv","id":"2411.00946","version":1},"attestation_state":"computed","paper":{"title":"Classical versus quantum queries in quantum PCPs with classical proofs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall, Harry Buhrman, Jordi Weggemans","submitted_at":"2024-11-01T18:00:56Z","abstract_excerpt":"We generalize quantum-classical PCPs, first introduced by Weggemans, Folkertsma and Cade (TQC 2024), to allow for $q$ quantum queries to a polynomially-sized classical proof ($\\mathsf{QCPCP}_{Q,c,s}[q]$). Exploiting a connection with the polynomial method, we prove that for any constant $q$, promise gap $c-s = \\Omega(1/\\text{poly}(n))$ and $\\delta>0$, we have $\\mathsf{QCPCP}_{Q,c,s}[q] \\subseteq \\mathsf{QCPCP}_{1-\\delta,1/2+\\delta}[3] \\subseteq \\mathsf{BQ} \\cdot \\mathsf{NP}$, where $\\mathsf{BQ} \\cdot \\mathsf{NP}$ is the class of promise problems with quantum reductions to an $\\mathsf{NP}$-comp"},"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":"2411.00946","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-01T18:00:56Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2231394a8200aa32c0f59d53de5346367795bcf810bb7baee85f6439637a1b35","abstract_canon_sha256":"90bc47e652dc8d4e4039a2c733096d7bda669ac6876ef01be8bc94bb6362f843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:52.717802Z","signature_b64":"HvX2QIZHKck2iCSA7dT+wEBnUQxWHz8ag2AG/nzZ0X9Y9rvoZ2vmRq8V4k2zlH9/UGzPNGLse+lgTSzLDk5DDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27929935bb80120c184b4bac8323abb86d608c64ec6c4baf4c2a61aa3df59f52","last_reissued_at":"2026-07-05T09:29:52.717402Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:52.717402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Classical versus quantum queries in quantum PCPs with classical proofs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall, Harry Buhrman, Jordi Weggemans","submitted_at":"2024-11-01T18:00:56Z","abstract_excerpt":"We generalize quantum-classical PCPs, first introduced by Weggemans, Folkertsma and Cade (TQC 2024), to allow for $q$ quantum queries to a polynomially-sized classical proof ($\\mathsf{QCPCP}_{Q,c,s}[q]$). Exploiting a connection with the polynomial method, we prove that for any constant $q$, promise gap $c-s = \\Omega(1/\\text{poly}(n))$ and $\\delta>0$, we have $\\mathsf{QCPCP}_{Q,c,s}[q] \\subseteq \\mathsf{QCPCP}_{1-\\delta,1/2+\\delta}[3] \\subseteq \\mathsf{BQ} \\cdot \\mathsf{NP}$, where $\\mathsf{BQ} \\cdot \\mathsf{NP}$ is the class of promise problems with quantum reductions to an $\\mathsf{NP}$-comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.00946","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/2411.00946/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":"2411.00946","created_at":"2026-07-05T09:29:52.717461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.00946v1","created_at":"2026-07-05T09:29:52.717461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.00946","created_at":"2026-07-05T09:29:52.717461+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6JJSNN3QAJA","created_at":"2026-07-05T09:29:52.717461+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6JJSNN3QAJAYGCL","created_at":"2026-07-05T09:29:52.717461+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6JJSNN3","created_at":"2026-07-05T09:29:52.717461+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":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E6JJSNN3QAJAYGCLJOWIGI5LXB","json":"https://pith.science/pith/E6JJSNN3QAJAYGCLJOWIGI5LXB.json","graph_json":"https://pith.science/api/pith-number/E6JJSNN3QAJAYGCLJOWIGI5LXB/graph.json","events_json":"https://pith.science/api/pith-number/E6JJSNN3QAJAYGCLJOWIGI5LXB/events.json","paper":"https://pith.science/paper/E6JJSNN3"},"agent_actions":{"view_html":"https://pith.science/pith/E6JJSNN3QAJAYGCLJOWIGI5LXB","download_json":"https://pith.science/pith/E6JJSNN3QAJAYGCLJOWIGI5LXB.json","view_paper":"https://pith.science/paper/E6JJSNN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.00946&json=true","fetch_graph":"https://pith.science/api/pith-number/E6JJSNN3QAJAYGCLJOWIGI5LXB/graph.json","fetch_events":"https://pith.science/api/pith-number/E6JJSNN3QAJAYGCLJOWIGI5LXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6JJSNN3QAJAYGCLJOWIGI5LXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6JJSNN3QAJAYGCLJOWIGI5LXB/action/storage_attestation","attest_author":"https://pith.science/pith/E6JJSNN3QAJAYGCLJOWIGI5LXB/action/author_attestation","sign_citation":"https://pith.science/pith/E6JJSNN3QAJAYGCLJOWIGI5LXB/action/citation_signature","submit_replication":"https://pith.science/pith/E6JJSNN3QAJAYGCLJOWIGI5LXB/action/replication_record"}},"created_at":"2026-07-05T09:29:52.717461+00:00","updated_at":"2026-07-05T09:29:52.717461+00:00"}