Shared quantum control via sharing operation on remote single qutrit

TL;DR

This paper extends quantum operation sharing schemes from qubits to qutrits, classifies operations by probability, and compares two schemes to determine the more efficient one based on resources and success rates.

Contribution

It generalizes existing qubit sharing schemes to qutrits, classifies operations into three probability-based classes, and provides a comprehensive comparison of two sharing schemes.

Findings

The second scheme is more optimal overall.

Ten and three restricted operation sets are identified for two classes.

Comparison covers resource use, complexity, success probability, and efficiency.

Abstract

Two qubit operation sharing schemes [J. Phys. B 44 (2011) 165508] are generalized to qutrit ones. Operations to be shared are classified into three different classes in terms of different probabilities (i.e, 1/3, 2/3 and 1). For the latter two classes, ten and three restricted sets of operations are found out, respectively. Moreover, the two generalized schemes are amply compared from four aspects, namely, quantum and classical resource consumption, necessaryoperation complexity, success probability and efficiency. It is found that the second scheme is overall more optimal than the first one as far as three restricted sets of operations are concerned.