Yann Tal

collaborators

2 papers

quant-ph2026

Quantum Algorithms for Modular Factorials

Yann Tal

We give a bounded-error quantum algorithm that, given a prime $p$ , a divisor $q ∣ (p - 1)$ , and an integer $0 < n < p$ , computes $n! mod p$ in expected time $\widetilde{O}(q^c+\sqrt{p/…

cs.CC2026

Polynomial Identity Testing and Reconstruction for Depth-4 Powering Circuits of High Degree

Amir Shpilka, Yann Tal

We study deterministic polynomial identity testing (PIT) and reconstruction algorithms for depth- $4$ arithmetic circuits of the form \[ Σ^{[r]}\!\wedge^{[d]}\!Σ^{[s]}\!Π^{[δ]}. \]…