Synthesis of Ternary Quantum Logic Circuits by Decomposition
| dc.creator | Khan, Faisal Shah | |
| dc.creator | Perkowski, Marek | |
| dc.date | 2005-11-04 | |
| dc.date.accessioned | 2026-07-07T06:52:39Z | |
| dc.date.available | 2026-07-07T06:52:39Z | |
| dc.description | 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. | |
| dc.description | 6 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0511041 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0511041 | |
| dc.identifier | Proceedings of the 7th International Symposium on Representations and Methodology of Future Computing Technologies RM2005 (Reed Muller 2005) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/105368 | |
| dc.subject | Quantum Physics | |
| dc.title | Synthesis of Ternary Quantum Logic Circuits by Decomposition | |
| dc.type | text |