Jeroen Zuiddam

I am a mathematician and computer scientist working at the Courant Institute of Mathematical Sciences of New York University. I am a Simons Junior Fellow in the Simons Society of Fellows. From 2018 to 2020 I was a member in the School of Mathematics at the Institute for Advanced Study in Princeton.

Until 2018 I worked at CWI, the national research institute for mathematics and computer science in the Netherlands. I received my PhD cum laude from the University of Amsterdam in October 2018.


jzuiddam at nyu dot edu


My work broadly speaking focuses on algebraic complexity theory, quantum information theory and discrete mathematics. Studying the interaction between asymptotics, symmetry and approximation, I am for example interested in fast matrix multiplication, Shannon capacity and the algebraic version of the P versus NP problem, and I use methods from diverse fields, including representation theory, algebraic geometry, information theory, optimization and real semi-algebraic geometry.

Jeroen Zuiddam


  1. A note on the gap between rank and border rank (arXiv, journal)
    Jeroen Zuiddam
    Linear Algebra and its Applications, 2017
  2. Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication (arXiv, proceedings)
    Harry Buhrman, Matthias Christandl and Jeroen Zuiddam
    Innovations in Theoretical Computer Science Conference (ITCS) 2017
  3. Clean quantum and classical communication protocols (arXiv, journal)
    Harry Buhrman, Matthias Christandl, Christopher Perry and Jeroen Zuiddam
    Physical Review Letters, 2016
  4. Tensor surgery and tensor rank (arXiv, journal)
    Matthias Christandl and Jeroen Zuiddam
    Computational complexity, 2018
  5. On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination (arXiv, journal)
    Jop Briët and Jeroen Zuiddam
    Quantum Information and Computation, 2017
  6. Asymptotic tensor rank of graph tensors: beyond matrix multiplication (arXiv, journal)
    Matthias Christandl, Péter Vrana and Jeroen Zuiddam
    Computational complexity, 2018
  7. On algebraic branching programs of small width (arXiv, eccc, proceedings, journal)
    Karl Bringmann, Christian Ikenmeyer and Jeroen Zuiddam
    Computational Complexity Conference (CCC) 2017, slides
    Journal of the ACM, 2018
  8. The border support rank of two-by-two matrix multiplication is seven (arXiv, journal)
    Markus Bläser, Matthias Christandl and Jeroen Zuiddam
    Chicago Journal of Theoretical Computer Science, 2018
  9. Tensor rank is not multiplicative under the tensor product (arXiv, journal)
    Matthias Christandl, Asger Kjærulff Jensen and Jeroen Zuiddam
    Linear Algebra and its Applications, 2018
  10. Universal points in the asymptotic spectrum of tensors (arXiv, proceedings)
    Matthias Christandl, Péter Vrana and Jeroen Zuiddam
    Conference on Quantum Information Processing (QIP) 2018, slides
    Symposium on the Theory of Computing (STOC) 2018, slides
  11. The asymptotic spectrum of graphs and the Shannon capacity (arXiv, journal)
    Jeroen Zuiddam
    Combinatorica, 2019
  12. Quantum asymptotic spectra of graphs and non-commutative graphs, and quantum Shannon capacities (arXiv)
    Yinan Li and Jeroen Zuiddam
    October 2018
  13. Barriers for fast matrix multiplication from irreversibility (arXiv, proceedings)
    Matthias Christandl, Péter Vrana and Jeroen Zuiddam
    Computational Complexity Conference (CCC) 2019, slides
    Theory of Computing, to appear
  14. The asymptotic induced matching number of hypergraphs: balanced binary strings (arXiv, journal)
    Srinivasan Arunachalam, Péter Vrana and Jeroen Zuiddam
    Electronic Journal of Combinatorics, 2020
  15. Geometric rank of tensors and subrank of matrix multiplication (arXiv, eccc, proceedings)
    Swastik Kopparty, Guy Moshkovitz and Jeroen Zuiddam
    Computational Complexity Conference (CCC) 2020, slides, video
  16. Barriers for rectangular matrix multiplication (arXiv, eccc)
    Matthias Christandl, Francois Le Gall, Vladimir Lysikov and Jeroen Zuiddam
    March 2020
  17. Border rank non-additivity for higher order tensors (arxiv)
    Matthias Christandl, Fulvio Gesmundo, Mateusz Michałek, Jeroen Zuiddam
    July 2020

PhD thesis

Algebraic complexity, asymptotic spectra and entanglement polytopes, University of Amsterdam, October 2018

Recent Talks

  1. Dutch Mathematical Congress 2018, Royal Dutch Mathematical Society, The asymptotic spectrum of tensors
  2. Monday Lectures, Facets of complexity, Technische Universität Berlin, 9 July 2018, Asymptotic spectra of tensors and graphs: matrix multiplication exponent and Shannon capacity
  3. CSDM seminar, Institute for Advanced Study, October 2018, Asymptotic spectra and applications
    Notes: Part I Part II
    Video: Short Part I Part II
  4. Oberwolfach, Complexity Theory, November 2018, Asymptotic spectra
  5. Princeton discrete mathematics seminar, 7 March 2019
  6. Rutgers discrete mathematics seminar, 29 April 2019
  7. Mathematics of Quantum Information Theory, Lorentz center, Leiden, (1) Asymptotic spectra and (2) Inequalities among symmetric polynomials on the unit cube
  8. NYU theoretical computer science seminar, 21 May 2019
  9. CWI Amsterdam, 13 May 2020, Geometric Rank of Tensors