{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OMYNPWBGDJAJK5BNYW4CBB3ZNS","short_pith_number":"pith:OMYNPWBG","canonical_record":{"source":{"id":"1806.03259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-08T16:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"0869042adc1eb3b897a0012298fa8469b671ea36064fd4c6b2f1ae6ce787d618","abstract_canon_sha256":"5dc264987150621cac2a4224fd02a9da320bff905bf62f5d7534521b1091f388"},"schema_version":"1.0"},"canonical_sha256":"7330d7d8261a4095742dc5b82087796c8c9e3da888ac6c51f16a89c5f2ec9419","source":{"kind":"arxiv","id":"1806.03259","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03259","created_at":"2026-05-17T23:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03259v2","created_at":"2026-05-17T23:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03259","created_at":"2026-05-17T23:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"OMYNPWBGDJAJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OMYNPWBGDJAJK5BN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OMYNPWBG","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OMYNPWBGDJAJK5BNYW4CBB3ZNS","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-08T16:05:14Z","cross_cats_sorted":[],"title_canon_sha256":"0869042adc1eb3b897a0012298fa8469b671ea36064fd4c6b2f1ae6ce787d618","abstract_canon_sha256":"5dc264987150621cac2a4224fd02a9da320bff905bf62f5d7534521b1091f388"},"schema_version":"1.0"},"canonical_sha256":"7330d7d8261a4095742dc5b82087796c8c9e3da888ac6c51f16a89c5f2ec9419","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:38.957559Z","signature_b64":"Rs6Wbl+GkuNhOTerf2oFqUZHttrR1Zq8AxoB53L1hDVqCKfdy22ivDsm/Ns6dQaKKWXh6THJ95xVBOFPDWdfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7330d7d8261a4095742dc5b82087796c8c9e3da888ac6c51f16a89c5f2ec9419","last_reissued_at":"2026-05-17T23:58:38.956865Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:38.956865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03259","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFxHbajO7liFF7cJXj/Vi1XnsHEmKANe38xBYuBJQ7hK+eYJMZasRkMYioEreCxdmSRgJLcdmD8jk9v/QRdKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T13:35:56.739526Z"},"content_sha256":"16991b362b4ec90e197179947857e62cee6828f81de6efeaad8ef6695a863a45","schema_version":"1.0","event_id":"sha256:16991b362b4ec90e197179947857e62cee6828f81de6efeaad8ef6695a863a45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OMYNPWBGDJAJK5BNYW4CBB3ZNS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complementary-multiphase quantum search for all numbers of target items","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chu Guo, Feng-Guang Li, He-Liang Huang, Jie Lin, Shuo Zhang, Tan Li, Wan-Su Bao, Xiang-Qun Fu, Xiang Wang, Yu-Tao Du","submitted_at":"2018-06-08T16:05:14Z","abstract_excerpt":"Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $\\lambda$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $\\lambda$ is the fraction of target items in the database. In this paper, we find out that the Grover algorithm can actually apply to the case where one can identify the range that $\\lambda$ belongs to from a given series of disjoint ranges. However, Grover's algorithm still cannot maintain high success probability when there exist multiple target items. For this problem,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03259","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9WP2jGO5ejTpjDTvtMCsgJW7dCj5oiKkWY8aA/zFonb+++eRaUZzHzbHok97syT/512uFz9T/q0MWflCPv/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T13:35:56.739871Z"},"content_sha256":"acc6ee153756b7a7f3dc2730b7174c017037a646eb7a5e04a1fd96a4442a3cc6","schema_version":"1.0","event_id":"sha256:acc6ee153756b7a7f3dc2730b7174c017037a646eb7a5e04a1fd96a4442a3cc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMYNPWBGDJAJK5BNYW4CBB3ZNS/bundle.json","state_url":"https://pith.science/pith/OMYNPWBGDJAJK5BNYW4CBB3ZNS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMYNPWBGDJAJK5BNYW4CBB3ZNS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T13:35:56Z","links":{"resolver":"https://pith.science/pith/OMYNPWBGDJAJK5BNYW4CBB3ZNS","bundle":"https://pith.science/pith/OMYNPWBGDJAJK5BNYW4CBB3ZNS/bundle.json","state":"https://pith.science/pith/OMYNPWBGDJAJK5BNYW4CBB3ZNS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMYNPWBGDJAJK5BNYW4CBB3ZNS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OMYNPWBGDJAJK5BNYW4CBB3ZNS","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":"5dc264987150621cac2a4224fd02a9da320bff905bf62f5d7534521b1091f388","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-08T16:05:14Z","title_canon_sha256":"0869042adc1eb3b897a0012298fa8469b671ea36064fd4c6b2f1ae6ce787d618"},"schema_version":"1.0","source":{"id":"1806.03259","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03259","created_at":"2026-05-17T23:58:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03259v2","created_at":"2026-05-17T23:58:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03259","created_at":"2026-05-17T23:58:38Z"},{"alias_kind":"pith_short_12","alias_value":"OMYNPWBGDJAJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OMYNPWBGDJAJK5BN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OMYNPWBG","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:acc6ee153756b7a7f3dc2730b7174c017037a646eb7a5e04a1fd96a4442a3cc6","target":"graph","created_at":"2026-05-17T23:58:38Z","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":"Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $\\lambda$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $\\lambda$ is the fraction of target items in the database. In this paper, we find out that the Grover algorithm can actually apply to the case where one can identify the range that $\\lambda$ belongs to from a given series of disjoint ranges. However, Grover's algorithm still cannot maintain high success probability when there exist multiple target items. For this problem,","authors_text":"Chu Guo, Feng-Guang Li, He-Liang Huang, Jie Lin, Shuo Zhang, Tan Li, Wan-Su Bao, Xiang-Qun Fu, Xiang Wang, Yu-Tao Du","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-08T16:05:14Z","title":"Complementary-multiphase quantum search for all numbers of target items"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03259","kind":"arxiv","version":2},"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:16991b362b4ec90e197179947857e62cee6828f81de6efeaad8ef6695a863a45","target":"record","created_at":"2026-05-17T23:58:38Z","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":"5dc264987150621cac2a4224fd02a9da320bff905bf62f5d7534521b1091f388","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-08T16:05:14Z","title_canon_sha256":"0869042adc1eb3b897a0012298fa8469b671ea36064fd4c6b2f1ae6ce787d618"},"schema_version":"1.0","source":{"id":"1806.03259","kind":"arxiv","version":2}},"canonical_sha256":"7330d7d8261a4095742dc5b82087796c8c9e3da888ac6c51f16a89c5f2ec9419","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7330d7d8261a4095742dc5b82087796c8c9e3da888ac6c51f16a89c5f2ec9419","first_computed_at":"2026-05-17T23:58:38.956865Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:38.956865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rs6Wbl+GkuNhOTerf2oFqUZHttrR1Zq8AxoB53L1hDVqCKfdy22ivDsm/Ns6dQaKKWXh6THJ95xVBOFPDWdfBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:38.957559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03259","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16991b362b4ec90e197179947857e62cee6828f81de6efeaad8ef6695a863a45","sha256:acc6ee153756b7a7f3dc2730b7174c017037a646eb7a5e04a1fd96a4442a3cc6"],"state_sha256":"6f9e1a7c0ed2c82562a526282c0aa930fd138639718084d3053f5ad0cdbc907e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uiDjejDuUOUxSizwA7XyNDeXfieSho2HoqWwRIx37VNE3szMZLu9Zkbub4JB5+5SsYc6jQKL8jePRETmpfyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T13:35:56.741964Z","bundle_sha256":"f298c44157ac707df913eac164ea64ef7c38148be6113a54a28d99e33fdf4ff5"}}