{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VYY64XG4INWMCRK2BYBT6OWEXM","short_pith_number":"pith:VYY64XG4","schema_version":"1.0","canonical_sha256":"ae31ee5cdc436cc1455a0e033f3ac4bb341ec8d0c10d041383b033e2f072ae4d","source":{"kind":"arxiv","id":"1908.07943","version":1},"attestation_state":"computed","paper":{"title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cen Wang, Hongxiang Guo, Jian Wu, ShiJie Wei, Xiong Gao, Yanhu Chen","submitted_at":"2019-08-21T15:47:34Z","abstract_excerpt":"Finding a maximum or minimum is a fundamental building block in many mathematical models. Compared with classical algorithms, Durr, Hoyer's quantum algorithm (DHA) achieves quadratic speed. However, its key step, the quantum exponential searching algorithm (QESA), which is based on Grover algorithm, is not a sure-success algorithm. Meanwhile, quantum circuits encounter the gate decomposition problem due to variation of the scale of data. In this paper, we propose an optimized quantum algorithm for searching maximum and minimum, based on DHA and the optimal quantum exact search algorithm. Furth"},"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.07943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-21T15:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"643371b976f406218196050b7eae09f4d6dd5a4ec160133b07ec754b3d1b0707","abstract_canon_sha256":"ac41a38ca8b9ec4c2a960a9475809f9ebb5a5b9eb0a3edff72ab5b27e1376863"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:02.756800Z","signature_b64":"KDRI3s5INfKHrsu/zPfubwVi9J3NSh4jHXzG6Lx+CSF5PrGGUXjbxeCY3O3m2fY+oGLMm5PV9bb7ZORz+inwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae31ee5cdc436cc1455a0e033f3ac4bb341ec8d0c10d041383b033e2f072ae4d","last_reissued_at":"2026-07-04T23:59:02.756405Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:02.756405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cen Wang, Hongxiang Guo, Jian Wu, ShiJie Wei, Xiong Gao, Yanhu Chen","submitted_at":"2019-08-21T15:47:34Z","abstract_excerpt":"Finding a maximum or minimum is a fundamental building block in many mathematical models. Compared with classical algorithms, Durr, Hoyer's quantum algorithm (DHA) achieves quadratic speed. However, its key step, the quantum exponential searching algorithm (QESA), which is based on Grover algorithm, is not a sure-success algorithm. Meanwhile, quantum circuits encounter the gate decomposition problem due to variation of the scale of data. In this paper, we propose an optimized quantum algorithm for searching maximum and minimum, based on DHA and the optimal quantum exact search algorithm. Furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07943","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/1908.07943/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.07943","created_at":"2026-07-04T23:59:02.756463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07943v1","created_at":"2026-07-04T23:59:02.756463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07943","created_at":"2026-07-04T23:59:02.756463+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYY64XG4INWM","created_at":"2026-07-04T23:59:02.756463+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYY64XG4INWMCRK2","created_at":"2026-07-04T23:59:02.756463+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYY64XG4","created_at":"2026-07-04T23:59:02.756463+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/VYY64XG4INWMCRK2BYBT6OWEXM","json":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM.json","graph_json":"https://pith.science/api/pith-number/VYY64XG4INWMCRK2BYBT6OWEXM/graph.json","events_json":"https://pith.science/api/pith-number/VYY64XG4INWMCRK2BYBT6OWEXM/events.json","paper":"https://pith.science/paper/VYY64XG4"},"agent_actions":{"view_html":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM","download_json":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM.json","view_paper":"https://pith.science/paper/VYY64XG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07943&json=true","fetch_graph":"https://pith.science/api/pith-number/VYY64XG4INWMCRK2BYBT6OWEXM/graph.json","fetch_events":"https://pith.science/api/pith-number/VYY64XG4INWMCRK2BYBT6OWEXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM/action/storage_attestation","attest_author":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM/action/author_attestation","sign_citation":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM/action/citation_signature","submit_replication":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM/action/replication_record"}},"created_at":"2026-07-04T23:59:02.756463+00:00","updated_at":"2026-07-04T23:59:02.756463+00:00"}