{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:XH25QZGW7AFJL4BXRRP6N6OYCF","short_pith_number":"pith:XH25QZGW","schema_version":"1.0","canonical_sha256":"b9f5d864d6f80a95f0378c5fe6f9d8115340620cf8792505e017e0c363f025d4","source":{"kind":"arxiv","id":"quant-ph/0605218","version":2},"attestation_state":"computed","paper":{"title":"Quantum loop programs","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Yuan Feng","submitted_at":"2006-05-25T14:05:29Z","abstract_excerpt":"Loop is a powerful program construct in classical computation, but its power is still not exploited fully in quantum computation. The exploitation of such power definitely requires a deep understanding of the mechanism of quantum loop programs. In this paper, we introduce a general scheme of quantum loops and describe its computational process. The notions of termination and almost termination are proposed for quantum loops, and the function computed by a quantum loop is defined. To show their expressive power, quantum loops are applied in describing quantum walks. Necessary and sufficient con"},"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":"quant-ph/0605218","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-05-25T14:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"1cafe9175106087455fe49748e2469adab2b06b22cdc4c3839bdbf7cf15166a0","abstract_canon_sha256":"970edcb066ecfa42d6093c30da9a133106e3ce945622b95ca6638d9682a57f3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:16.757557Z","signature_b64":"kAutPuQO3ZlbiDmZ5NJmw/lsaUzNxSX2N4ge1nl3qrDZMGEwsqMm0ubPxP/XSIQi9wnZH9M5HyIONsHjM1axAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9f5d864d6f80a95f0378c5fe6f9d8115340620cf8792505e017e0c363f025d4","last_reissued_at":"2026-05-18T03:29:16.756827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:16.756827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum loop programs","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Mingsheng Ying, Yuan Feng","submitted_at":"2006-05-25T14:05:29Z","abstract_excerpt":"Loop is a powerful program construct in classical computation, but its power is still not exploited fully in quantum computation. The exploitation of such power definitely requires a deep understanding of the mechanism of quantum loop programs. In this paper, we introduce a general scheme of quantum loops and describe its computational process. The notions of termination and almost termination are proposed for quantum loops, and the function computed by a quantum loop is defined. To show their expressive power, quantum loops are applied in describing quantum walks. Necessary and sufficient con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0605218","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":"quant-ph/0605218","created_at":"2026-05-18T03:29:16.756940+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0605218v2","created_at":"2026-05-18T03:29:16.756940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0605218","created_at":"2026-05-18T03:29:16.756940+00:00"},{"alias_kind":"pith_short_12","alias_value":"XH25QZGW7AFJ","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"XH25QZGW7AFJL4BX","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"XH25QZGW","created_at":"2026-05-18T12:25:54.717736+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/XH25QZGW7AFJL4BXRRP6N6OYCF","json":"https://pith.science/pith/XH25QZGW7AFJL4BXRRP6N6OYCF.json","graph_json":"https://pith.science/api/pith-number/XH25QZGW7AFJL4BXRRP6N6OYCF/graph.json","events_json":"https://pith.science/api/pith-number/XH25QZGW7AFJL4BXRRP6N6OYCF/events.json","paper":"https://pith.science/paper/XH25QZGW"},"agent_actions":{"view_html":"https://pith.science/pith/XH25QZGW7AFJL4BXRRP6N6OYCF","download_json":"https://pith.science/pith/XH25QZGW7AFJL4BXRRP6N6OYCF.json","view_paper":"https://pith.science/paper/XH25QZGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0605218&json=true","fetch_graph":"https://pith.science/api/pith-number/XH25QZGW7AFJL4BXRRP6N6OYCF/graph.json","fetch_events":"https://pith.science/api/pith-number/XH25QZGW7AFJL4BXRRP6N6OYCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XH25QZGW7AFJL4BXRRP6N6OYCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XH25QZGW7AFJL4BXRRP6N6OYCF/action/storage_attestation","attest_author":"https://pith.science/pith/XH25QZGW7AFJL4BXRRP6N6OYCF/action/author_attestation","sign_citation":"https://pith.science/pith/XH25QZGW7AFJL4BXRRP6N6OYCF/action/citation_signature","submit_replication":"https://pith.science/pith/XH25QZGW7AFJL4BXRRP6N6OYCF/action/replication_record"}},"created_at":"2026-05-18T03:29:16.756940+00:00","updated_at":"2026-05-18T03:29:16.756940+00:00"}