Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms