{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FCHQC5HGX33KKG5MBOEDUOAZOD","short_pith_number":"pith:FCHQC5HG","schema_version":"1.0","canonical_sha256":"288f0174e6bef6a51bac0b883a381970d1bfc30ae45e3a1a48b78ca240635092","source":{"kind":"arxiv","id":"1908.10846","version":6},"attestation_state":"computed","paper":{"title":"Quantum Approximate Counting, Simplified","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Patrick Rall, Scott Aaronson","submitted_at":"2019-08-28T17:34:40Z","abstract_excerpt":"In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a quantum algorithm for approximate counting. Given a list of $N$ items, $K$ of them marked, their algorithm estimates $K$ to within relative error $\\varepsilon$ by making only $O\\left( \\frac{1}{\\varepsilon}\\sqrt{\\frac{N}{K}}\\right) $ queries. Although this speedup is of \"Grover\" type, the BHMT algorithm has the curious feature of relying on the Quantum Fourier Transform (QFT), more commonly associated with Shor's algorithm. Is this necessary? This paper presents a simplified algorithm, which we prove achieves the same query complexity usin"},"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":"1908.10846","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-28T17:34:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c86e2160157d1d2ef64903f7a24e39f9b6b1f14d39f6621412706bb0863d191c","abstract_canon_sha256":"5ba0156bcdf1a37badba699da6428d23c0c18ebb7a5e39afdf202073a4f2880f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:57.645035Z","signature_b64":"yV7DIvOy5aS/H2gCFh9itLUSHIVJg06DR1ulVDzLenyTkrw3Zg/Wcm6BraUbvptRYSDhBN0xprpnEa6gjmaDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"288f0174e6bef6a51bac0b883a381970d1bfc30ae45e3a1a48b78ca240635092","last_reissued_at":"2026-07-05T03:28:57.644594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:57.644594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Approximate Counting, Simplified","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Patrick Rall, Scott Aaronson","submitted_at":"2019-08-28T17:34:40Z","abstract_excerpt":"In 1998, Brassard, Hoyer, Mosca, and Tapp (BHMT) gave a quantum algorithm for approximate counting. Given a list of $N$ items, $K$ of them marked, their algorithm estimates $K$ to within relative error $\\varepsilon$ by making only $O\\left( \\frac{1}{\\varepsilon}\\sqrt{\\frac{N}{K}}\\right) $ queries. Although this speedup is of \"Grover\" type, the BHMT algorithm has the curious feature of relying on the Quantum Fourier Transform (QFT), more commonly associated with Shor's algorithm. Is this necessary? This paper presents a simplified algorithm, which we prove achieves the same query complexity usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10846","kind":"arxiv","version":6},"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/1908.10846/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":"1908.10846","created_at":"2026-07-05T03:28:57.644655+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.10846v6","created_at":"2026-07-05T03:28:57.644655+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10846","created_at":"2026-07-05T03:28:57.644655+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCHQC5HGX33K","created_at":"2026-07-05T03:28:57.644655+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCHQC5HGX33KKG5M","created_at":"2026-07-05T03:28:57.644655+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCHQC5HG","created_at":"2026-07-05T03:28:57.644655+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCHQC5HGX33KKG5MBOEDUOAZOD","json":"https://pith.science/pith/FCHQC5HGX33KKG5MBOEDUOAZOD.json","graph_json":"https://pith.science/api/pith-number/FCHQC5HGX33KKG5MBOEDUOAZOD/graph.json","events_json":"https://pith.science/api/pith-number/FCHQC5HGX33KKG5MBOEDUOAZOD/events.json","paper":"https://pith.science/paper/FCHQC5HG"},"agent_actions":{"view_html":"https://pith.science/pith/FCHQC5HGX33KKG5MBOEDUOAZOD","download_json":"https://pith.science/pith/FCHQC5HGX33KKG5MBOEDUOAZOD.json","view_paper":"https://pith.science/paper/FCHQC5HG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.10846&json=true","fetch_graph":"https://pith.science/api/pith-number/FCHQC5HGX33KKG5MBOEDUOAZOD/graph.json","fetch_events":"https://pith.science/api/pith-number/FCHQC5HGX33KKG5MBOEDUOAZOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCHQC5HGX33KKG5MBOEDUOAZOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCHQC5HGX33KKG5MBOEDUOAZOD/action/storage_attestation","attest_author":"https://pith.science/pith/FCHQC5HGX33KKG5MBOEDUOAZOD/action/author_attestation","sign_citation":"https://pith.science/pith/FCHQC5HGX33KKG5MBOEDUOAZOD/action/citation_signature","submit_replication":"https://pith.science/pith/FCHQC5HGX33KKG5MBOEDUOAZOD/action/replication_record"}},"created_at":"2026-07-05T03:28:57.644655+00:00","updated_at":"2026-07-05T03:28:57.644655+00:00"}