Abstract
We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot be composed. In oracle terms, we give a relativized world where ZQP^\{ZQP\}\=ZQP, while classically we always have ZPP^\{ZPP\}=ZPP.