An Algorithmic Approach for Generating Quantum Ternary Superposition Operators and Related Performance Measures

摘要

Quantum computing promises to outperform classical computing in terms of algorithmic speedup for certain classes of computational problems. A quantum algorithm exploits quantum mechanical processes like superposition, interference, and entanglement that works on quantum states of matter providing exponential or super polynomial speedup. In recent times, multi-valued quantum computing is gaining popularity due to its higher state space dimension, and ternary quantum computing is one of the most popular multi-valued quantum computing. In this paper, we propose an algorithmic approach for the generation of quantum ternary superposition operators and evaluating them in terms of trace distance, fidelity, and the entanglement measure. We also propose five new quantum ternary superposition operators, which have larger trace distance and smaller fidelity than the existing ternary superposition operators "Chrestenson gates" and "S-gate" (Sudhindu Bikash, IEEE Comput Soc 2014, [1]). To characterize the amount of entanglement in two given qutrit composite ternary states, we also measure the concurrence of the newly proposed and the existing quantum superposition operators. We have shown that the newly proposed superposition operators generate maximally entangled states with concurrence equal to 1.