{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QCNK2GXGZOIASJIB3MZ2Y4JPIH","short_pith_number":"pith:QCNK2GXG","schema_version":"1.0","canonical_sha256":"809aad1ae6cb90092501db33ac712f41fd0e5b7d8096575216a146e096977d59","source":{"kind":"arxiv","id":"2504.12586","version":1},"attestation_state":"computed","paper":{"title":"Quantum Search on Bipartite Multigraphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Gustavo Alves Bezerra, Renato Portugal","submitted_at":"2025-04-17T02:05:16Z","abstract_excerpt":"Quantum walks provide a powerful framework for achieving algorithmic speedup in quantum computing. This paper presents a quantum search algorithm for 2-tessellable graphs, a generalization of bipartite graphs, achieving a quadratic speedup over classical Markov chain-based search methods. Our approach employs an adapted version of the Szegedy quantum walk model (adapted SzQW), which takes place on bipartite graphs, and an adapted version of Staggered Quantum Walks (Adapted StQW), which takes place on 2-tessellable graphs, with the goal of efficiently finding a marked vertex by querying an orac"},"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":"2504.12586","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-17T02:05:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6fec3a212b33f08ae96bf43ceba2f4a1332452e7e991019bdb82902d8194d2cb","abstract_canon_sha256":"a9827bc17e68b5af7cc0397543fdbc5203fdb93d7c0f21b189e0787b5bdaec57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:50:19.035564Z","signature_b64":"xpdP680r/6AhP+Ym94FkPetuXPgk8cmc3VCvtBgLaKjplJKNH6ClaFw1Jq5MgnEx+pCNqdsEAfRklxrY8DnyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"809aad1ae6cb90092501db33ac712f41fd0e5b7d8096575216a146e096977d59","last_reissued_at":"2026-07-05T10:50:19.034993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:50:19.034993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Search on Bipartite Multigraphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis, Gustavo Alves Bezerra, Renato Portugal","submitted_at":"2025-04-17T02:05:16Z","abstract_excerpt":"Quantum walks provide a powerful framework for achieving algorithmic speedup in quantum computing. This paper presents a quantum search algorithm for 2-tessellable graphs, a generalization of bipartite graphs, achieving a quadratic speedup over classical Markov chain-based search methods. Our approach employs an adapted version of the Szegedy quantum walk model (adapted SzQW), which takes place on bipartite graphs, and an adapted version of Staggered Quantum Walks (Adapted StQW), which takes place on 2-tessellable graphs, with the goal of efficiently finding a marked vertex by querying an orac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.12586","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/2504.12586/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":"2504.12586","created_at":"2026-07-05T10:50:19.035073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.12586v1","created_at":"2026-07-05T10:50:19.035073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.12586","created_at":"2026-07-05T10:50:19.035073+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCNK2GXGZOIA","created_at":"2026-07-05T10:50:19.035073+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCNK2GXGZOIASJIB","created_at":"2026-07-05T10:50:19.035073+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCNK2GXG","created_at":"2026-07-05T10:50:19.035073+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/QCNK2GXGZOIASJIB3MZ2Y4JPIH","json":"https://pith.science/pith/QCNK2GXGZOIASJIB3MZ2Y4JPIH.json","graph_json":"https://pith.science/api/pith-number/QCNK2GXGZOIASJIB3MZ2Y4JPIH/graph.json","events_json":"https://pith.science/api/pith-number/QCNK2GXGZOIASJIB3MZ2Y4JPIH/events.json","paper":"https://pith.science/paper/QCNK2GXG"},"agent_actions":{"view_html":"https://pith.science/pith/QCNK2GXGZOIASJIB3MZ2Y4JPIH","download_json":"https://pith.science/pith/QCNK2GXGZOIASJIB3MZ2Y4JPIH.json","view_paper":"https://pith.science/paper/QCNK2GXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.12586&json=true","fetch_graph":"https://pith.science/api/pith-number/QCNK2GXGZOIASJIB3MZ2Y4JPIH/graph.json","fetch_events":"https://pith.science/api/pith-number/QCNK2GXGZOIASJIB3MZ2Y4JPIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCNK2GXGZOIASJIB3MZ2Y4JPIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCNK2GXGZOIASJIB3MZ2Y4JPIH/action/storage_attestation","attest_author":"https://pith.science/pith/QCNK2GXGZOIASJIB3MZ2Y4JPIH/action/author_attestation","sign_citation":"https://pith.science/pith/QCNK2GXGZOIASJIB3MZ2Y4JPIH/action/citation_signature","submit_replication":"https://pith.science/pith/QCNK2GXGZOIASJIB3MZ2Y4JPIH/action/replication_record"}},"created_at":"2026-07-05T10:50:19.035073+00:00","updated_at":"2026-07-05T10:50:19.035073+00:00"}