The polynomial bound conjecture for real cyclotomic class numbers
Let be a positive integer, let be the maximal real subfield of the th cyclotomic field, and let denote its class number. Polynomial bound conjecture. There is a fixed polynomial such that, for all integers ,
This is presented as a precise form of the folklore conjecture that the real cyclotomic class number is small but hard to compute. Its resolution would support the claimed efficiency benefits for the cyclotomic-field quantum algorithms, but no resolution is supplied in the source.
References
- Razvan Barbulescu and Adrien Poulalion, “The special case of cyclotomic fields in quantum algorithms for unit groups”, arXiv:2303.03978 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.