{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7JJISKGYGBNIMIBHZLOBOELG5M","short_pith_number":"pith:7JJISKGY","schema_version":"1.0","canonical_sha256":"fa528928d8305a862027cadc171166eb317c8a2757afbf2c309954a1c92137c8","source":{"kind":"arxiv","id":"1804.01446","version":2},"attestation_state":"computed","paper":{"title":"Search of clustered marked states with lackadaisical quantum walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amit Saha, Amlan Chakrabarti, Debasri Saha, Ritajit Majumdar, Susmita Sur-Kolay","submitted_at":"2018-04-04T14:48:04Z","abstract_excerpt":"Nature of quantum walk in presence of multiple marked state has been studied by Nahimovs and Rivosh \\cite{10.1007/978-3-662-49192-8_31}. They have shown that if the marked states are arranged in a $\\sqrt{k} \\times \\sqrt{k}$ cluster in a $\\sqrt{N} \\times \\sqrt{N}$ grid, then to find a single marked state among the multiple ones, quantum walk requires $\\Omega(\\sqrt{N} - \\sqrt{k})$ time. In this paper, we show that using lackadaisical quantum walk with the weight of the self-loop as $\\frac{4}{N(k + \\lfloor{\\frac{\\sqrt{{k}}}{2}}\\rfloor)}$, where $k$ is odd, the probability of finding a marked stat"},"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":"1804.01446","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-04T14:48:04Z","cross_cats_sorted":[],"title_canon_sha256":"ed293b287702ed6b29f8304f1ac0e1f31690bed25827453ac1b0012e7265fdfa","abstract_canon_sha256":"d14ada240cc36a476aacd134bc669b0682ba201fc9c94b56dafd7610fd92dc76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:00.441596Z","signature_b64":"y1mp72Oc1hJfabUhYOAG+ApzhFqU8pqNMl1J/QH73TJGuvfynPFgcwNiO9r9ybmgQIT/kPAoGXL5VG6tr9PvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa528928d8305a862027cadc171166eb317c8a2757afbf2c309954a1c92137c8","last_reissued_at":"2026-05-18T00:08:00.441022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:00.441022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search of clustered marked states with lackadaisical quantum walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Amit Saha, Amlan Chakrabarti, Debasri Saha, Ritajit Majumdar, Susmita Sur-Kolay","submitted_at":"2018-04-04T14:48:04Z","abstract_excerpt":"Nature of quantum walk in presence of multiple marked state has been studied by Nahimovs and Rivosh \\cite{10.1007/978-3-662-49192-8_31}. They have shown that if the marked states are arranged in a $\\sqrt{k} \\times \\sqrt{k}$ cluster in a $\\sqrt{N} \\times \\sqrt{N}$ grid, then to find a single marked state among the multiple ones, quantum walk requires $\\Omega(\\sqrt{N} - \\sqrt{k})$ time. In this paper, we show that using lackadaisical quantum walk with the weight of the self-loop as $\\frac{4}{N(k + \\lfloor{\\frac{\\sqrt{{k}}}{2}}\\rfloor)}$, where $k$ is odd, the probability of finding a marked stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01446","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":"1804.01446","created_at":"2026-05-18T00:08:00.441103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01446v2","created_at":"2026-05-18T00:08:00.441103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01446","created_at":"2026-05-18T00:08:00.441103+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JJISKGYGBNI","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JJISKGYGBNIMIBH","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JJISKGY","created_at":"2026-05-18T12:32:11.075285+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15030","citing_title":"A NISQ-friendly Coined Quantum Walk Algorithm for Chaos-based Cryptographic Applications","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7JJISKGYGBNIMIBHZLOBOELG5M","json":"https://pith.science/pith/7JJISKGYGBNIMIBHZLOBOELG5M.json","graph_json":"https://pith.science/api/pith-number/7JJISKGYGBNIMIBHZLOBOELG5M/graph.json","events_json":"https://pith.science/api/pith-number/7JJISKGYGBNIMIBHZLOBOELG5M/events.json","paper":"https://pith.science/paper/7JJISKGY"},"agent_actions":{"view_html":"https://pith.science/pith/7JJISKGYGBNIMIBHZLOBOELG5M","download_json":"https://pith.science/pith/7JJISKGYGBNIMIBHZLOBOELG5M.json","view_paper":"https://pith.science/paper/7JJISKGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01446&json=true","fetch_graph":"https://pith.science/api/pith-number/7JJISKGYGBNIMIBHZLOBOELG5M/graph.json","fetch_events":"https://pith.science/api/pith-number/7JJISKGYGBNIMIBHZLOBOELG5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JJISKGYGBNIMIBHZLOBOELG5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JJISKGYGBNIMIBHZLOBOELG5M/action/storage_attestation","attest_author":"https://pith.science/pith/7JJISKGYGBNIMIBHZLOBOELG5M/action/author_attestation","sign_citation":"https://pith.science/pith/7JJISKGYGBNIMIBHZLOBOELG5M/action/citation_signature","submit_replication":"https://pith.science/pith/7JJISKGYGBNIMIBHZLOBOELG5M/action/replication_record"}},"created_at":"2026-05-18T00:08:00.441103+00:00","updated_at":"2026-05-18T00:08:00.441103+00:00"}