معرفی
David Earl Roberson is an Associate Professor at the Department of Applied Mathematics and Computer Science, Technical University of Denmark (DTU). His research focuses on graph theory, quantum computing, and algorithms, with particular emphasis on quantum strategies for graph-based nonlocal games and the interplay between graph isomorphism and algebraic structures. He is affiliated with the Algorithms, Logic and Graphs research center and the Center for Quantum Technologies.
His educational background is not explicitly detailed, but his professional activities include supervision of PhD candidates such as P. Nigam Kar in projects exploring quantum strategies and nonlocal games. His work often intersects with mathematical physics, leveraging tools from operator algebras and permutation groups.
- Office: Richard Petersens Plads 322, 2800 Kgs. Lyngby, Denmark
- ORCID: 0000-0002-4463-8095
- Website: compute.dtu.dk
Key research themes include quantum automorphism groups of graphs, Lasserre hierarchy applications to graph isomorphism, and transitive nonlocal games. His work bridges theoretical computer science and quantum information theory, with publications in venues like Journal of the London Mathematical Society and Mathematical Programming.
Collaborations involve international teams exploring quantum permutation groups and homomorphism indistinguishability, with recent focus on algebraic characterizations of graph properties and optimization models in quantum computing.
