Unfortunately one cannot (faithfuly) simulate a (fair) die using (sequences of) fair coin(s).
Simply because the event space of a die has a dimensiolitydimensionality of $6$ and this cannot be exactly matched by a power of $2$ (which is what the event space of a fair coin provides).
But one can do this with a fair "tri-coin" (if such a term can be used). Meaning a coin with 3 outcomes. And a simple 2-coin, so the joint space of these 2 coins matches exactly the event space of the die.
Rejection sampling (as mentioned in some answers) may provide an approximate simulation indeed. But it will still have an amount of error or mis-match of probabilities (in finite time). So if one wants to actually match the event spaces of these 2 systems, there will be cases it doeswill not work.
In factprobabilistic simulation (of which rejection sampling may take arbitrarily long to getis an outcomeexample), generated typical sequences do indeed exhibit the relative elementary probabilities (in this case the event space of a die). However (as mentioned in comments) in rangeeach of these typical sequences can contain arbitrarily long sub-sequences of exactly the same outcomes. This means that in order to use rejection sampling (since sequencesin some cases) either it can betake arbitrarily long with a specific outcomeor the generated distribution will be biased (i.e not fair die), sodue to over-representation or under-representation of some parts of its event space. if this was not the statement about practicality iscase, then a deterministic algorithm would be possible which would exactly match the event spaces of a die and a coin (which do not rigorously correctmatch by dimensionality).