The fan-in of any real-world classical gate is bounded by $B := 2^{2^{1000000}}$ because if you tried to store $B$-many distinct bits of information in the observable universe you would run out of space before you ran out of bits.
This does not mean that there cannot be practical uses for it, as there are plausibly real-world circuits that are well approximated by the unbounded model. This is not dissimilar to the fact that we talk about space as if it was structured like $\mathbb{R}$ in physics.
There are other ways that this model can be useful in applications as well. This answer raises the question
Is there a realistic quantum architecture which is effectively equivalent to the quantum circuit with unbounded fan-out?
and claims that the answer is yes. Here, even though the actual circuit cannot be built, something else that is computably equivalent can be. I'm not knowledgeable of quantum algorithms, but it seems obvious to me that there are plausible scenarios where you'd rather work with the circuit model than whatever the real-world model is.
Alternation between gate is related somehow (but I don't know more actually) to powerconsumption and speed of stabilisation of circuits. So I would say that actually it could be intersting. In practice, I doubt any circuits designer use results from circuits complexity.
– C.P. Jun 04 '19 at 17:50