A semantic embedding of quantified conditional logic in clasical higher-order logic is utilized for reducing cut-elimination in the former logic to existing results for the latter logic. The presented embedding approach is adaptable to a wide range of other logics, for many of which cut-elimination is still open. However, special attention has to be paid to cut-simulation which may render cut elimination as a pointless criterion.