{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CSORIAMIA5DOZI664SOVLPE7YE","short_pith_number":"pith:CSORIAMI","schema_version":"1.0","canonical_sha256":"149d1401880746eca3dee49d55bc9fc10a48aad5085fda5a85653de504c6d213","source":{"kind":"arxiv","id":"1002.2419","version":2},"attestation_state":"computed","paper":{"title":"Quantum walks can find a marked element on any graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Magniez, Hari Krovi, J\\'er\\'emie Roland, Maris Ozols","submitted_at":"2010-02-11T20:18:35Z","abstract_excerpt":"We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically smaller than the classical hitting time $HT(P,M)$ of any reversible random walk $P$ on the graph. In the case of multiple marked elements, the number of steps is given in terms of a related quantity $HT^+(\\mathit{P,M})$ which we call extended hitting time.\n  Our approach is new, simpler and more general than previous ones. We introduce a notion of interpolat"},"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":"1002.2419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-02-11T20:18:35Z","cross_cats_sorted":[],"title_canon_sha256":"a834ae018fd1a90749dfb179c1f442f11b848af62f34a80ba9f1cf8799748a81","abstract_canon_sha256":"0a57e43647101e7fee5f92c1261ee43fcd8d16ef0c2d5b6518451895dbfaed36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:55.938827Z","signature_b64":"3+CWhaR1Xh2QhNSwQEWUN6g3FakvOksYrhkU/VyuEf/EJ401ptXDirlO9+19v/hjlznM4fHe6HgcRdpA09WVCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"149d1401880746eca3dee49d55bc9fc10a48aad5085fda5a85653de504c6d213","last_reissued_at":"2026-05-18T01:19:55.938108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:55.938108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum walks can find a marked element on any graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Magniez, Hari Krovi, J\\'er\\'emie Roland, Maris Ozols","submitted_at":"2010-02-11T20:18:35Z","abstract_excerpt":"We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically smaller than the classical hitting time $HT(P,M)$ of any reversible random walk $P$ on the graph. In the case of multiple marked elements, the number of steps is given in terms of a related quantity $HT^+(\\mathit{P,M})$ which we call extended hitting time.\n  Our approach is new, simpler and more general than previous ones. We introduce a notion of interpolat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2419","kind":"arxiv","version":2},"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":"1002.2419","created_at":"2026-05-18T01:19:55.938241+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.2419v2","created_at":"2026-05-18T01:19:55.938241+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2419","created_at":"2026-05-18T01:19:55.938241+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSORIAMIA5DO","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSORIAMIA5DOZI66","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSORIAMI","created_at":"2026-05-18T12:26:06.534383+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/CSORIAMIA5DOZI664SOVLPE7YE","json":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE.json","graph_json":"https://pith.science/api/pith-number/CSORIAMIA5DOZI664SOVLPE7YE/graph.json","events_json":"https://pith.science/api/pith-number/CSORIAMIA5DOZI664SOVLPE7YE/events.json","paper":"https://pith.science/paper/CSORIAMI"},"agent_actions":{"view_html":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE","download_json":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE.json","view_paper":"https://pith.science/paper/CSORIAMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.2419&json=true","fetch_graph":"https://pith.science/api/pith-number/CSORIAMIA5DOZI664SOVLPE7YE/graph.json","fetch_events":"https://pith.science/api/pith-number/CSORIAMIA5DOZI664SOVLPE7YE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE/action/storage_attestation","attest_author":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE/action/author_attestation","sign_citation":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE/action/citation_signature","submit_replication":"https://pith.science/pith/CSORIAMIA5DOZI664SOVLPE7YE/action/replication_record"}},"created_at":"2026-05-18T01:19:55.938241+00:00","updated_at":"2026-05-18T01:19:55.938241+00:00"}