A recent press release from the Viterbi School of Engineering at USC discussed the proof of the Lindelöf hypothesis by Athanassios Fokas, a visiting professor from the Department of Applied Mathematics and Theoretical Physics at the University of Cambridge.

In the press release, it is noted that the proof has implications for computational complexity theory and quantum computing, but no real details are provided. I've skimmed the paper on arXiv.org, but I don't believe such implications are noted and (unfortunately) mathematical proofs are not my area of expertise.

So, as stated, my question is: How would a proof of the Lindelöf hypothesis improve our understanding of computational complexity classes? I'm especially interested in any refinements that relate to quantum computing (assuming they do in fact exist).

  • 4
    $\begingroup$ Good question, probably triggered by mathoverflow.net/questions/303888/lindelof-hypothesis-claim. However, that question correctly labels that press release as a "puff piece"... The current arXiv version no longer claims a proof. Even the non-extended Riemann hypothesis has nearly no known implications on complexity classes. Probably asking on MO about the "Lindelöf implies most of the claims of Riemann and Riemann fully implies Lindelöf, therefore a proof of Lindelöf equals a major breakthrough in the field of mathematics." claim would have produced more illuminating answers... $\endgroup$ Jun 29, 2018 at 10:33
  • $\begingroup$ Thank you for the clarification - it’s a shame that the press release is so puffed, but not altogether surprising I suppose. It’s especially confusing considering the recent date of the press release (June, 2018) and the more recent preprint on arXiv (which lacks any of the assertions made). Anyway, I actually didn’t see the mathoverflow question, the press release popped up in my HackerNews feed - should have searched that exchange too. If you write up your comment as an answer I’ll go ahead and accept it. $\endgroup$
    – Greenstick
    Jun 30, 2018 at 19:31


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.