{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CUB3FCEHQVBPED336IB4DVSTB3","short_pith_number":"pith:CUB3FCEH","schema_version":"1.0","canonical_sha256":"1503b288878542f20f7bf203c1d6530ed15d625092749f8b8ef082218249318f","source":{"kind":"arxiv","id":"1902.02398","version":1},"attestation_state":"computed","paper":{"title":"$\\mathsf{QMA}$ Lower Bounds for Approximate Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"William Kretschmer","submitted_at":"2019-02-06T21:02:12Z","abstract_excerpt":"We prove a query complexity lower bound for $\\mathsf{QMA}$ protocols that solve approximate counting: estimating the size of a set given a membership oracle. This gives rise to an oracle $A$ such that $\\mathsf{SBP}^A \\not\\subset \\mathsf{QMA}^A$, resolving an open problem of Aaronson [2]. Our proof uses the polynomial method to derive a lower bound for the $\\mathsf{SBQP}$ query complexity of the $\\mathsf{AND}$ of two approximate counting instances. We use Laurent polynomials as a tool in our proof, showing that the \"Laurent polynomial method\" can be useful even for problems involving ordinary p"},"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":"1902.02398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-06T21:02:12Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"ff3e7933bb9018a66299e4f2e483a43d132b3620e76f02d3180de2ba5c2268f6","abstract_canon_sha256":"493b77290baab3f8537a7ac7f3a22de26f0f79c6fdb1074ca11de3ef57cfa0a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:33.498616Z","signature_b64":"Y4T2HkrlhSHC6nYydNx4xF+ZkZqyUx7QszzYAgZOroLHQCL97O1O7cIX2Nm9xU54+CRKmnUjL/mZHE4qlR9UBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1503b288878542f20f7bf203c1d6530ed15d625092749f8b8ef082218249318f","last_reissued_at":"2026-05-17T23:54:33.497903Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:33.497903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\mathsf{QMA}$ Lower Bounds for Approximate Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"William Kretschmer","submitted_at":"2019-02-06T21:02:12Z","abstract_excerpt":"We prove a query complexity lower bound for $\\mathsf{QMA}$ protocols that solve approximate counting: estimating the size of a set given a membership oracle. This gives rise to an oracle $A$ such that $\\mathsf{SBP}^A \\not\\subset \\mathsf{QMA}^A$, resolving an open problem of Aaronson [2]. Our proof uses the polynomial method to derive a lower bound for the $\\mathsf{SBQP}$ query complexity of the $\\mathsf{AND}$ of two approximate counting instances. We use Laurent polynomials as a tool in our proof, showing that the \"Laurent polynomial method\" can be useful even for problems involving ordinary p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02398","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":"1902.02398","created_at":"2026-05-17T23:54:33.498021+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02398v1","created_at":"2026-05-17T23:54:33.498021+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02398","created_at":"2026-05-17T23:54:33.498021+00:00"},{"alias_kind":"pith_short_12","alias_value":"CUB3FCEHQVBP","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CUB3FCEHQVBPED33","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CUB3FCEH","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19298","citing_title":"Quantum Counting in the Rydberg Blockade","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CUB3FCEHQVBPED336IB4DVSTB3","json":"https://pith.science/pith/CUB3FCEHQVBPED336IB4DVSTB3.json","graph_json":"https://pith.science/api/pith-number/CUB3FCEHQVBPED336IB4DVSTB3/graph.json","events_json":"https://pith.science/api/pith-number/CUB3FCEHQVBPED336IB4DVSTB3/events.json","paper":"https://pith.science/paper/CUB3FCEH"},"agent_actions":{"view_html":"https://pith.science/pith/CUB3FCEHQVBPED336IB4DVSTB3","download_json":"https://pith.science/pith/CUB3FCEHQVBPED336IB4DVSTB3.json","view_paper":"https://pith.science/paper/CUB3FCEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02398&json=true","fetch_graph":"https://pith.science/api/pith-number/CUB3FCEHQVBPED336IB4DVSTB3/graph.json","fetch_events":"https://pith.science/api/pith-number/CUB3FCEHQVBPED336IB4DVSTB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CUB3FCEHQVBPED336IB4DVSTB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CUB3FCEHQVBPED336IB4DVSTB3/action/storage_attestation","attest_author":"https://pith.science/pith/CUB3FCEHQVBPED336IB4DVSTB3/action/author_attestation","sign_citation":"https://pith.science/pith/CUB3FCEHQVBPED336IB4DVSTB3/action/citation_signature","submit_replication":"https://pith.science/pith/CUB3FCEHQVBPED336IB4DVSTB3/action/replication_record"}},"created_at":"2026-05-17T23:54:33.498021+00:00","updated_at":"2026-05-17T23:54:33.498021+00:00"}