{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:65UXV3KB4PHS4C7D3OX4BAY42C","short_pith_number":"pith:65UXV3KB","schema_version":"1.0","canonical_sha256":"f7697aed41e3cf2e0be3dbafc0831cd0b56fb27c55a5e81bb4158bb74a33428a","source":{"kind":"arxiv","id":"1502.04567","version":4},"attestation_state":"computed","paper":{"title":"Grover Search with Lackadaisical Quantum Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Thomas G. Wong","submitted_at":"2015-02-16T15:11:00Z","abstract_excerpt":"The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we investigate its effects on Grover's algorithm when formulated as search for a marked vertex on the complete graph of $N$ vertices. For the discrete-time quantum walk using the phase flip coin, adding a self-loop to each vertex boosts the success probability from 1/2 to 1. Additional self-loops, however, decrease the success probability. Using instead the Ambainis, Ke"},"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":"1502.04567","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-02-16T15:11:00Z","cross_cats_sorted":[],"title_canon_sha256":"7caf78130c7ffa3a223ea4a81c0a7f3e04b83cad7cefa969198fafe652aab0d9","abstract_canon_sha256":"900082ce76ddfc29143f7d3079a6c1817e2479b223bc9c7521e7795762176482"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:31.977027Z","signature_b64":"nv2Z2++50J1ZZXnI+/8R79zlVyyAfT3dOXXiOD3gz+WsEa3m31m3mGPVMxFWMDpyGBnf38UCD90SH02Ht+/NCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7697aed41e3cf2e0be3dbafc0831cd0b56fb27c55a5e81bb4158bb74a33428a","last_reissued_at":"2026-05-18T00:34:31.976447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:31.976447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Grover Search with Lackadaisical Quantum Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Thomas G. Wong","submitted_at":"2015-02-16T15:11:00Z","abstract_excerpt":"The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we investigate its effects on Grover's algorithm when formulated as search for a marked vertex on the complete graph of $N$ vertices. For the discrete-time quantum walk using the phase flip coin, adding a self-loop to each vertex boosts the success probability from 1/2 to 1. Additional self-loops, however, decrease the success probability. Using instead the Ambainis, Ke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04567","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.04567","created_at":"2026-05-18T00:34:31.976545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04567v4","created_at":"2026-05-18T00:34:31.976545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04567","created_at":"2026-05-18T00:34:31.976545+00:00"},{"alias_kind":"pith_short_12","alias_value":"65UXV3KB4PHS","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"65UXV3KB4PHS4C7D","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"65UXV3KB","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.04124","citing_title":"Lazy Open Quantum Walks","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/65UXV3KB4PHS4C7D3OX4BAY42C","json":"https://pith.science/pith/65UXV3KB4PHS4C7D3OX4BAY42C.json","graph_json":"https://pith.science/api/pith-number/65UXV3KB4PHS4C7D3OX4BAY42C/graph.json","events_json":"https://pith.science/api/pith-number/65UXV3KB4PHS4C7D3OX4BAY42C/events.json","paper":"https://pith.science/paper/65UXV3KB"},"agent_actions":{"view_html":"https://pith.science/pith/65UXV3KB4PHS4C7D3OX4BAY42C","download_json":"https://pith.science/pith/65UXV3KB4PHS4C7D3OX4BAY42C.json","view_paper":"https://pith.science/paper/65UXV3KB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04567&json=true","fetch_graph":"https://pith.science/api/pith-number/65UXV3KB4PHS4C7D3OX4BAY42C/graph.json","fetch_events":"https://pith.science/api/pith-number/65UXV3KB4PHS4C7D3OX4BAY42C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65UXV3KB4PHS4C7D3OX4BAY42C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65UXV3KB4PHS4C7D3OX4BAY42C/action/storage_attestation","attest_author":"https://pith.science/pith/65UXV3KB4PHS4C7D3OX4BAY42C/action/author_attestation","sign_citation":"https://pith.science/pith/65UXV3KB4PHS4C7D3OX4BAY42C/action/citation_signature","submit_replication":"https://pith.science/pith/65UXV3KB4PHS4C7D3OX4BAY42C/action/replication_record"}},"created_at":"2026-05-18T00:34:31.976545+00:00","updated_at":"2026-05-18T00:34:31.976545+00:00"}