The dichromatic number of a digraph $D$, denoted by $\vecχ(D)$, is the smallest number of colours required to colour the vertices of $D$ such that each colour class induces an acyclic digraph. A conjecture of Erdős and Neumann-Lara states that there exists a function $f(k)$ such that for every graph $G$ with $χ(G) \geq f(k)$ there is an orientation of $G$ such that the resulting digraph $D$ satisfies $\vecχ(D) \geq k$. We prove the list version of this conjecture: if $G$ has large list chromatic number then there is an orientation of $G$ such that the resulting digraph has large list dichromatic number. The main tool in our result is the following theorem, which is an extension of an analogous result of Alon for the chromatic number: every graph of minimum degree $d$ admits an orientation such that the resulting digraph has list dichromatic number of order at least $\ln d$.