{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VFEVWT3B2CKCF4JOEIMFF5AFIM","short_pith_number":"pith:VFEVWT3B","schema_version":"1.0","canonical_sha256":"a9495b4f61d09422f12e221852f405430031ff14199ce642530e98269380bc2a","source":{"kind":"arxiv","id":"1706.05114","version":1},"attestation_state":"computed","paper":{"title":"Design of Quantum Circuits for Galois Field Squaring and Exponentiation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Edgard Mu\\~noz-Coreas, Himanshu Thapliyal","submitted_at":"2017-06-15T23:34:29Z","abstract_excerpt":"This work presents an algorithm to generate depth, quantum gate and qubit optimized circuits for $GF(2^m)$ squaring in the polynomial basis. Further, to the best of our knowledge the proposed quantum squaring circuit algorithm is the only work that considers depth as a metric to be optimized. We compared circuits generated by our proposed algorithm against the state of the art and determine that they require $50 \\%$ fewer qubits and offer gates savings that range from $37 \\%$ to $68 \\%$. Further, existing quantum exponentiation are based on either modular or integer arithmetic. However, Galois"},"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":"1706.05114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-06-15T23:34:29Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"39b7ad5ad93763560a95bde251e9d79e73e477d52015d2d0379d51aeafcdfac1","abstract_canon_sha256":"fbf2a8d6911a02c425e0e98ea0fab781f8a9f39596764ada7fe177e37396bbaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:14.680599Z","signature_b64":"9UD2+/w3INylf48ecbYyQX0rqiwJ7wPMyKpcceW8pQDjvKFdgBY+n1TlL2Q+OmRg5eOrrrW6V36LMf6Xmz4zDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9495b4f61d09422f12e221852f405430031ff14199ce642530e98269380bc2a","last_reissued_at":"2026-05-18T00:42:14.680087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:14.680087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design of Quantum Circuits for Galois Field Squaring and Exponentiation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Edgard Mu\\~noz-Coreas, Himanshu Thapliyal","submitted_at":"2017-06-15T23:34:29Z","abstract_excerpt":"This work presents an algorithm to generate depth, quantum gate and qubit optimized circuits for $GF(2^m)$ squaring in the polynomial basis. Further, to the best of our knowledge the proposed quantum squaring circuit algorithm is the only work that considers depth as a metric to be optimized. We compared circuits generated by our proposed algorithm against the state of the art and determine that they require $50 \\%$ fewer qubits and offer gates savings that range from $37 \\%$ to $68 \\%$. Further, existing quantum exponentiation are based on either modular or integer arithmetic. However, Galois"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05114","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":""},"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":"1706.05114","created_at":"2026-05-18T00:42:14.680150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05114v1","created_at":"2026-05-18T00:42:14.680150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05114","created_at":"2026-05-18T00:42:14.680150+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFEVWT3B2CKC","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFEVWT3B2CKCF4JO","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFEVWT3B","created_at":"2026-05-18T12:31:49.984773+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/VFEVWT3B2CKCF4JOEIMFF5AFIM","json":"https://pith.science/pith/VFEVWT3B2CKCF4JOEIMFF5AFIM.json","graph_json":"https://pith.science/api/pith-number/VFEVWT3B2CKCF4JOEIMFF5AFIM/graph.json","events_json":"https://pith.science/api/pith-number/VFEVWT3B2CKCF4JOEIMFF5AFIM/events.json","paper":"https://pith.science/paper/VFEVWT3B"},"agent_actions":{"view_html":"https://pith.science/pith/VFEVWT3B2CKCF4JOEIMFF5AFIM","download_json":"https://pith.science/pith/VFEVWT3B2CKCF4JOEIMFF5AFIM.json","view_paper":"https://pith.science/paper/VFEVWT3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05114&json=true","fetch_graph":"https://pith.science/api/pith-number/VFEVWT3B2CKCF4JOEIMFF5AFIM/graph.json","fetch_events":"https://pith.science/api/pith-number/VFEVWT3B2CKCF4JOEIMFF5AFIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFEVWT3B2CKCF4JOEIMFF5AFIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFEVWT3B2CKCF4JOEIMFF5AFIM/action/storage_attestation","attest_author":"https://pith.science/pith/VFEVWT3B2CKCF4JOEIMFF5AFIM/action/author_attestation","sign_citation":"https://pith.science/pith/VFEVWT3B2CKCF4JOEIMFF5AFIM/action/citation_signature","submit_replication":"https://pith.science/pith/VFEVWT3B2CKCF4JOEIMFF5AFIM/action/replication_record"}},"created_at":"2026-05-18T00:42:14.680150+00:00","updated_at":"2026-05-18T00:42:14.680150+00:00"}