Synthesis of Ternary Quantum Logic Circuits by Decomposition

TL;DR

This paper introduces a recursive synthesis method for ternary quantum circuits utilizing Cosine-Sine matrix decomposition, advancing the design of multi-valued quantum systems for scalable quantum computing.

Contribution

It presents a novel recursive synthesis approach for ternary quantum circuits based on Cosine-Sine matrix decomposition, improving upon previous methods.

Findings

Efficient synthesis of ternary quantum circuits demonstrated.

Enhanced scalability for multi-valued quantum computing systems.

Potential applications in quantum cryptography and qudit cluster states.

Abstract

Recent research in multi-valued logic for quantum computing has shown practical advantages for scaling up a quantum computer. Multivalued quantum systems have also been used in the framework of quantum cryptography, and the concept of a qudit cluster state has been proposed by generalizing the qubit cluster state. An evolutionary algorithm based synthesizer for ternary quantum circuits has recently been presented, as well as a synthesis method based on matrix factorization.In this paper, a recursive synthesis method for ternary quantum circuits based on the Cosine-Sine unitary matrix decomposition is presented.