Synthesis of Ternary Quantum Logic Circuits by Decomposition

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.

6 pages, 5 figures

References in corpus (5)

• Elementary gates for quantum computation
• Quantum Circuits for General Multiqubit Gates
• Quantum Encodings in Spin Systems and Harmonic Oscillators
• Asymptotically Optimal Quantum Circuits for d-level Systems
• Quantum Optical Construction of Generalized Pauli and Walsh-Hadamard Matrices in Three Level Systems

Cited by in corpus (5)

• Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators
• Synthesis of multi-qudit Hybrid and d-valued Quantum Logic Circuits by Decomposition
• Jordan C*-Algebras and Supergravity
• Extremal Black Holes as Qudits
• Algebraic Characterization of CNOT-Based Quantum Circuits with its Applications on Logic Synthesis