1999/02/18 by Robert R. Tucci, Tucci, Robert R. · 3 citations
Computer Science · Physics and Astronomy · #Advanced Thermodynamics and Statistical Mechanics #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/9902062
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
arxiv created 1999/02/18 · openalex publication_date 1999/02/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.