Two known nonorthogonal quantum states can be cloned either deterministically or probabilistically. In this paper, we investigate quantum cloning by combining these two extreme cases, i.e., a trade-off between the copy fidelity and the success probability. For a special set of two known nonorthogonal quantum states, we start with an explicit unitary transformation and derive the copy fidelity as a function of the success probability. The result shows that the higher is the copy fidelity, the less is the success probability. This quantum cloning may have important applications in quantum cryptography.
We show that quantum query complexity satisfies a strong direct product theorem. This means that computing
k copies of a function with less than
k times the quantum queries needed to compute one copy of the function implies that the overall success probability will be exponentially small in
k. For a boolean function
f we also show an XOR lemma -- computing the parity of
k copies of
f with less than
k times the queries needed for one copy implies that the advantage over random guessing will be exponentially small. We do this by showing that the multiplicative adversary method, which inherently satisfies a strong direct product theorem, characterizes bounded-error quantum query complexity. In particular, we show that the multiplicative adversary bound is always at least as large as the additive adversary bound, which is known to characterize bounded-error quantum query complexity.