The no-quantum broadcasting theorem which is a weaker version of the nocloning theorem restricts us from broadcasting completely unknown quantum information to multiple users. However, if the sender is aware of the quantum information (state) to be broadcasted, then the above restriction disappears and the task reduces to a multiparty remote state preparation. Without recognizing this fact, several schemes for broadcasting of known quantum states have been proposed in the recent past and erroneously/misleadingly referred to as protocols for quantum broadcasting (e.g., Yu et al. in Quant Inf Process 16(2):41, 2017 presented a technically correct scheme for multiparty remote state preparation which can at best be referred to as broadcasting of known quantum states, but referred to it as a scheme for quantum broadcasting). Here, we elaborate on the relation between the protocols of remote state preparation and those of broadcasting of known quantum information and show that it is possible to broadcast known quantum information to multiple receivers in deterministic as well as probabilistic manner with optimal resources. Further, the effect of noise on such schemes, and some new facets (like joint broadcasting) of such schemes have been discussed. A proof of principle realization of the proposed optimal scheme using an IBM quantum computer is also reported. Possibilities of generalizations of the so-called broadcasting schemes and potential applications are also discussed with appropriate importance.