{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EUBACMB5QT26ECQA6Y6GBAQEX3","short_pith_number":"pith:EUBACMB5","schema_version":"1.0","canonical_sha256":"250201303d84f5e20a00f63c608204befc2e035894b302fde3a4e0c6b59581a6","source":{"kind":"arxiv","id":"2004.12686","version":1},"attestation_state":"computed","paper":{"title":"On the optimality of spatial search by continuous-time quantum walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Roland, Leonardo Novo, Shantanav Chakraborty","submitted_at":"2020-04-27T10:05:55Z","abstract_excerpt":"One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and Goldstone [Phys. Rev. A 70, 022314 (2004)], finds a marked node on a graph of $n$ nodes via a continuous-time quantum walk. This algorithm is said to be optimal if it can find any of the nodes in $O(\\sqrt{n})$ time. However, given a graph, no general conditions for the optimality of the algorithm are known and previous works demonstrating optimal quantum search for certain graphs required an instance-specific analysi"},"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":"2004.12686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-04-27T10:05:55Z","cross_cats_sorted":[],"title_canon_sha256":"29176de7feb3aa704a3548f35fb9d2da948b328cb134e2717e19dd43c694a102","abstract_canon_sha256":"d94286e87c40e4f23abf55fe1a2cc39526d86159107b4493164701d8ebecc4b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:09.205328Z","signature_b64":"PzFb7lw2cD0EJU/C3IiuhWLCkatb7vGTbBKei0XWd37G+niUG9IvEy/FWDkxfzhifX+ZqA1nOMEaRFj1YFb0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"250201303d84f5e20a00f63c608204befc2e035894b302fde3a4e0c6b59581a6","last_reissued_at":"2026-07-05T01:37:09.204922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:09.204922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the optimality of spatial search by continuous-time quantum walk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Roland, Leonardo Novo, Shantanav Chakraborty","submitted_at":"2020-04-27T10:05:55Z","abstract_excerpt":"One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and Goldstone [Phys. Rev. A 70, 022314 (2004)], finds a marked node on a graph of $n$ nodes via a continuous-time quantum walk. This algorithm is said to be optimal if it can find any of the nodes in $O(\\sqrt{n})$ time. However, given a graph, no general conditions for the optimality of the algorithm are known and previous works demonstrating optimal quantum search for certain graphs required an instance-specific analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12686","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.12686/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":"2004.12686","created_at":"2026-07-05T01:37:09.204976+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.12686v1","created_at":"2026-07-05T01:37:09.204976+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12686","created_at":"2026-07-05T01:37:09.204976+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUBACMB5QT26","created_at":"2026-07-05T01:37:09.204976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUBACMB5QT26ECQA","created_at":"2026-07-05T01:37:09.204976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUBACMB5","created_at":"2026-07-05T01:37:09.204976+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/EUBACMB5QT26ECQA6Y6GBAQEX3","json":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3.json","graph_json":"https://pith.science/api/pith-number/EUBACMB5QT26ECQA6Y6GBAQEX3/graph.json","events_json":"https://pith.science/api/pith-number/EUBACMB5QT26ECQA6Y6GBAQEX3/events.json","paper":"https://pith.science/paper/EUBACMB5"},"agent_actions":{"view_html":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3","download_json":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3.json","view_paper":"https://pith.science/paper/EUBACMB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.12686&json=true","fetch_graph":"https://pith.science/api/pith-number/EUBACMB5QT26ECQA6Y6GBAQEX3/graph.json","fetch_events":"https://pith.science/api/pith-number/EUBACMB5QT26ECQA6Y6GBAQEX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/action/storage_attestation","attest_author":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/action/author_attestation","sign_citation":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/action/citation_signature","submit_replication":"https://pith.science/pith/EUBACMB5QT26ECQA6Y6GBAQEX3/action/replication_record"}},"created_at":"2026-07-05T01:37:09.204976+00:00","updated_at":"2026-07-05T01:37:09.204976+00:00"}