On Random Purifications of Isometries and ChannelsResearch Paper
Lower bounds for quantum algorithms that query an unknown unitary or channel are much harder to prove than lower bounds for algorithms that query a classical function, because the oracle's answers are quantum states. A recurring difficulty is that an isometry , which models a state-preparation procedure or the purification…