A Rudimentary Quantum Compiler(2cnd Ed.)
| dc.creator | Tucci, Robert R. | |
| dc.date | 1999-02-18 | |
| dc.date.accessioned | 2026-07-07T06:16:13Z | |
| dc.date.available | 2026-07-07T06:16:13Z | |
| dc.description | We present a new algorithm for reducing an arbitrary unitary matrix U into a sequence of elementary operations (operations such as controlled-nots and qubit rotations). Such a sequence of operations can be used to manipulate an array of quantum bits (i.e., a quantum computer). Our algorithm applies recursively a mathematical technique called the CS Decomposition to build a binary tree of matrices whose product, in some order, equals the original matrix U. We show that the Fast Fourier Transform (FFT) algorithm is a special case of our algorithm. We report on a C++ program called "Qubiter" that implements the ideas of this paper. Qubiter(PATENT PENDING) source code is publicly available. | |
| dc.description | 1 LaTeX file(49 pages), 11 eps files. This paper comprises two of my previous papers entitled "A Rudimentary Quantum Compiler" and "An Optimization for Qubiter", plus a substantial amount of new material | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9902062 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9902062 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93989 | |
| dc.subject | Quantum Physics | |
| dc.title | A Rudimentary Quantum Compiler(2cnd Ed.) | |
| dc.type | text |