Asymmetric two-output quantum processor in any dimension

We propose two different implementations of an asymmetric two-output probabilistic quantum processor, which can implement a restricted set of one-qubit operations. One of them is constructed by combining asymmetric telecloning with a quantum gate array. We analyze the efficiency of this processor by evaluating the fidelities between the desired operation and the one generated by the processor and show that the two output states are the same as the ones produced by the optimal universal asymmetric Pauli cloning machine. The schemes require only local operations and classical communication, they have the advantage of transmitting the two output states directly to two spatially separated receivers but they have a success probability of 1/2. We show further that we can perform the same one-qubit operation with unity probability at the cost of using nonlocal operations. We finally generalize the two schemes for D-level systems and find that the local ones are successful with a probability of 1/D and the nonlocal generalized scheme is always successful.