{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EFITO3ZZVOJHISVMYY6S3XIGJL","short_pith_number":"pith:EFITO3ZZ","schema_version":"1.0","canonical_sha256":"2151376f39ab92744aacc63d2ddd064ae3dfe534e568c41315ee9b4cab4cb44b","source":{"kind":"arxiv","id":"2411.15015","version":2},"attestation_state":"computed","paper":{"title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chonfai Kam, Claudia Linnhoff-Popien, Maximilian Balthasar Mansky","submitted_at":"2024-11-22T15:44:00Z","abstract_excerpt":"We introduce a novel quantum algorithm for determining graph connectedness using a constant number of measurements. The algorithm can be extended to find connected components with a linear number of measurements. It relies on non-unitary abelian gates taken from ZX calculus. Due to the fusion rule, the two-qubit gates correspond to a large single action on the qubits. The algorithm is general and can handle any undirected graph, including those with repeated edges and self-loops. The depth of the algorithm is variable, depending on the graph, and we derive upper and lower bounds. The algorithm"},"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":"2411.15015","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T15:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"31cfd6877b206567e7fa05662e1b839b043497abc14da673a443e42536112666","abstract_canon_sha256":"1da2152ce9f5003903d2d4b834119b1c120e846103d7e6a1a66387ceec017508"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:16.939212Z","signature_b64":"UqSx4pEjM0R13WTlhgUKiJLkw2KxHhtNsy+MvWtL8KFtDUzTpcI4+MQ3fR7y9iBW+xiQiDJAjCRus4gP904gBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2151376f39ab92744aacc63d2ddd064ae3dfe534e568c41315ee9b4cab4cb44b","last_reissued_at":"2026-07-05T09:44:16.938774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:16.938774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constant Measurement Quantum Algorithm for Graph Connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Chonfai Kam, Claudia Linnhoff-Popien, Maximilian Balthasar Mansky","submitted_at":"2024-11-22T15:44:00Z","abstract_excerpt":"We introduce a novel quantum algorithm for determining graph connectedness using a constant number of measurements. The algorithm can be extended to find connected components with a linear number of measurements. It relies on non-unitary abelian gates taken from ZX calculus. Due to the fusion rule, the two-qubit gates correspond to a large single action on the qubits. The algorithm is general and can handle any undirected graph, including those with repeated edges and self-loops. The depth of the algorithm is variable, depending on the graph, and we derive upper and lower bounds. The algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15015","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.15015/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":"2411.15015","created_at":"2026-07-05T09:44:16.938830+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15015v2","created_at":"2026-07-05T09:44:16.938830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15015","created_at":"2026-07-05T09:44:16.938830+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFITO3ZZVOJH","created_at":"2026-07-05T09:44:16.938830+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFITO3ZZVOJHISVM","created_at":"2026-07-05T09:44:16.938830+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFITO3ZZ","created_at":"2026-07-05T09:44:16.938830+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/EFITO3ZZVOJHISVMYY6S3XIGJL","json":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL.json","graph_json":"https://pith.science/api/pith-number/EFITO3ZZVOJHISVMYY6S3XIGJL/graph.json","events_json":"https://pith.science/api/pith-number/EFITO3ZZVOJHISVMYY6S3XIGJL/events.json","paper":"https://pith.science/paper/EFITO3ZZ"},"agent_actions":{"view_html":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL","download_json":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL.json","view_paper":"https://pith.science/paper/EFITO3ZZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15015&json=true","fetch_graph":"https://pith.science/api/pith-number/EFITO3ZZVOJHISVMYY6S3XIGJL/graph.json","fetch_events":"https://pith.science/api/pith-number/EFITO3ZZVOJHISVMYY6S3XIGJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/action/storage_attestation","attest_author":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/action/author_attestation","sign_citation":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/action/citation_signature","submit_replication":"https://pith.science/pith/EFITO3ZZVOJHISVMYY6S3XIGJL/action/replication_record"}},"created_at":"2026-07-05T09:44:16.938830+00:00","updated_at":"2026-07-05T09:44:16.938830+00:00"}