{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VRNVKEJJMTGH7FKYIHGMNORXDL","short_pith_number":"pith:VRNVKEJJ","schema_version":"1.0","canonical_sha256":"ac5b55112964cc7f955841ccc6ba371af5ba5ce45f5ef5c2623b0cd09a6ea6b3","source":{"kind":"arxiv","id":"2009.07800","version":3},"attestation_state":"computed","paper":{"title":"Searching via nonlinear quantum walk on the 2D-grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Basile Herzog, Giuseppe Di Molfetta","submitted_at":"2020-09-16T16:48:41Z","abstract_excerpt":"We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer \\cite{meyer2013nonlinear}, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional grid, keeping the same computational advantage \\BHg{with} respect to the classical algorithms. For this purpose, we have considered the free lattice Hamiltonian, with linear dispersion relation introduced by Childs and Ge \\cite{Childs_2014}. The numerical simulations showed that the walker finds the marked vertex in $O(N^{1/4} \\log^{3/4} N) $ steps, with probab"},"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":"2009.07800","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-09-16T16:48:41Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"aad44ba41d79e94e9b2fe3748b5eef1fdc6ba405e1338f7248f6df3daf3c780d","abstract_canon_sha256":"d811bfe83d07ef39bd9ab6f950e8ca392884aae4f79f899732ff90f202381bb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:21.621649Z","signature_b64":"veHirBROuMPN2iV9vCCGg7ykD6vieQhKiRGJD+rnRz0I3ZROc7z6Erf6vxsCtlMxGEKxbKBcFFE6Ltcd4TmkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac5b55112964cc7f955841ccc6ba371af5ba5ce45f5ef5c2623b0cd09a6ea6b3","last_reissued_at":"2026-07-05T01:51:21.621214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:21.621214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searching via nonlinear quantum walk on the 2D-grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Basile Herzog, Giuseppe Di Molfetta","submitted_at":"2020-09-16T16:48:41Z","abstract_excerpt":"We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer \\cite{meyer2013nonlinear}, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional grid, keeping the same computational advantage \\BHg{with} respect to the classical algorithms. For this purpose, we have considered the free lattice Hamiltonian, with linear dispersion relation introduced by Childs and Ge \\cite{Childs_2014}. The numerical simulations showed that the walker finds the marked vertex in $O(N^{1/4} \\log^{3/4} N) $ steps, with probab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.07800","kind":"arxiv","version":3},"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/2009.07800/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2009.07800","created_at":"2026-07-05T01:51:21.621265+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.07800v3","created_at":"2026-07-05T01:51:21.621265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.07800","created_at":"2026-07-05T01:51:21.621265+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRNVKEJJMTGH","created_at":"2026-07-05T01:51:21.621265+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRNVKEJJMTGH7FKY","created_at":"2026-07-05T01:51:21.621265+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRNVKEJJ","created_at":"2026-07-05T01:51:21.621265+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18428","citing_title":"Quantum algorithm for Valiant-Vazirani reduction","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14822","citing_title":"Nonlinear Hamiltonians and Boolean satisfiability","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2410.22032","citing_title":"From spin squeezing to fast state discrimination","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRNVKEJJMTGH7FKYIHGMNORXDL","json":"https://pith.science/pith/VRNVKEJJMTGH7FKYIHGMNORXDL.json","graph_json":"https://pith.science/api/pith-number/VRNVKEJJMTGH7FKYIHGMNORXDL/graph.json","events_json":"https://pith.science/api/pith-number/VRNVKEJJMTGH7FKYIHGMNORXDL/events.json","paper":"https://pith.science/paper/VRNVKEJJ"},"agent_actions":{"view_html":"https://pith.science/pith/VRNVKEJJMTGH7FKYIHGMNORXDL","download_json":"https://pith.science/pith/VRNVKEJJMTGH7FKYIHGMNORXDL.json","view_paper":"https://pith.science/paper/VRNVKEJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.07800&json=true","fetch_graph":"https://pith.science/api/pith-number/VRNVKEJJMTGH7FKYIHGMNORXDL/graph.json","fetch_events":"https://pith.science/api/pith-number/VRNVKEJJMTGH7FKYIHGMNORXDL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRNVKEJJMTGH7FKYIHGMNORXDL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRNVKEJJMTGH7FKYIHGMNORXDL/action/storage_attestation","attest_author":"https://pith.science/pith/VRNVKEJJMTGH7FKYIHGMNORXDL/action/author_attestation","sign_citation":"https://pith.science/pith/VRNVKEJJMTGH7FKYIHGMNORXDL/action/citation_signature","submit_replication":"https://pith.science/pith/VRNVKEJJMTGH7FKYIHGMNORXDL/action/replication_record"}},"created_at":"2026-07-05T01:51:21.621265+00:00","updated_at":"2026-07-05T01:51:21.621265+00:00"}