Quantum computation of zeta functions of curves
| dc.creator | Kedlaya, Kiran S. | |
| dc.date | 2004-11-28 | |
| dc.date | 2005-11-30 | |
| dc.date.accessioned | 2026-07-07T06:39:05Z | |
| dc.date.available | 2026-07-07T06:39:05Z | |
| dc.description | We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field F_q, which is polynomial in g and log(q). This amounts to giving an algorithm to produce provably random elements of the class group of a curve, plus a recipe for recovering a Weil polynomial from enough of its cyclic resultants. The latter effectivizes a result of Fried in a restricted setting. | |
| dc.description | 17 pages; v3 (refereed version): minor corrections | |
| dc.identifier | https://arxiv.org/abs/math/0411623 | |
| dc.identifier | http://arxiv.org/abs/math/0411623 | |
| dc.identifier | preprint; published version: Computational Complexity 15 (2006), 1-19. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/100957 | |
| dc.subject | Number Theory | |
| dc.subject | 11M38 | |
| dc.title | Quantum computation of zeta functions of curves | |
| dc.type | text |