State, trace, and moment polynomials are polynomial expressions in several operator or random variables and positive functionals on their products (states, traces, or expectations). These concepts, and in particular their positivity and optimization, arose from problems in quantum information theory, yet they naturally fit under the umbrella of multivariate operator theory. This survey presents state, trace, and moment polynomials in a concise and unified way and highlights their similarities and differences. The focal point is their positivity and optimization. Sums of squares certificates for unconstrained and constrained positivity (Positivstellensätze) are given, and parallels with their commutative and freely noncommutative analogs are discussed. They are used to design a convergent hierarchy of semidefinite programs for optimization of state, trace, and moment polynomials. Finally, circling back to the original motivation behind the derived theory, multiple applications in quantum information theory are outlined.