{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6ILJOAYGZ3G4CH6GDFNYTQIGBB","short_pith_number":"pith:6ILJOAYG","schema_version":"1.0","canonical_sha256":"f216970306cecdc11fc6195b89c10608526390b413472a745995e1b8501836c0","source":{"kind":"arxiv","id":"1807.03600","version":2},"attestation_state":"computed","paper":{"title":"On quantum computation of Kloosterman sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"quant-ph","authors_text":"Peter Bruin","submitted_at":"2018-07-10T12:57:45Z","abstract_excerpt":"We give two quantum algorithms for computing (twisted) Kloosterman sums attached to a finite field $\\mathbf{F}$ of $q$ elements. The first algorithm computes a quantum state containing, as its coefficients with respect to the standard basis, all Kloosterman sums for $\\mathbf{F}$ twisted by a given multiplicative character, and runs in time polynomial in $\\log q$. The second algorithm computes a single Kloosterman sum to a prescribed precision, and runs in time quasi-linear in $\\sqrt{q}$."},"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":"1807.03600","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-10T12:57:45Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"5493fbf7a5e0b21e96648d013fb7001e826ef82e61d1f011536ec14a0de3ee74","abstract_canon_sha256":"1b878ea80aa3aeb03022239693840cf8119ad26e430c2f9ab84000b6342eba36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:12.723480Z","signature_b64":"jGhAfRUTbSDVb4uKpN4wzN1MVwI/siXCtNnzCddL65mtU2xv3qzWO1P1gOiFOMZIKZa0zCeXJIFpG7xcZ/gZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f216970306cecdc11fc6195b89c10608526390b413472a745995e1b8501836c0","last_reissued_at":"2026-05-18T00:04:12.722765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:12.722765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On quantum computation of Kloosterman sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"quant-ph","authors_text":"Peter Bruin","submitted_at":"2018-07-10T12:57:45Z","abstract_excerpt":"We give two quantum algorithms for computing (twisted) Kloosterman sums attached to a finite field $\\mathbf{F}$ of $q$ elements. The first algorithm computes a quantum state containing, as its coefficients with respect to the standard basis, all Kloosterman sums for $\\mathbf{F}$ twisted by a given multiplicative character, and runs in time polynomial in $\\log q$. The second algorithm computes a single Kloosterman sum to a prescribed precision, and runs in time quasi-linear in $\\sqrt{q}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03600","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":"1807.03600","created_at":"2026-05-18T00:04:12.722882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03600v2","created_at":"2026-05-18T00:04:12.722882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03600","created_at":"2026-05-18T00:04:12.722882+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ILJOAYGZ3G4","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ILJOAYGZ3G4CH6G","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ILJOAYG","created_at":"2026-05-18T12:32:08.215937+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/6ILJOAYGZ3G4CH6GDFNYTQIGBB","json":"https://pith.science/pith/6ILJOAYGZ3G4CH6GDFNYTQIGBB.json","graph_json":"https://pith.science/api/pith-number/6ILJOAYGZ3G4CH6GDFNYTQIGBB/graph.json","events_json":"https://pith.science/api/pith-number/6ILJOAYGZ3G4CH6GDFNYTQIGBB/events.json","paper":"https://pith.science/paper/6ILJOAYG"},"agent_actions":{"view_html":"https://pith.science/pith/6ILJOAYGZ3G4CH6GDFNYTQIGBB","download_json":"https://pith.science/pith/6ILJOAYGZ3G4CH6GDFNYTQIGBB.json","view_paper":"https://pith.science/paper/6ILJOAYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03600&json=true","fetch_graph":"https://pith.science/api/pith-number/6ILJOAYGZ3G4CH6GDFNYTQIGBB/graph.json","fetch_events":"https://pith.science/api/pith-number/6ILJOAYGZ3G4CH6GDFNYTQIGBB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ILJOAYGZ3G4CH6GDFNYTQIGBB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ILJOAYGZ3G4CH6GDFNYTQIGBB/action/storage_attestation","attest_author":"https://pith.science/pith/6ILJOAYGZ3G4CH6GDFNYTQIGBB/action/author_attestation","sign_citation":"https://pith.science/pith/6ILJOAYGZ3G4CH6GDFNYTQIGBB/action/citation_signature","submit_replication":"https://pith.science/pith/6ILJOAYGZ3G4CH6GDFNYTQIGBB/action/replication_record"}},"created_at":"2026-05-18T00:04:12.722882+00:00","updated_at":"2026-05-18T00:04:12.722882+00:00"}