{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:WJFXCPXR3M6IT4KVDATXQEWPLU","short_pith_number":"pith:WJFXCPXR","schema_version":"1.0","canonical_sha256":"b24b713ef1db3c89f15518277812cf5d2416fd53f159ff2359770eb8254d5a3f","source":{"kind":"arxiv","id":"0904.2560","version":1},"attestation_state":"computed","paper":{"title":"Quantum Fourier Transform Over Galois Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yong Zhang","submitted_at":"2009-04-16T18:51:43Z","abstract_excerpt":"Galois rings are regarded as \"building blocks\" of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum algorithms and quantum error correction codes over Galois rings, we study the quantum Fourier transform (QFT) over Galois rings and prove it can be efficiently preformed on a quantum computer. The properties of the QFT over Galois rings lead to the quantum algorithm for hidden linear structures over Galois rings."},"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":"0904.2560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2009-04-16T18:51:43Z","cross_cats_sorted":[],"title_canon_sha256":"156f04ee1734e2d1ab603c1890bac08be9ad4420f969d53282de7ee67bef3b05","abstract_canon_sha256":"c5d712db15fa6a9102bcc114cb2f21386621cb9ffe0a08fb941e2a7dd3c5e9e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:41:19.472636Z","signature_b64":"gt3D4Fp8cyJL8TZ/SkiMprtXxiz72uaOcJ9UdsP0VPdVaRcL6S/8oI/Icjl7UMIEV/GznI5ATjBcAVFZuyKKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b24b713ef1db3c89f15518277812cf5d2416fd53f159ff2359770eb8254d5a3f","last_reissued_at":"2026-07-04T15:41:19.472220Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:41:19.472220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Fourier Transform Over Galois Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Yong Zhang","submitted_at":"2009-04-16T18:51:43Z","abstract_excerpt":"Galois rings are regarded as \"building blocks\" of a finite commutative ring with identity. There have been many papers on classical error correction codes over Galois rings published. As an important warm-up before exploring quantum algorithms and quantum error correction codes over Galois rings, we study the quantum Fourier transform (QFT) over Galois rings and prove it can be efficiently preformed on a quantum computer. The properties of the QFT over Galois rings lead to the quantum algorithm for hidden linear structures over Galois rings."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2560","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/0904.2560/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":"0904.2560","created_at":"2026-07-04T15:41:19.472284+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.2560v1","created_at":"2026-07-04T15:41:19.472284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2560","created_at":"2026-07-04T15:41:19.472284+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJFXCPXR3M6I","created_at":"2026-07-04T15:41:19.472284+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJFXCPXR3M6IT4KV","created_at":"2026-07-04T15:41:19.472284+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJFXCPXR","created_at":"2026-07-04T15:41:19.472284+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.18968","citing_title":"Calibrated hypergraph states: II calibrated hypergraph state construction and applications","ref_index":62,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJFXCPXR3M6IT4KVDATXQEWPLU","json":"https://pith.science/pith/WJFXCPXR3M6IT4KVDATXQEWPLU.json","graph_json":"https://pith.science/api/pith-number/WJFXCPXR3M6IT4KVDATXQEWPLU/graph.json","events_json":"https://pith.science/api/pith-number/WJFXCPXR3M6IT4KVDATXQEWPLU/events.json","paper":"https://pith.science/paper/WJFXCPXR"},"agent_actions":{"view_html":"https://pith.science/pith/WJFXCPXR3M6IT4KVDATXQEWPLU","download_json":"https://pith.science/pith/WJFXCPXR3M6IT4KVDATXQEWPLU.json","view_paper":"https://pith.science/paper/WJFXCPXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.2560&json=true","fetch_graph":"https://pith.science/api/pith-number/WJFXCPXR3M6IT4KVDATXQEWPLU/graph.json","fetch_events":"https://pith.science/api/pith-number/WJFXCPXR3M6IT4KVDATXQEWPLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJFXCPXR3M6IT4KVDATXQEWPLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJFXCPXR3M6IT4KVDATXQEWPLU/action/storage_attestation","attest_author":"https://pith.science/pith/WJFXCPXR3M6IT4KVDATXQEWPLU/action/author_attestation","sign_citation":"https://pith.science/pith/WJFXCPXR3M6IT4KVDATXQEWPLU/action/citation_signature","submit_replication":"https://pith.science/pith/WJFXCPXR3M6IT4KVDATXQEWPLU/action/replication_record"}},"created_at":"2026-07-04T15:41:19.472284+00:00","updated_at":"2026-07-04T15:41:19.472284+00:00"}