Biography:Simone Severini

From HandWiki
Revision as of 09:09, 7 February 2024 by Sherlock (talk | contribs) (simplify)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Short description: Italian computer scientist
Simone Severini
NationalityItalian, British
EducationUniversity of Bristol (PhD)
Alma materUniversity of Florence
Known forBraunstein-Ghosh-Severini Entropy
Induced gravity
Quantum contextuality
AwardsRoyal Society University Research Fellowship
Newton International Fellowship
Scientific career
FieldsPhysics, Computer Science, Quantum Computing
InstitutionsUCL
Institute for Quantum Computing
Doctoral advisorRichard Jozsa[1]
Websitewww.ucl.ac.uk/~ucapsse

Simone Severini is an Italian-born British computer scientist. He is currently Professor of Physics of Information at University College London, and Director of Quantum Computing at Amazon Web Services.

Work

Severini worked in quantum information science and complex systems. Together with Adan Cabello and Andreas Winter, he defined a graph-theoretic framework for studying quantum contextuality, and together with Tomasz Konopka, Fotini Markopoulou, and Lee Smolin, he introduced a random graph model of spacetime called quantum graphity.[2][3] He served as an editor of Philosophical Transactions of the Royal Society A. In 2015 he was one of the first scientific advisors of Cambridge Quantum Computing, with Béla Bollobás, Imre Leader, and Fernando Brandão. In network theory, he co-introduced the Braunstein–Ghosh–Severini entropy,[4] with applications to quantum gravity.

Publications

References

  1. Mathematics Genealogy Project
  2. Roberto Mangabeira Unger, Lee Smolin, The Singular Universe and the Reality of Time: A Proposal in Natural Philosophy, Cambridge University Press (2014).
  3. Shyam Wuppuluri and Giancarlo Ghirardi (Eds.), Space, Time and the Limits of Human Understanding (Foreword by John Stachel and Afterword by Noam Chomsky), Springer (2017).
  4. Braunstein, Samuel L.; Ghosh, Sibasish; Severini, Simone (2006). "The Laplacian of a Graph as a Density Matrix: A Basic Combinatorial Approach to Separability of Mixed States". Annals of Combinatorics (Springer Science and Business Media LLC) 10 (3): 291–317. doi:10.1007/s00026-006-0289-3. ISSN 0218-0006.