{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:CWDQJXHV53EEMSUC55AYT7UV4P","short_pith_number":"pith:CWDQJXHV","schema_version":"1.0","canonical_sha256":"158704dcf5eec8464a82ef4189fe95e3d66883356ca5e8212dbd9520c5160c79","source":{"kind":"arxiv","id":"0912.1523","version":1},"attestation_state":"computed","paper":{"title":"Decoherence in Search Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"A.C. Oliveira, F.L. Marquezino, G. Abal, R. Donangelo, R. Portugal","submitted_at":"2009-12-08T15:32:26Z","abstract_excerpt":"Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the implementation of those new algorithms in quantum computers or in other quantum devices is error-prone, it is important to analyze their robustness under decoherence. In this work we analyze the impact of decoherence on quantum search algorithms implemented on two-dimensional grids and on hypercubes."},"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":"0912.1523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-12-08T15:32:26Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"a13cd3739a22d6bbd35d9e9e8ac3054852e51c28fd7a3e9e29aa036b4cec5653","abstract_canon_sha256":"b24d22847dcf954c28e61b49878648d3d8e5533594c8373749d10d0398c78394"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:25.180468Z","signature_b64":"Y0nSr7FRRZP1OefYXIjCR6q+ilzYhKC/czEYHoOGYGlWrj2Ukj6Ug0NiFz50V2CYXJY3SLjJBDa0ZNv4clJpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"158704dcf5eec8464a82ef4189fe95e3d66883356ca5e8212dbd9520c5160c79","last_reissued_at":"2026-05-18T03:55:25.179937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:25.179937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoherence in Search Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"A.C. Oliveira, F.L. Marquezino, G. Abal, R. Donangelo, R. Portugal","submitted_at":"2009-12-08T15:32:26Z","abstract_excerpt":"Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the implementation of those new algorithms in quantum computers or in other quantum devices is error-prone, it is important to analyze their robustness under decoherence. In this work we analyze the impact of decoherence on quantum search algorithms implemented on two-dimensional grids and on hypercubes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.1523","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":"0912.1523","created_at":"2026-05-18T03:55:25.180013+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.1523v1","created_at":"2026-05-18T03:55:25.180013+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1523","created_at":"2026-05-18T03:55:25.180013+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWDQJXHV53EE","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWDQJXHV53EEMSUC","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWDQJXHV","created_at":"2026-05-18T12:25:59.703012+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/CWDQJXHV53EEMSUC55AYT7UV4P","json":"https://pith.science/pith/CWDQJXHV53EEMSUC55AYT7UV4P.json","graph_json":"https://pith.science/api/pith-number/CWDQJXHV53EEMSUC55AYT7UV4P/graph.json","events_json":"https://pith.science/api/pith-number/CWDQJXHV53EEMSUC55AYT7UV4P/events.json","paper":"https://pith.science/paper/CWDQJXHV"},"agent_actions":{"view_html":"https://pith.science/pith/CWDQJXHV53EEMSUC55AYT7UV4P","download_json":"https://pith.science/pith/CWDQJXHV53EEMSUC55AYT7UV4P.json","view_paper":"https://pith.science/paper/CWDQJXHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.1523&json=true","fetch_graph":"https://pith.science/api/pith-number/CWDQJXHV53EEMSUC55AYT7UV4P/graph.json","fetch_events":"https://pith.science/api/pith-number/CWDQJXHV53EEMSUC55AYT7UV4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWDQJXHV53EEMSUC55AYT7UV4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWDQJXHV53EEMSUC55AYT7UV4P/action/storage_attestation","attest_author":"https://pith.science/pith/CWDQJXHV53EEMSUC55AYT7UV4P/action/author_attestation","sign_citation":"https://pith.science/pith/CWDQJXHV53EEMSUC55AYT7UV4P/action/citation_signature","submit_replication":"https://pith.science/pith/CWDQJXHV53EEMSUC55AYT7UV4P/action/replication_record"}},"created_at":"2026-05-18T03:55:25.180013+00:00","updated_at":"2026-05-18T03:55:25.180013+00:00"}