Pith. sign in

REVIEW 1 cited by

Synthesis of Ternary Quantum Logic Circuits by Decomposition

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0511041 v1 pith:CE534HMT submitted 2005-11-04 quant-ph

classification quant-ph
keywords quantumbeencircuitssynthesisternaryclusterdecompositionlogic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. MAPS: A Novel Multi-Axial Projective Sphere for Geometrically Visualizing Higher d-Valued Quantum State-Space of Qudits

    quant-ph 2026-06 unverdicted novelty 4.0 of 10

    The paper proposes the MAPS framework with n projectional intersecting spatial axes for visualizing qudit state-spaces and introduces novel d-valued phase axial-based gates.

Pith tools