8 citations · 8 across the 3 of their papers we have counts for
5 papers
Tensor Reconstruction Beyond Constant Rank
Shir Peleg, Amir Shpilka, Ben Lee Volk
We give reconstruction algorithms for subclasses of depth-3 arithmetic circuits. In particular, we obtain the first efficient algorithm for finding tensor rank, and an optimal tens…
Robust Sylvester-Gallai type theorem for quadratic polynomials
Shir Peleg, Amir Shpilka
In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quad…
Lower Bounds on Stabilizer Rank
Shir Peleg, Amir Shpilka, Ben Lee Volk
The stabilizer rank of a quantum state is the minimal such that for and stabilizer…
Polynomial time deterministic identity testingalgorithm for circuits via Edelstein-Kelly type theorem for quadratic polynomials
Shir Peleg, Amir Shpilka
In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS13] and Gupta [Gup14], by proving an analog of a theorem of Edelstein and Kelly for quadratic polynomials. As…
A generalized Sylvester-Gallai type theorem for quadratic polynomials
Shir Peleg, Amir Shpilka
In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for t…