|
| related topics |
| {qubit, qubits, gate} |
| {let, theorem, proof} |
| {cos, sin, state} |
| {state, algorithm, problem} |
| {algorithm, log, probability} |
| {equation, function, exp} |
| {states, state, optimal} |
| {group, space, representation} |
|
Synthesis of Ternary Quantum Logic Circuits by Decomposition
Faisal Shah Khan, Marek Perkowski
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0511041
- categories:
- quant-ph
- comments:
- 6 pages, 5 figures
- arxiv_id:
- quant-ph/0511041
- journal_ref:
- Proceedings of the 7th International Symposium on Representations
and Methodology of Future Computing Technologies RM2005 (Reed Muller 2005)
- created:
- 2005-11-04
Full article ▸
|
|
| related documents |
| 0411058v1 |
| 0304078v1 |
| 0505122v2 |
| 0504197v1 |
| 0512058v3 |
| 0305134v1 |
| 0610105v1 |
| 0308167v1 |
| 9511007v1 |
| 9605013v1 |
| 0211085v2 |
| 0610214v3 |
| 0601183v1 |
| 9505011v1 |
| 0109016v2 |
| 0104069v2 |
| 0005116v2 |
| 0505009v4 |
| 0506062v2 |
| 9908041v1 |
| 0012067v1 |
| 0405157v2 |
| 9903101v2 |
| 0408081v5 |
| 9908074v5 |
|