{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GCUAWIDXUXDTDNR6IF6CTIII4N","short_pith_number":"pith:GCUAWIDX","schema_version":"1.0","canonical_sha256":"30a80b2077a5c731b63e417c29a108e34ca74de95a1b9becf993377a74b73c64","source":{"kind":"arxiv","id":"1801.01305","version":2},"attestation_state":"computed","paper":{"title":"Spatial Search on Graphs with Multiple Targets using Flip-flop Quantum Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhijith J., Apoorva Patel","submitted_at":"2018-01-04T10:58:24Z","abstract_excerpt":"We analyse the eigenvalue and eigenvector structure of the flip-flop quantum walk on regular graphs, explicitly demonstrating how it is quadratically faster than the classical random walk. Then we use it in a controlled spatial search algorithm with multiple target states, and determine the oracle complexity as a function of the spectral gap and the number of target states. The oracle complexity is optimal as a function of the graph size and the number of target states, when the spectral gap of the adjacency matrix is $\\Theta(1)$. It is also optimal for spatial search on $D>4$ dimensional hype"},"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":"1801.01305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-01-04T10:58:24Z","cross_cats_sorted":[],"title_canon_sha256":"8e8b5b3b226f55f01aa7fe11c909d4cce796dc3fd2beca74aab035b9d5ec7da5","abstract_canon_sha256":"bd5cef192196b9df127627544c5048b8eae9c46553b46bdb1799253e4086c562"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:14.704676Z","signature_b64":"Aqv7KuvZh8r1C/JP/qZVylwdcketeWaWBC3XZK9Z61cpPy+drER//o1wn0LoxB2HQgj8sPr4IWB+uKIh6fsbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a80b2077a5c731b63e417c29a108e34ca74de95a1b9becf993377a74b73c64","last_reissued_at":"2026-05-17T23:58:14.704167Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:14.704167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatial Search on Graphs with Multiple Targets using Flip-flop Quantum Walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Abhijith J., Apoorva Patel","submitted_at":"2018-01-04T10:58:24Z","abstract_excerpt":"We analyse the eigenvalue and eigenvector structure of the flip-flop quantum walk on regular graphs, explicitly demonstrating how it is quadratically faster than the classical random walk. Then we use it in a controlled spatial search algorithm with multiple target states, and determine the oracle complexity as a function of the spectral gap and the number of target states. The oracle complexity is optimal as a function of the graph size and the number of target states, when the spectral gap of the adjacency matrix is $\\Theta(1)$. It is also optimal for spatial search on $D>4$ dimensional hype"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01305","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.01305","created_at":"2026-05-17T23:58:14.704243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.01305v2","created_at":"2026-05-17T23:58:14.704243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01305","created_at":"2026-05-17T23:58:14.704243+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCUAWIDXUXDT","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCUAWIDXUXDTDNR6","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCUAWIDX","created_at":"2026-05-18T12:32:25.280505+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/GCUAWIDXUXDTDNR6IF6CTIII4N","json":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N.json","graph_json":"https://pith.science/api/pith-number/GCUAWIDXUXDTDNR6IF6CTIII4N/graph.json","events_json":"https://pith.science/api/pith-number/GCUAWIDXUXDTDNR6IF6CTIII4N/events.json","paper":"https://pith.science/paper/GCUAWIDX"},"agent_actions":{"view_html":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N","download_json":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N.json","view_paper":"https://pith.science/paper/GCUAWIDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.01305&json=true","fetch_graph":"https://pith.science/api/pith-number/GCUAWIDXUXDTDNR6IF6CTIII4N/graph.json","fetch_events":"https://pith.science/api/pith-number/GCUAWIDXUXDTDNR6IF6CTIII4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/action/storage_attestation","attest_author":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/action/author_attestation","sign_citation":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/action/citation_signature","submit_replication":"https://pith.science/pith/GCUAWIDXUXDTDNR6IF6CTIII4N/action/replication_record"}},"created_at":"2026-05-17T23:58:14.704243+00:00","updated_at":"2026-05-17T23:58:14.704243+00:00"}