{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PE6ZUZZFESK37CDZ5JDXYEQU4K","short_pith_number":"pith:PE6ZUZZF","schema_version":"1.0","canonical_sha256":"793d9a67252495bf8879ea477c1214e2854bff2223a250d2b2d1fa6ec841a5fa","source":{"kind":"arxiv","id":"2605.20789","version":1},"attestation_state":"computed","paper":{"title":"Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ilnur Valeev, Kamil Khadiev","submitted_at":"2026-05-20T06:35:05Z","abstract_excerpt":"We present a quantum circuit implementation of the quantum hashing algorithm (quantum fingerprinting) for a quantum device with restrictions on the application of two-qubit gates by a qubit connectivity graph. We present an optimization technique for the shallow circuit for quantum hashing in the case of a cactus as a qubit connectivity graph. The algorithm has $O(n^3)$ complexity to build the circuit, where $n$ is the number of qubits and $m$ is the number of connections (edges) in the graph. It is improvement compared to the existing exponential-time algorithm in the case of arbitrary graphs"},"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":"2605.20789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-05-20T06:35:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"98b8d98999907e80836859c9153ffa01eb4cc21538dcd1e4787db0edf7ecd200","abstract_canon_sha256":"3d50307b202072a9f3c2407d67d025971677cd8d2afc915b607f633ab7f811d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:54.478544Z","signature_b64":"RePESjc002At/YfoxBwihwJsEXRMD5Joe47eNNKcgIl/z5SFlPb/NlPlnAmtWkcRqWIIHDJWFh7CuGLLunV5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"793d9a67252495bf8879ea477c1214e2854bff2223a250d2b2d1fa6ec841a5fa","last_reissued_at":"2026-05-21T01:04:54.477687Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:54.477687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Ilnur Valeev, Kamil Khadiev","submitted_at":"2026-05-20T06:35:05Z","abstract_excerpt":"We present a quantum circuit implementation of the quantum hashing algorithm (quantum fingerprinting) for a quantum device with restrictions on the application of two-qubit gates by a qubit connectivity graph. We present an optimization technique for the shallow circuit for quantum hashing in the case of a cactus as a qubit connectivity graph. The algorithm has $O(n^3)$ complexity to build the circuit, where $n$ is the number of qubits and $m$ is the number of connections (edges) in the graph. It is improvement compared to the existing exponential-time algorithm in the case of arbitrary graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20789","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/2605.20789/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":"2605.20789","created_at":"2026-05-21T01:04:54.477835+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20789v1","created_at":"2026-05-21T01:04:54.477835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20789","created_at":"2026-05-21T01:04:54.477835+00:00"},{"alias_kind":"pith_short_12","alias_value":"PE6ZUZZFESK3","created_at":"2026-05-21T01:04:54.477835+00:00"},{"alias_kind":"pith_short_16","alias_value":"PE6ZUZZFESK37CDZ","created_at":"2026-05-21T01:04:54.477835+00:00"},{"alias_kind":"pith_short_8","alias_value":"PE6ZUZZF","created_at":"2026-05-21T01:04:54.477835+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/PE6ZUZZFESK37CDZ5JDXYEQU4K","json":"https://pith.science/pith/PE6ZUZZFESK37CDZ5JDXYEQU4K.json","graph_json":"https://pith.science/api/pith-number/PE6ZUZZFESK37CDZ5JDXYEQU4K/graph.json","events_json":"https://pith.science/api/pith-number/PE6ZUZZFESK37CDZ5JDXYEQU4K/events.json","paper":"https://pith.science/paper/PE6ZUZZF"},"agent_actions":{"view_html":"https://pith.science/pith/PE6ZUZZFESK37CDZ5JDXYEQU4K","download_json":"https://pith.science/pith/PE6ZUZZFESK37CDZ5JDXYEQU4K.json","view_paper":"https://pith.science/paper/PE6ZUZZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20789&json=true","fetch_graph":"https://pith.science/api/pith-number/PE6ZUZZFESK37CDZ5JDXYEQU4K/graph.json","fetch_events":"https://pith.science/api/pith-number/PE6ZUZZFESK37CDZ5JDXYEQU4K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PE6ZUZZFESK37CDZ5JDXYEQU4K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PE6ZUZZFESK37CDZ5JDXYEQU4K/action/storage_attestation","attest_author":"https://pith.science/pith/PE6ZUZZFESK37CDZ5JDXYEQU4K/action/author_attestation","sign_citation":"https://pith.science/pith/PE6ZUZZFESK37CDZ5JDXYEQU4K/action/citation_signature","submit_replication":"https://pith.science/pith/PE6ZUZZFESK37CDZ5JDXYEQU4K/action/replication_record"}},"created_at":"2026-05-21T01:04:54.477835+00:00","updated_at":"2026-05-21T01:04:54.477835+00:00"}