Jeroen Zuiddam

According to our database, Jeroen Zuiddam authored at least 34 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Computing moment polytopes - with a focus on tensors, entanglement and matrix multiplication.

Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter, Jeroen Zuiddam

CoRR, October, 2025

A group-theoretic approach to Shannon capacity of graphs and a limit theorem from lattice packings.

Pjotr Buys, Sven Polak, Jeroen Zuiddam

CoRR, June, 2025

Barriers for rectangular matrix multiplication.

Matthias Christandl, François Le Gall, Vladimir Lysikov, Jeroen Zuiddam

Comput. Complex., June, 2025

Explicit non-free tensors.

Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter, Jeroen Zuiddam

CoRR, March, 2025

The moment polytope of matrix multiplication is not maximal.

Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter, Jeroen Zuiddam

CoRR, March, 2025

Asymptotic Tensor Rank Is Characterized by Polynomials.

Matthias Christandl, Koen Hoeberechts, Harold Nieuwboer, Péter Vrana, Jeroen Zuiddam

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Computing Moment Polytopes of Tensors, with Applications in Algebraic Complexity and Quantum Information.

Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter, Jeroen Zuiddam

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024

The asymptotic spectrum distance, graph limits, and the Shannon capacity.

David de Boer, Pjotr Buys, Jeroen Zuiddam

CoRR, 2024

Discreteness of Asymptotic Tensor Ranks (Extended Abstract).

Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

A Gap in the Subrank of Tensors.

Matthias Christandl, Fulvio Gesmundo, Jeroen Zuiddam

SIAM J. Appl. Algebra Geom., December, 2023

The next gap in the subrank of 3-tensors.

Fulvio Gesmundo, Jeroen Zuiddam

CoRR, 2023

Discreteness of asymptotic tensor ranks.

Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam

CoRR, 2023

2022

Larger Corner-Free Sets from Combinatorial Degenerations.

Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors.

Harm Derksen, Visu Makam, Jeroen Zuiddam

Proceedings of the 37th Computational Complexity Conference, 2022

2021

Quantum Asymptotic Spectra of Graphs and Non-Commutative Graphs, and Quantum Shannon Capacities.

Yinan Li, Jeroen Zuiddam

IEEE Trans. Inf. Theory, 2021

Border Rank Nonadditivity for Higher Order Tensors.

Matthias Christandl, Fulvio Gesmundo, Mateusz Michalek, Jeroen Zuiddam

SIAM J. Matrix Anal. Appl., 2021

Communication Complexity, Corner-Free Sets and the Symmetric Subrank of Tensors.

Matthias Christandl, Omar Fawzi, Hoang Ta, Jeroen Zuiddam

CoRR, 2021

Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms.

Robert Robere, Jeroen Zuiddam

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Weighted Slice Rank and a Minimax Correspondence to Strassen's Spectra.

Matthias Christandl, Vladimir Lysikov, Jeroen Zuiddam

CoRR, 2020

Border rank non-additivity for higher order tensors.

Matthias Christandl, Fulvio Gesmundo, Mateusz Michalek, Jeroen Zuiddam

CoRR, 2020

The Asymptotic Induced Matching Number of Hypergraphs: Balanced Binary Strings.

Srinivasan Arunachalam, Péter Vrana, Jeroen Zuiddam

Electron. J. Comb., 2020

Geometric Rank of Tensors and Subrank of Matrix Multiplication.

Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam

Proceedings of the 35th Computational Complexity Conference, 2020

2019

The Asymptotic Spectrum of Graphs and the Shannon Capacity.

Jeroen Zuiddam

Comb., 2019

Tensor surgery and tensor rank.

Matthias Christandl, Jeroen Zuiddam

Comput. Complex., 2019

Asymptotic tensor rank of graph tensors: beyond matrix multiplication.

Matthias Christandl, Péter Vrana, Jeroen Zuiddam

Comput. Complex., 2019

Barriers for Fast Matrix Multiplication from Irreversibility.

Matthias Christandl, Péter Vrana, Jeroen Zuiddam

Proceedings of the 34th Computational Complexity Conference, 2019

2018

The border support rank of two-by-two matrix multiplication is seven.

Markus Bläser, Matthias Christandl, Jeroen Zuiddam

Chic. J. Theor. Comput. Sci., 2018

Universal points in the asymptotic spectrum of tensors.

Matthias Christandl, Péter Vrana, Jeroen Zuiddam

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

Orthogonal rank and impossibility of quantum round elimination.

Jop Briët, Jeroen Zuiddam

Quantum Inf. Comput., 2017

Tensor rank is not multiplicative under the tensor product.

Matthias Christandl, Asger Kjærulff Jensen, Jeroen Zuiddam

CoRR, 2017

Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication.

Harry Buhrman, Matthias Christandl, Jeroen Zuiddam

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

On Algebraic Branching Programs of Small Width.

Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam

Proceedings of the 32nd Computational Complexity Conference, 2017

2016

On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination.

Jop Briët, Jeroen Zuiddam

CoRR, 2016

2015

A note on the gap between rank and border rank.

Jeroen Zuiddam

CoRR, 2015