{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CUB3FCEHQVBPED336IB4DVSTB3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"493b77290baab3f8537a7ac7f3a22de26f0f79c6fdb1074ca11de3ef57cfa0a2","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-06T21:02:12Z","title_canon_sha256":"ff3e7933bb9018a66299e4f2e483a43d132b3620e76f02d3180de2ba5c2268f6"},"schema_version":"1.0","source":{"id":"1902.02398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.02398","created_at":"2026-05-17T23:54:33Z"},{"alias_kind":"arxiv_version","alias_value":"1902.02398v1","created_at":"2026-05-17T23:54:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02398","created_at":"2026-05-17T23:54:33Z"},{"alias_kind":"pith_short_12","alias_value":"CUB3FCEHQVBP","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CUB3FCEHQVBPED33","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CUB3FCEH","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:66d31db52f2931293f9c080822315844679273d63a216237d65a3d58e467cf04","target":"graph","created_at":"2026-05-17T23:54:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"William Kretschmer","cross_cats":["quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-06T21:02:12Z","title":"$\\mathsf{QMA}$ Lower Bounds for Approximate Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02398","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c8573f1e2d7e56802bbecc5f5af051b8c0d990b68758f0640d8305ac520d3f58","target":"record","created_at":"2026-05-17T23:54:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"493b77290baab3f8537a7ac7f3a22de26f0f79c6fdb1074ca11de3ef57cfa0a2","cross_cats_sorted":["quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-06T21:02:12Z","title_canon_sha256":"ff3e7933bb9018a66299e4f2e483a43d132b3620e76f02d3180de2ba5c2268f6"},"schema_version":"1.0","source":{"id":"1902.02398","kind":"arxiv","version":1}},"canonical_sha256":"1503b288878542f20f7bf203c1d6530ed15d625092749f8b8ef082218249318f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1503b288878542f20f7bf203c1d6530ed15d625092749f8b8ef082218249318f","first_computed_at":"2026-05-17T23:54:33.497903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:33.497903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y4T2HkrlhSHC6nYydNx4xF+ZkZqyUx7QszzYAgZOroLHQCL97O1O7cIX2Nm9xU54+CRKmnUjL/mZHE4qlR9UBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:33.498616Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.02398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8573f1e2d7e56802bbecc5f5af051b8c0d990b68758f0640d8305ac520d3f58","sha256:66d31db52f2931293f9c080822315844679273d63a216237d65a3d58e467cf04"],"state_sha256":"ad907887e21992997b22140839789cee3ed5813f34b37b6da204ad3dd2a0c045"}