Davi De-Castro-Silva

Davi De-Castro-Silva is a Researcher at the Department of Computer Science and Technology, University of Cambridge. He is affiliated with the Centre for Quantum Information and Foundations and previously worked at CWI Amsterdam as part of the quantum computing group QuSoft. His academic journey includes a PhD in Applied Mathematics at the University of Cologne and a Master in Mathematics at IMPA.

• Education
• Cycle Ingénieur, École Polytechnique
• Master in Mathematics, IMPA
• PhD in Applied Mathematics, University of Cologne

His research spans theoretical computer science, quantum computing, and combinatorics, focusing on understanding quantum computational power, additive combinatorics (higher-order Fourier analysis), combinatorial optimization (semidefinite programming), and computational complexity (lower bounds). He explores the relationship between quantum speedups and problem symmetries.

Recent publications analyze quantum algorithms, quasirandomness, and geometric extremal problems, with a recurring emphasis on the interplay between quantum computing and structural mathematics. He contributes to journals like Discrete Analysis and Forum of Mathematics, Sigma, while also presenting at conferences such as ITCS and EUROCOMB.

Key Research Contributions

• Quantum computational complexity and speedup analysis
• Quasirandom structures in additive groups
• Optimization techniques for load-balanced bin packing
• Recursive methods in hypergraph and Lovász theta functions