{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3J74D3E6GF2W23LJI5LGMU5DCK","short_pith_number":"pith:3J74D3E6","schema_version":"1.0","canonical_sha256":"da7fc1ec9e31756d6d6947566653a31282b7b3e2f45d81321ae293bdc268e390","source":{"kind":"arxiv","id":"1502.06281","version":1},"attestation_state":"computed","paper":{"title":"Completeness is Unnecessary for Fast Nonlinear Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David A. Meyer, Thomas G. Wong","submitted_at":"2015-02-22T22:47:40Z","abstract_excerpt":"Although strongly regular graphs and the hypercube are not complete, they are \"sufficiently complete\" such that a randomly walking quantum particle asymptotically searches on them in the same $\\Theta(\\sqrt{N})$ time as on the complete graph, the latter of which is precisely Grover's algorithm. We show that physically realistic nonlinearities of the form $f(|\\psi|^2)\\psi$ can speed up search on sufficiently complete graphs, depending on the nonlinearity and graph. Thus nonlinear (quantum) computation can retain its power even when a degree of noncompleteness is introduced."},"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.06281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-02-22T22:47:40Z","cross_cats_sorted":[],"title_canon_sha256":"a043da4b2c62d9760b701765f4bc993b9c2b65ef1d949ef2f90de9340e1af421","abstract_canon_sha256":"719f43ae8598932da263be90080aa7c34381550809f002a21f06620398deb625"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:37.602389Z","signature_b64":"DBS79xzOdDbGmV8Z8sFsHZHTq98LIKIPgjg0cTLJIY9nPTMAlsvyr7HKjMH/Y0YuqE8b3455ucLZ+SBgHTukAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da7fc1ec9e31756d6d6947566653a31282b7b3e2f45d81321ae293bdc268e390","last_reissued_at":"2026-05-18T02:26:37.601956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:37.601956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completeness is Unnecessary for Fast Nonlinear Quantum Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David A. Meyer, Thomas G. Wong","submitted_at":"2015-02-22T22:47:40Z","abstract_excerpt":"Although strongly regular graphs and the hypercube are not complete, they are \"sufficiently complete\" such that a randomly walking quantum particle asymptotically searches on them in the same $\\Theta(\\sqrt{N})$ time as on the complete graph, the latter of which is precisely Grover's algorithm. We show that physically realistic nonlinearities of the form $f(|\\psi|^2)\\psi$ can speed up search on sufficiently complete graphs, depending on the nonlinearity and graph. Thus nonlinear (quantum) computation can retain its power even when a degree of noncompleteness is introduced."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06281","kind":"arxiv","version":1},"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.06281","created_at":"2026-05-18T02:26:37.602025+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06281v1","created_at":"2026-05-18T02:26:37.602025+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06281","created_at":"2026-05-18T02:26:37.602025+00:00"},{"alias_kind":"pith_short_12","alias_value":"3J74D3E6GF2W","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3J74D3E6GF2W23LJ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3J74D3E6","created_at":"2026-05-18T12:29:02.477457+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/3J74D3E6GF2W23LJI5LGMU5DCK","json":"https://pith.science/pith/3J74D3E6GF2W23LJI5LGMU5DCK.json","graph_json":"https://pith.science/api/pith-number/3J74D3E6GF2W23LJI5LGMU5DCK/graph.json","events_json":"https://pith.science/api/pith-number/3J74D3E6GF2W23LJI5LGMU5DCK/events.json","paper":"https://pith.science/paper/3J74D3E6"},"agent_actions":{"view_html":"https://pith.science/pith/3J74D3E6GF2W23LJI5LGMU5DCK","download_json":"https://pith.science/pith/3J74D3E6GF2W23LJI5LGMU5DCK.json","view_paper":"https://pith.science/paper/3J74D3E6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06281&json=true","fetch_graph":"https://pith.science/api/pith-number/3J74D3E6GF2W23LJI5LGMU5DCK/graph.json","fetch_events":"https://pith.science/api/pith-number/3J74D3E6GF2W23LJI5LGMU5DCK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3J74D3E6GF2W23LJI5LGMU5DCK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3J74D3E6GF2W23LJI5LGMU5DCK/action/storage_attestation","attest_author":"https://pith.science/pith/3J74D3E6GF2W23LJI5LGMU5DCK/action/author_attestation","sign_citation":"https://pith.science/pith/3J74D3E6GF2W23LJI5LGMU5DCK/action/citation_signature","submit_replication":"https://pith.science/pith/3J74D3E6GF2W23LJI5LGMU5DCK/action/replication_record"}},"created_at":"2026-05-18T02:26:37.602025+00:00","updated_at":"2026-05-18T02:26:37.602025+00:00"}