In this paper, we review the Ramanujan conjecture in classical and modern settings and explain its various applications in computer science, including the explicit constructions of the spectrally extremal combinatorial objects, called Ramanujan graphs and Ramanujan complexes, points uniformly distributed on spheres, and Golden-Gate Sets in quantum computing. The connection between Ramanujan graphs/complexes and their zeta functions satisfying the Riemann hypothesis is also discussed.
|Original language||English (US)|
|Journal||Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences|
|State||Published - Jan 24 2020|
All Science Journal Classification (ASJC) codes
- Physics and Astronomy(all)