pith. sign in

arxiv: quant-ph/0511041 · v1 · submitted 2005-11-04 · 🪐 quant-ph

Synthesis of Ternary Quantum Logic Circuits by Decomposition

classification 🪐 quant-ph
keywords quantumbeencircuitssynthesisternaryclusterdecompositionlogic
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A Conceptual Technology-Dependent Framework of Ternary Quantum Gates

    quant-ph 2026-04 unverdicted novelty 3.0

    A technology-dependent conceptual design for ternary quantum gates including Chrestenson, Z3 variants, controlled gates, a non-phase SWAP, and a GF(3)-based Toffoli for qutrit systems.