Given a number field K and a polynomial ϕ(z) ∈ K[z] of degree at least 2, one can construct a finite directed graph G(ϕ, K) whose vertices are the K-rational preperiodic points for f , with an edge α → β if and only if ϕ(α) = β. Restricting to quadratic polynomials, the dynamical uniform boundedness conjecture of Morton and Silverman suggests that for a given number field K, there should only be finitely many isomorphism classes of directed graphs that arise in this way. Poonen has given a conjecturally complete classification of all such directed graphs over Q, while recent and ongoing work of the author, Faber, Krumm, and Wetherell has provided a detailed study of this question for all quadratic extensions of Q. In this article, we give a conjecturally complete classification like Poonen's, but over the cyclotomic quadratic fields Q( √ −1) and Q( √ −3). The main tools we use are dynamical modular curves and results concerning quadratic points on curves.Proof of Theorem 4.6. For (A), we note that 3 is a prime of good reduction for J 1 (4), and thatMoreover, since 5 is a prime of good reduction and #J 1 (4)(F 5 2 ) = 2 7 · 5, J 1 (4)(K) cannot have 3-torsion. Hence J 1 (4)(K) tors → (Z/2Z) 3 ⊕ Z/10Z.Since J 1 (4)(Q) tors ∼ = Z/2Z ⊕ Z/10Z, the only way for J 1 (4)(K) tors to be strictly larger than J 1 (4)(Q) tors is for J 1 (4) to gain a 2-torsion point upon base change from Q to K. By Lemma 3.1,