Yes, there is a simpler way. It is called principle of deferred decisions. It goes like this. Condition on the parity of the first die throw. It is either 0 or 1. Now, the parity determines uniquely what the parity of the second die throw must be to have the resultant sum have parity 0. Thus,
\begin{align}
P(\text{even sum}) &= P(\text{even sum, first was even} + P(\text{even sum, first was odd}) \\
&= P(\text{even|first was even})P(\text{first was even}) + P(\text{even|first was odd})P(\text{first was odd})
\end{align}
Now, note that $P(\text{even|first was even}) = P(\text{second is even}) = 1/2$. Similarly, $P(\text{even|first was odd}) = P(\text{second is odd}) = 1/2$. Thus, we have $P(\text{even sum}) = 1/2\left(P(\text{first was even}) + P(\text{first was odd})\right) = 1/2\left(1\right) = 1/2$.
ADDENDUM: The principle of deferred decisions helps solve much harder similar problems. Consider this problem - you throw a die 10 times. What is the probability that the sum is a multiple of 6?
\begin{align}
P(\text{sum $\equiv 0 \mod 6$}) &= \sum_{i=0}^5 P(\text{sum $\equiv 0 \mod 6$}|\text{previous sum was $\equiv i \mod 6$}) \cdot P(\text{previous sum was $\equiv i \mod 6$})
\end{align}
Note that $P(\text{sum $\equiv 0 \mod 6$}|\text{previous sum was $\equiv i \mod 6$}) = 1/6$ because there is only one particular die value that will give us $(6-i) \mod 6$. Thus, $P(\text{sum $\equiv 0 \mod 6$}) = 1/6\left(\sum_{i=0}^5 P(\text{previous sum was $\equiv i \mod 6$})\right) = 1/6\left(1\right) = 1/6.$