{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:HNRMO3EJFY2Q3UXNAHDNJX77X2","short_pith_number":"pith:HNRMO3EJ","canonical_record":{"source":{"id":"2305.12300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-20T23:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"9906acb6e35736470eab46de69de872f7961e4593c8464a5927715f1860bbf41","abstract_canon_sha256":"3f334f7290320482a658d24dfea2181cc3de28a4de5bc899ce98f0875386e84f"},"schema_version":"1.0"},"canonical_sha256":"3b62c76c892e350dd2ed01c6d4dfffbea09396aaba26152f66ac80d7329cb987","source":{"kind":"arxiv","id":"2305.12300","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.12300","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"2305.12300v1","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12300","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"HNRMO3EJFY2Q","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"pith_short_16","alias_value":"HNRMO3EJFY2Q3UXN","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"pith_short_8","alias_value":"HNRMO3EJ","created_at":"2026-07-05T06:12:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:HNRMO3EJFY2Q3UXNAHDNJX77X2","target":"record","payload":{"canonical_record":{"source":{"id":"2305.12300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-20T23:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"9906acb6e35736470eab46de69de872f7961e4593c8464a5927715f1860bbf41","abstract_canon_sha256":"3f334f7290320482a658d24dfea2181cc3de28a4de5bc899ce98f0875386e84f"},"schema_version":"1.0"},"canonical_sha256":"3b62c76c892e350dd2ed01c6d4dfffbea09396aaba26152f66ac80d7329cb987","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:12:08.970801Z","signature_b64":"iQg6Bfh7DX6Z1MQ3omS7Kd/z8fQjIWDEYQ70DZwa0+xsiiOvbyexFAzV/40jG7t3RXdXWqHjaaTpJA5WrXA0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b62c76c892e350dd2ed01c6d4dfffbea09396aaba26152f66ac80d7329cb987","last_reissued_at":"2026-07-05T06:12:08.970372Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:12:08.970372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.12300","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-07-05T06:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4DYVnib58OpoqHSXx9R1DNR4dAY/iu3o9Kgms/A3bVMqa6P8dqZFNK/30qwaNObDoiqNmHEQySglBwjoksK7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:32:46.302150Z"},"content_sha256":"9caa6d7a1095b366a272c28998552b8af8a1a7b67e46f2c5c1e501b6a823f38d","schema_version":"1.0","event_id":"sha256:9caa6d7a1095b366a272c28998552b8af8a1a7b67e46f2c5c1e501b6a823f38d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:HNRMO3EJFY2Q3UXNAHDNJX77X2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving D2p Grover's algorithm to reach performance upper bound under phase noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fan Yang, Jian Leng, Xiang-Bin Wang","submitted_at":"2023-05-20T23:49:31Z","abstract_excerpt":"The original Grover's algorithm has a success probability to output a correct solution, while deterministic Grover's algorithms improve the success probability to 100%. However, the success probability of deterministic Grover's algorithm decreases in noisy environment. Here we improve the deterministic two-parameter (D2p) Grover's algorithm to reach the upper bound for success probability under phase noise. We prove that it is not possible to design any deterministic Grover's algorithm whose success probability is higher than our improved D2p protocol's under phase noise."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12300","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/2305.12300/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"},"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-07-05T06:12:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eke113237JokMeYQgKTffsuh9/R/jy4Y/rG84uq2UeKe3tLFuDVQXGlU11i4nM5KHC9RHxW+1pFdH0cFInaeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:32:46.303001Z"},"content_sha256":"63715e66f6473ba3bbcf2e1c7110c2be08af3f2c0d287bdafff344bac427e819","schema_version":"1.0","event_id":"sha256:63715e66f6473ba3bbcf2e1c7110c2be08af3f2c0d287bdafff344bac427e819"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNRMO3EJFY2Q3UXNAHDNJX77X2/bundle.json","state_url":"https://pith.science/pith/HNRMO3EJFY2Q3UXNAHDNJX77X2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNRMO3EJFY2Q3UXNAHDNJX77X2/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-08-05T14:32:46Z","links":{"resolver":"https://pith.science/pith/HNRMO3EJFY2Q3UXNAHDNJX77X2","bundle":"https://pith.science/pith/HNRMO3EJFY2Q3UXNAHDNJX77X2/bundle.json","state":"https://pith.science/pith/HNRMO3EJFY2Q3UXNAHDNJX77X2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNRMO3EJFY2Q3UXNAHDNJX77X2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:HNRMO3EJFY2Q3UXNAHDNJX77X2","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":"3f334f7290320482a658d24dfea2181cc3de28a4de5bc899ce98f0875386e84f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-20T23:49:31Z","title_canon_sha256":"9906acb6e35736470eab46de69de872f7961e4593c8464a5927715f1860bbf41"},"schema_version":"1.0","source":{"id":"2305.12300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.12300","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"arxiv_version","alias_value":"2305.12300v1","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12300","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"pith_short_12","alias_value":"HNRMO3EJFY2Q","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"pith_short_16","alias_value":"HNRMO3EJFY2Q3UXN","created_at":"2026-07-05T06:12:08Z"},{"alias_kind":"pith_short_8","alias_value":"HNRMO3EJ","created_at":"2026-07-05T06:12:08Z"}],"graph_snapshots":[{"event_id":"sha256:63715e66f6473ba3bbcf2e1c7110c2be08af3f2c0d287bdafff344bac427e819","target":"graph","created_at":"2026-07-05T06:12:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.12300/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The original Grover's algorithm has a success probability to output a correct solution, while deterministic Grover's algorithms improve the success probability to 100%. However, the success probability of deterministic Grover's algorithm decreases in noisy environment. Here we improve the deterministic two-parameter (D2p) Grover's algorithm to reach the upper bound for success probability under phase noise. We prove that it is not possible to design any deterministic Grover's algorithm whose success probability is higher than our improved D2p protocol's under phase noise.","authors_text":"Fan Yang, Jian Leng, Xiang-Bin Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-20T23:49:31Z","title":"Improving D2p Grover's algorithm to reach performance upper bound under phase noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12300","kind":"arxiv","version":1},"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:9caa6d7a1095b366a272c28998552b8af8a1a7b67e46f2c5c1e501b6a823f38d","target":"record","created_at":"2026-07-05T06:12:08Z","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":"3f334f7290320482a658d24dfea2181cc3de28a4de5bc899ce98f0875386e84f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-20T23:49:31Z","title_canon_sha256":"9906acb6e35736470eab46de69de872f7961e4593c8464a5927715f1860bbf41"},"schema_version":"1.0","source":{"id":"2305.12300","kind":"arxiv","version":1}},"canonical_sha256":"3b62c76c892e350dd2ed01c6d4dfffbea09396aaba26152f66ac80d7329cb987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b62c76c892e350dd2ed01c6d4dfffbea09396aaba26152f66ac80d7329cb987","first_computed_at":"2026-07-05T06:12:08.970372Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:12:08.970372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iQg6Bfh7DX6Z1MQ3omS7Kd/z8fQjIWDEYQ70DZwa0+xsiiOvbyexFAzV/40jG7t3RXdXWqHjaaTpJA5WrXA0Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:12:08.970801Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.12300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9caa6d7a1095b366a272c28998552b8af8a1a7b67e46f2c5c1e501b6a823f38d","sha256:63715e66f6473ba3bbcf2e1c7110c2be08af3f2c0d287bdafff344bac427e819"],"state_sha256":"99c4efa7a5e18518c2414c2033e578784f088ada40a06159605854804b0910a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s1kvAfj7GQVJP31A028PKhCsooYQo3bhrdQ4oB0O21yqgOlRqWn8OgA8VK97udEZmZGePCrtejvaYJCx8xG5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T14:32:46.308198Z","bundle_sha256":"2bfe16566c2f354a0286e7e3ee8de0e57fd617d15e70eb9df1e381d216df11aa"}}