{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4CSEYBTYEXFRP643QOU5VCYX4A","short_pith_number":"pith:4CSEYBTY","schema_version":"1.0","canonical_sha256":"e0a44c067825cb17fb9b83a9da8b17e03f4e66b7a7cc523610075504894328e6","source":{"kind":"arxiv","id":"1907.08119","version":3},"attestation_state":"computed","paper":{"title":"Simpler Quantum Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. R. Wie","submitted_at":"2019-07-18T15:48:23Z","abstract_excerpt":"A simpler quantum counting algorithm based on amplitude amplification is presented. This algorithm is bounded by O(sqrt(N/M)) calls to the controlled-Grover operator where M is the number of marked states and N is the total number of states in the search space. This algorithm terminates within log(sqrt(N/M)) consecutive measurement steps when the probability p1 of measuring the state |1> is at least 0.5, and the result from the final step is used in estimating M by a classical post processing. The purpose of controlled-Grover iteration is to increase the probability p1. This algorithm requires"},"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":"1907.08119","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-18T15:48:23Z","cross_cats_sorted":[],"title_canon_sha256":"33c8961070d48ed2c4637e0e70af19770b67eccdc1259ed7c5efcc69098e2123","abstract_canon_sha256":"2100956d0f70e4031a13be1030e378a2ea49b6df45edbb23c82ee52787186a02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:11:04.697748Z","signature_b64":"md3ytui8gkbmZcbTYsTBa46pN6Nr19indxCzI4Ib3JPf9e7d/741a2uYDVmsPTgZcuZrtjOehyPrI2vvHM5WDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0a44c067825cb17fb9b83a9da8b17e03f4e66b7a7cc523610075504894328e6","last_reissued_at":"2026-07-05T00:11:04.697271Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:11:04.697271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simpler Quantum Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"C. R. Wie","submitted_at":"2019-07-18T15:48:23Z","abstract_excerpt":"A simpler quantum counting algorithm based on amplitude amplification is presented. This algorithm is bounded by O(sqrt(N/M)) calls to the controlled-Grover operator where M is the number of marked states and N is the total number of states in the search space. This algorithm terminates within log(sqrt(N/M)) consecutive measurement steps when the probability p1 of measuring the state |1> is at least 0.5, and the result from the final step is used in estimating M by a classical post processing. The purpose of controlled-Grover iteration is to increase the probability p1. This algorithm requires"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.08119","kind":"arxiv","version":3},"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/1907.08119/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":"1907.08119","created_at":"2026-07-05T00:11:04.697338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.08119v3","created_at":"2026-07-05T00:11:04.697338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.08119","created_at":"2026-07-05T00:11:04.697338+00:00"},{"alias_kind":"pith_short_12","alias_value":"4CSEYBTYEXFR","created_at":"2026-07-05T00:11:04.697338+00:00"},{"alias_kind":"pith_short_16","alias_value":"4CSEYBTYEXFRP643","created_at":"2026-07-05T00:11:04.697338+00:00"},{"alias_kind":"pith_short_8","alias_value":"4CSEYBTY","created_at":"2026-07-05T00:11:04.697338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.01426","citing_title":"Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods","ref_index":165,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4CSEYBTYEXFRP643QOU5VCYX4A","json":"https://pith.science/pith/4CSEYBTYEXFRP643QOU5VCYX4A.json","graph_json":"https://pith.science/api/pith-number/4CSEYBTYEXFRP643QOU5VCYX4A/graph.json","events_json":"https://pith.science/api/pith-number/4CSEYBTYEXFRP643QOU5VCYX4A/events.json","paper":"https://pith.science/paper/4CSEYBTY"},"agent_actions":{"view_html":"https://pith.science/pith/4CSEYBTYEXFRP643QOU5VCYX4A","download_json":"https://pith.science/pith/4CSEYBTYEXFRP643QOU5VCYX4A.json","view_paper":"https://pith.science/paper/4CSEYBTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.08119&json=true","fetch_graph":"https://pith.science/api/pith-number/4CSEYBTYEXFRP643QOU5VCYX4A/graph.json","fetch_events":"https://pith.science/api/pith-number/4CSEYBTYEXFRP643QOU5VCYX4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4CSEYBTYEXFRP643QOU5VCYX4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4CSEYBTYEXFRP643QOU5VCYX4A/action/storage_attestation","attest_author":"https://pith.science/pith/4CSEYBTYEXFRP643QOU5VCYX4A/action/author_attestation","sign_citation":"https://pith.science/pith/4CSEYBTYEXFRP643QOU5VCYX4A/action/citation_signature","submit_replication":"https://pith.science/pith/4CSEYBTYEXFRP643QOU5VCYX4A/action/replication_record"}},"created_at":"2026-07-05T00:11:04.697338+00:00","updated_at":"2026-07-05T00:11:04.697338+00:00"}