{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2ORCPD7725JERKIDHHCSVQ6NNI","short_pith_number":"pith:2ORCPD77","canonical_record":{"source":{"id":"2605.13758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T16:39:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"65ccb86a4a91ef37394fcad83acc6e9c7846d76149001074886026bc30bf0998","abstract_canon_sha256":"4e5d3c3a5b9bda872938ef83d4df2b2fe74ca28547b1e5b771135d2ca1e4ec14"},"schema_version":"1.0"},"canonical_sha256":"d3a2278fffd75248a90339c52ac3cd6a0bcb4c7ee37e3d88c3e46e2c4bcc4079","source":{"kind":"arxiv","id":"2605.13758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13758","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13758v1","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13758","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"2ORCPD7725JE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"2ORCPD7725JERKID","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"2ORCPD77","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2ORCPD7725JERKIDHHCSVQ6NNI","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T16:39:34Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"65ccb86a4a91ef37394fcad83acc6e9c7846d76149001074886026bc30bf0998","abstract_canon_sha256":"4e5d3c3a5b9bda872938ef83d4df2b2fe74ca28547b1e5b771135d2ca1e4ec14"},"schema_version":"1.0"},"canonical_sha256":"d3a2278fffd75248a90339c52ac3cd6a0bcb4c7ee37e3d88c3e46e2c4bcc4079","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:16.323026Z","signature_b64":"Z4kLzb+UeWCpAGz9uIHlscCtyQAN0V7z10gm1yxplOQOQ/62Oo75YmQ1gMe+3MI9B1CIaGbVps0G2hih7kczAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3a2278fffd75248a90339c52ac3cd6a0bcb4c7ee37e3d88c3e46e2c4bcc4079","last_reissued_at":"2026-05-18T02:44:16.322608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:16.322608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13758","source_version":1,"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-18T02:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7SpKPBvfsDZ2V3YeMg1Hedx+RpmP95vyuZHnj93mNKE8uT9BdT983zr3iW2Hs0lnrRKPkgwulm0x2ielVFfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:42:58.581202Z"},"content_sha256":"1894a97f40956ce7d4eb381e5a561234c31ed324fa91847a316a8ec01fc741db","schema_version":"1.0","event_id":"sha256:1894a97f40956ce7d4eb381e5a561234c31ed324fa91847a316a8ec01fc741db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2ORCPD7725JERKIDHHCSVQ6NNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Phase Matching for a Generalized Grover's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"In the generalized Grover's algorithm, optimal phases deviate from π as target probability approaches 1, breaking phase matching but raising success probability.","cross_cats":["math.OC"],"primary_cat":"quant-ph","authors_text":"Chris Cardullo, Min Kang","submitted_at":"2026-05-13T16:39:34Z","abstract_excerpt":"We study the fully generalized Grover's algorithm to find the optimal phase changes for each step of the iteration to maximize gain in probability of observation of the target, and when phase matching is required. We find that classical Grover's algorithm and phase matching remains to be optimal till the target probability gets close 1. However, as the probability of observation approaches 1, the optimal phase changes differ from $\\pi$ and no longer observe phase matching. We provide the optimization statement to find the optimal phase changes given the current amplitude vector and the size of"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"as the probability of observation approaches 1, the optimal phase changes differ from π and no longer observe phase matching... lead to an increase in the probability of the target.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the current amplitude vector is known exactly when choosing the next phases; in a real device this vector is not directly observable and must be estimated.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Optimal phase changes in generalized Grover's algorithm deviate from π only when target probability nears 1, yielding a modest increase in success probability for the final iteration.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"In the generalized Grover's algorithm, optimal phases deviate from π as target probability approaches 1, breaking phase matching but raising success probability.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"cfb8c522cf2b13fbbe95b7ed7e81aef5ed9c6b13dc83507dc3af2df14c20104e"},"source":{"id":"2605.13758","kind":"arxiv","version":1},"verdict":{"id":"fa62f7a4-35c1-4683-b19d-e9d3b985fed2","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:49:06.906341Z","strongest_claim":"as the probability of observation approaches 1, the optimal phase changes differ from π and no longer observe phase matching... lead to an increase in the probability of the target.","one_line_summary":"Optimal phase changes in generalized Grover's algorithm deviate from π only when target probability nears 1, yielding a modest increase in success probability for the final iteration.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the current amplitude vector is known exactly when choosing the next phases; in a real device this vector is not directly observable and must be estimated.","pith_extraction_headline":"In the generalized Grover's algorithm, optimal phases deviate from π as target probability approaches 1, breaking phase matching but raising success probability."},"references":{"count":16,"sample":[{"doi":"","year":1996,"title":"A fast quantum mechanical algorithm for database search,","work_id":"12306d61-9ac4-4ea6-a888-6359467dbfcc","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Tight bounds on quantum searching,","work_id":"d9535da7-9b0c-4a32-8912-86aa584fdf7e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Quantum Computing in the NISQ era and beyond,","work_id":"f045a8df-f1d4-4a76-8b07-d4d758ab2bb4","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Quantum partial search algorithm with smaller oracles for multiple target items,","work_id":"198c2716-c20c-4ae3-a4c9-eff10863590a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Deterministic grover search with a restricted oracle,","work_id":"ad94badd-022c-495b-98ab-7daf57ca0848","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":16,"snapshot_sha256":"04f3b96409a28c45532e306677a98143b6372de83ef189bf9ce78bb2fea5b080","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":"fa62f7a4-35c1-4683-b19d-e9d3b985fed2"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pr4SUI5Umxuy06XU29LyvdA5TD6Sj6Lys/JCuMeKHoQfMT8wjtv5s8Zbh90AzIdJeL++CNSc09N3LHAilqBkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:42:58.582048Z"},"content_sha256":"e81a4bcf9b87789d38a2758df3eecfcc333890cb9ba5eb69860fa65c093a96c4","schema_version":"1.0","event_id":"sha256:e81a4bcf9b87789d38a2758df3eecfcc333890cb9ba5eb69860fa65c093a96c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ORCPD7725JERKIDHHCSVQ6NNI/bundle.json","state_url":"https://pith.science/pith/2ORCPD7725JERKIDHHCSVQ6NNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ORCPD7725JERKIDHHCSVQ6NNI/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-05-22T17:42:58Z","links":{"resolver":"https://pith.science/pith/2ORCPD7725JERKIDHHCSVQ6NNI","bundle":"https://pith.science/pith/2ORCPD7725JERKIDHHCSVQ6NNI/bundle.json","state":"https://pith.science/pith/2ORCPD7725JERKIDHHCSVQ6NNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ORCPD7725JERKIDHHCSVQ6NNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2ORCPD7725JERKIDHHCSVQ6NNI","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":"4e5d3c3a5b9bda872938ef83d4df2b2fe74ca28547b1e5b771135d2ca1e4ec14","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T16:39:34Z","title_canon_sha256":"65ccb86a4a91ef37394fcad83acc6e9c7846d76149001074886026bc30bf0998"},"schema_version":"1.0","source":{"id":"2605.13758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13758","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13758v1","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13758","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"2ORCPD7725JE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"2ORCPD7725JERKID","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"2ORCPD77","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e81a4bcf9b87789d38a2758df3eecfcc333890cb9ba5eb69860fa65c093a96c4","target":"graph","created_at":"2026-05-18T02:44:16Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"as the probability of observation approaches 1, the optimal phase changes differ from π and no longer observe phase matching... lead to an increase in the probability of the target."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the current amplitude vector is known exactly when choosing the next phases; in a real device this vector is not directly observable and must be estimated."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Optimal phase changes in generalized Grover's algorithm deviate from π only when target probability nears 1, yielding a modest increase in success probability for the final iteration."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"In the generalized Grover's algorithm, optimal phases deviate from π as target probability approaches 1, breaking phase matching but raising success probability."}],"snapshot_sha256":"cfb8c522cf2b13fbbe95b7ed7e81aef5ed9c6b13dc83507dc3af2df14c20104e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the fully generalized Grover's algorithm to find the optimal phase changes for each step of the iteration to maximize gain in probability of observation of the target, and when phase matching is required. We find that classical Grover's algorithm and phase matching remains to be optimal till the target probability gets close 1. However, as the probability of observation approaches 1, the optimal phase changes differ from $\\pi$ and no longer observe phase matching. We provide the optimization statement to find the optimal phase changes given the current amplitude vector and the size of","authors_text":"Chris Cardullo, Min Kang","cross_cats":["math.OC"],"headline":"In the generalized Grover's algorithm, optimal phases deviate from π as target probability approaches 1, breaking phase matching but raising success probability.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T16:39:34Z","title":"Phase Matching for a Generalized Grover's Algorithm"},"references":{"count":16,"internal_anchors":0,"resolved_work":16,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"A fast quantum mechanical algorithm for database search,","work_id":"12306d61-9ac4-4ea6-a888-6359467dbfcc","year":1996},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Tight bounds on quantum searching,","work_id":"d9535da7-9b0c-4a32-8912-86aa584fdf7e","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Quantum Computing in the NISQ era and beyond,","work_id":"f045a8df-f1d4-4a76-8b07-d4d758ab2bb4","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Quantum partial search algorithm with smaller oracles for multiple target items,","work_id":"198c2716-c20c-4ae3-a4c9-eff10863590a","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Deterministic grover search with a restricted oracle,","work_id":"ad94badd-022c-495b-98ab-7daf57ca0848","year":2022}],"snapshot_sha256":"04f3b96409a28c45532e306677a98143b6372de83ef189bf9ce78bb2fea5b080"},"source":{"id":"2605.13758","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:49:06.906341Z","id":"fa62f7a4-35c1-4683-b19d-e9d3b985fed2","model_set":{"reader":"grok-4.3"},"one_line_summary":"Optimal phase changes in generalized Grover's algorithm deviate from π only when target probability nears 1, yielding a modest increase in success probability for the final iteration.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"In the generalized Grover's algorithm, optimal phases deviate from π as target probability approaches 1, breaking phase matching but raising success probability.","strongest_claim":"as the probability of observation approaches 1, the optimal phase changes differ from π and no longer observe phase matching... lead to an increase in the probability of the target.","weakest_assumption":"That the current amplitude vector is known exactly when choosing the next phases; in a real device this vector is not directly observable and must be estimated."}},"verdict_id":"fa62f7a4-35c1-4683-b19d-e9d3b985fed2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1894a97f40956ce7d4eb381e5a561234c31ed324fa91847a316a8ec01fc741db","target":"record","created_at":"2026-05-18T02:44:16Z","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":"4e5d3c3a5b9bda872938ef83d4df2b2fe74ca28547b1e5b771135d2ca1e4ec14","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-13T16:39:34Z","title_canon_sha256":"65ccb86a4a91ef37394fcad83acc6e9c7846d76149001074886026bc30bf0998"},"schema_version":"1.0","source":{"id":"2605.13758","kind":"arxiv","version":1}},"canonical_sha256":"d3a2278fffd75248a90339c52ac3cd6a0bcb4c7ee37e3d88c3e46e2c4bcc4079","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3a2278fffd75248a90339c52ac3cd6a0bcb4c7ee37e3d88c3e46e2c4bcc4079","first_computed_at":"2026-05-18T02:44:16.322608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:16.322608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z4kLzb+UeWCpAGz9uIHlscCtyQAN0V7z10gm1yxplOQOQ/62Oo75YmQ1gMe+3MI9B1CIaGbVps0G2hih7kczAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:16.323026Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1894a97f40956ce7d4eb381e5a561234c31ed324fa91847a316a8ec01fc741db","sha256:e81a4bcf9b87789d38a2758df3eecfcc333890cb9ba5eb69860fa65c093a96c4"],"state_sha256":"cdcbb58c32b919e6e6889acb2d7972422fcdb0f2eefc30388ef2049e5d6df967"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kdzfCho224F03J0ECezO4XEesmnofdQLukBZcAq+BUZ+FsbtoYD+20rWio0irhpJYaoHOxByKOIoWFteWTvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:42:58.585461Z","bundle_sha256":"c4236b8fb87b699f2041125d66e87460d8eb635576bad5294783501b008324d6"}}