One of the most active research directions in quantum computing currently is establishing quantum supremacy results: coming up with computational tasks which a quantum algorithm can solve super-polynomially faster than a classical algorithm.

Meta-complexity refers to the study of complexity of problems that are themselves about computational complexity. The canonical meta-complexity problem in the Boolean world is MCSP (Minimum Circuit Size Problem).

The multiplicity Schwartz-Zippel lemma provides a bound on the total multiplicity of zeroes of a low-degree polynomial within a product set.

Abstract: This talk will comprise of two parts. In the first half, I shall discuss about Reed-Muller Codes and Reed-Solomon Codes. Basically, we shall prove that Reed-Muller Codes are a subset of Reed-Solomon Codes.