Fernando Granha Jeronimo

Fernando Granha Jeronimo is an Assistant Professor at the Siebel School of Computing and Data Science, University of Illinois Urbana-Champaign. His research explores theoretical computer science with emphases on coding theory, expander graphs, quantum computing, and optimization. He holds a PhD from the University of Chicago, M.Sc./B.Sc. degrees from Unicamp (Brazil), and an engineering degree from Telecom Paris.

His work investigates interactions between complexity theory, pseudorandomness, quantum algorithms, and high-dimensional expanders. Recent studies focus on explicit code constructions near information-theoretic bounds, quantum-classical complexity separations, and efficient decoding algorithms leveraging expander properties.

Publications demonstrate consistent focus on coding theory (explicit codes, list decoding), quantum complexity (unentangled proofs, pseudoentanglement), and optimization (LP/SDP hierarchies). A trend toward quantum applications is evident in recent works on quantum LDPC codes and property testing.

Awards & Fellowships:

• Simons-Berkeley Fellow
• Google Research Fellow
• TA Prize, University of Chicago (awarded twice)

Advising & Grants: Actively recruits graduate students for his research group. Previously supported by Simons Institute and Google Research Fellowship during postdoctoral work at IAS. Current courses include quantum computing (CS 498) and advanced topics in codes/optimization (CS 598).

Leads the Local-to-Global TCS Mentorship Program and research groups focused on coding theory, quantum complexity, and expander applications.