{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UV5CGJFB6KVX23ZBBMVCQRKTNF","short_pith_number":"pith:UV5CGJFB","canonical_record":{"source":{"id":"1508.00207","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-02T07:14:18Z","cross_cats_sorted":[],"title_canon_sha256":"2c7bc76ced26cac5ca043860ecfedf64cbbf0d6772f8db872e52f85f64675d18","abstract_canon_sha256":"0cb008f834dacf054ead79b47e543ea85c9be65f34c3202a14bede3a95af1a78"},"schema_version":"1.0"},"canonical_sha256":"a57a2324a1f2ab7d6f210b2a284553696c09a0ccb17059b546e5f9e5a0ddbe3f","source":{"kind":"arxiv","id":"1508.00207","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00207","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00207v4","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00207","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"UV5CGJFB6KVX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UV5CGJFB6KVX23ZB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UV5CGJFB","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UV5CGJFB6KVX23ZBBMVCQRKTNF","target":"record","payload":{"canonical_record":{"source":{"id":"1508.00207","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-02T07:14:18Z","cross_cats_sorted":[],"title_canon_sha256":"2c7bc76ced26cac5ca043860ecfedf64cbbf0d6772f8db872e52f85f64675d18","abstract_canon_sha256":"0cb008f834dacf054ead79b47e543ea85c9be65f34c3202a14bede3a95af1a78"},"schema_version":"1.0"},"canonical_sha256":"a57a2324a1f2ab7d6f210b2a284553696c09a0ccb17059b546e5f9e5a0ddbe3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:55.890130Z","signature_b64":"/Q9CrA925TpVJphKf+MeOhGYQu3W0QLMA5PxlhrOLIXTHKtWua+29EZoJihLnvEkmNW66PKyb+NXiNxg+q/dAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a57a2324a1f2ab7d6f210b2a284553696c09a0ccb17059b546e5f9e5a0ddbe3f","last_reissued_at":"2026-05-18T01:20:55.889601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:55.889601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.00207","source_version":4,"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-18T01:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MvnkklNL2PtwAL4eiwqy/vCwxcWXTq00QRTiD08y9gRoUPNywXZFguwgjagPDQd24gR2BZCHyX4wcnT7vhfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:11:41.373541Z"},"content_sha256":"739efc5be8f8e0114366fe5e15ccafd1d5c794483a1d6168f21268f439a90bad","schema_version":"1.0","event_id":"sha256:739efc5be8f8e0114366fe5e15ccafd1d5c794483a1d6168f21268f439a90bad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UV5CGJFB6KVX23ZBBMVCQRKTNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust quantum spatial search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Avatar Tulsi","submitted_at":"2015-08-02T07:14:18Z","abstract_excerpt":"Quantum spatial search has been widely studied with most of the study focusing on quantum walk algorithms. We show that quantum walk algorithms are extremely sensitive to systematic errors. We present a recursive algorithm which offers significant robustness to certain systematic errors. To search N items, our recursive algorithm can tolerate errors of size O(1/\\sqrt{\\ln N}) which is exponentially better than quantum walk algorithms for which tolerable error size is only O(\\ln N/\\sqrt{N}). Also, our algorithm does not need any ancilla qubit. Thus our algorithm is much easier to implement exper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00207","kind":"arxiv","version":4},"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-18T01:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VpAD2+5gAJ3Rqz9RSi/bmKURHAe5D7zoxREV/7Ytffzmy1VklPDxSR//PkSUb5pxvpu8gQNsb6/+5vlW9mAeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:11:41.374229Z"},"content_sha256":"11f242a2d740450d6a25c620731a95037830ec0d41bee77661eb8fa96cf1d94d","schema_version":"1.0","event_id":"sha256:11f242a2d740450d6a25c620731a95037830ec0d41bee77661eb8fa96cf1d94d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UV5CGJFB6KVX23ZBBMVCQRKTNF/bundle.json","state_url":"https://pith.science/pith/UV5CGJFB6KVX23ZBBMVCQRKTNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UV5CGJFB6KVX23ZBBMVCQRKTNF/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-12T00:11:41Z","links":{"resolver":"https://pith.science/pith/UV5CGJFB6KVX23ZBBMVCQRKTNF","bundle":"https://pith.science/pith/UV5CGJFB6KVX23ZBBMVCQRKTNF/bundle.json","state":"https://pith.science/pith/UV5CGJFB6KVX23ZBBMVCQRKTNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UV5CGJFB6KVX23ZBBMVCQRKTNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UV5CGJFB6KVX23ZBBMVCQRKTNF","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":"0cb008f834dacf054ead79b47e543ea85c9be65f34c3202a14bede3a95af1a78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-02T07:14:18Z","title_canon_sha256":"2c7bc76ced26cac5ca043860ecfedf64cbbf0d6772f8db872e52f85f64675d18"},"schema_version":"1.0","source":{"id":"1508.00207","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00207","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00207v4","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00207","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"UV5CGJFB6KVX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UV5CGJFB6KVX23ZB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UV5CGJFB","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:11f242a2d740450d6a25c620731a95037830ec0d41bee77661eb8fa96cf1d94d","target":"graph","created_at":"2026-05-18T01:20:55Z","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":"Quantum spatial search has been widely studied with most of the study focusing on quantum walk algorithms. We show that quantum walk algorithms are extremely sensitive to systematic errors. We present a recursive algorithm which offers significant robustness to certain systematic errors. To search N items, our recursive algorithm can tolerate errors of size O(1/\\sqrt{\\ln N}) which is exponentially better than quantum walk algorithms for which tolerable error size is only O(\\ln N/\\sqrt{N}). Also, our algorithm does not need any ancilla qubit. Thus our algorithm is much easier to implement exper","authors_text":"Avatar Tulsi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-02T07:14:18Z","title":"Robust quantum spatial search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00207","kind":"arxiv","version":4},"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:739efc5be8f8e0114366fe5e15ccafd1d5c794483a1d6168f21268f439a90bad","target":"record","created_at":"2026-05-18T01:20:55Z","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":"0cb008f834dacf054ead79b47e543ea85c9be65f34c3202a14bede3a95af1a78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-02T07:14:18Z","title_canon_sha256":"2c7bc76ced26cac5ca043860ecfedf64cbbf0d6772f8db872e52f85f64675d18"},"schema_version":"1.0","source":{"id":"1508.00207","kind":"arxiv","version":4}},"canonical_sha256":"a57a2324a1f2ab7d6f210b2a284553696c09a0ccb17059b546e5f9e5a0ddbe3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a57a2324a1f2ab7d6f210b2a284553696c09a0ccb17059b546e5f9e5a0ddbe3f","first_computed_at":"2026-05-18T01:20:55.889601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:55.889601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Q9CrA925TpVJphKf+MeOhGYQu3W0QLMA5PxlhrOLIXTHKtWua+29EZoJihLnvEkmNW66PKyb+NXiNxg+q/dAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:55.890130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00207","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:739efc5be8f8e0114366fe5e15ccafd1d5c794483a1d6168f21268f439a90bad","sha256:11f242a2d740450d6a25c620731a95037830ec0d41bee77661eb8fa96cf1d94d"],"state_sha256":"04e982764970a9150b95133664ba0dc3066097ab3f4100c2fb5beabf0e4cd903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1IxC94kLE1zOHdDho5f7gALc2xXiJXcaXito4onNtPNsbsUOFAtLIV0ZBKBXAdjAOCixlScKLkajBN0DWpEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:11:41.378079Z","bundle_sha256":"00da9136a5f71d0bafe8f092b1af6349a2ad13166dd503489e8be4be232c4eeb"}}