{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GGPV3C7TCWS4GE5AK5NLQAQWMK","short_pith_number":"pith:GGPV3C7T","schema_version":"1.0","canonical_sha256":"319f5d8bf315a5c313a0575ab8021662add6af4db791fc312610942f132aabe8","source":{"kind":"arxiv","id":"2112.12746","version":1},"attestation_state":"computed","paper":{"title":"Quadratic speedup for spatial search by continuous-time quantum walk","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Roland, Leonardo Novo, Shantanav Chakraborty, Simon Apers","submitted_at":"2021-12-23T17:57:49Z","abstract_excerpt":"Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a quadratic advantage over classical random walks has been an outstanding problem. Thus far, this advantage is obtained only for specific graphs or when a single node of the underlying graph is marked. In this article, we provide a new continuous-time quantum walk search algorithm that completely resolves this: our algorithm can find a marked node in any grap"},"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":"2112.12746","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-12-23T17:57:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"796e3cf56292b501d15b0c057bca9ef2bf47f70fc8434526366ae3ac1651868d","abstract_canon_sha256":"2385a5b274dd47ff49591bf922c3a898fa6952d981a91d9a39ecd070fd1d2906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:08:50.596329Z","signature_b64":"DSEq2JA2NfA70UjvIyUhOjAztD43DlABrRu/XDGSZQPkLgLKT83ndQomf/jk3SYRv9rffwLnsYa2nXScHXQ6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"319f5d8bf315a5c313a0575ab8021662add6af4db791fc312610942f132aabe8","last_reissued_at":"2026-07-05T05:08:50.595895Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:08:50.595895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadratic speedup for spatial search by continuous-time quantum walk","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"J\\'er\\'emie Roland, Leonardo Novo, Shantanav Chakraborty, Simon Apers","submitted_at":"2021-12-23T17:57:49Z","abstract_excerpt":"Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a quadratic advantage over classical random walks has been an outstanding problem. Thus far, this advantage is obtained only for specific graphs or when a single node of the underlying graph is marked. In this article, we provide a new continuous-time quantum walk search algorithm that completely resolves this: our algorithm can find a marked node in any grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.12746","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/2112.12746/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":"2112.12746","created_at":"2026-07-05T05:08:50.595951+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.12746v1","created_at":"2026-07-05T05:08:50.595951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.12746","created_at":"2026-07-05T05:08:50.595951+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGPV3C7TCWS4","created_at":"2026-07-05T05:08:50.595951+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGPV3C7TCWS4GE5A","created_at":"2026-07-05T05:08:50.595951+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGPV3C7T","created_at":"2026-07-05T05:08:50.595951+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/GGPV3C7TCWS4GE5AK5NLQAQWMK","json":"https://pith.science/pith/GGPV3C7TCWS4GE5AK5NLQAQWMK.json","graph_json":"https://pith.science/api/pith-number/GGPV3C7TCWS4GE5AK5NLQAQWMK/graph.json","events_json":"https://pith.science/api/pith-number/GGPV3C7TCWS4GE5AK5NLQAQWMK/events.json","paper":"https://pith.science/paper/GGPV3C7T"},"agent_actions":{"view_html":"https://pith.science/pith/GGPV3C7TCWS4GE5AK5NLQAQWMK","download_json":"https://pith.science/pith/GGPV3C7TCWS4GE5AK5NLQAQWMK.json","view_paper":"https://pith.science/paper/GGPV3C7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.12746&json=true","fetch_graph":"https://pith.science/api/pith-number/GGPV3C7TCWS4GE5AK5NLQAQWMK/graph.json","fetch_events":"https://pith.science/api/pith-number/GGPV3C7TCWS4GE5AK5NLQAQWMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGPV3C7TCWS4GE5AK5NLQAQWMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGPV3C7TCWS4GE5AK5NLQAQWMK/action/storage_attestation","attest_author":"https://pith.science/pith/GGPV3C7TCWS4GE5AK5NLQAQWMK/action/author_attestation","sign_citation":"https://pith.science/pith/GGPV3C7TCWS4GE5AK5NLQAQWMK/action/citation_signature","submit_replication":"https://pith.science/pith/GGPV3C7TCWS4GE5AK5NLQAQWMK/action/replication_record"}},"created_at":"2026-07-05T05:08:50.595951+00:00","updated_at":"2026-07-05T05:08:50.595951+00:00"}