A Rudimentary Quantum Compiler(2cnd Ed.)
arXiv:quant-ph/9902062
Abstract
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.
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
References in corpus (1)
Cited by in corpus (23)
- Quantum Circuits for Isometries
- Approaching the theoretical limit in quantum gate decomposition
- An Introduction to Cartan's KAK Decomposition for QC Programmers
- Efficient decomposition of unitary matrices in quantum circuit compilers
- QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
- Designing calibration and expressivity-efficient instruction sets for quantum computing
- Heuristics for Quantum Compiling with a Continuous Gate Set
- Quantum Fast Fourier Transform Viewed as a Special Case of Recursive Application of Cosine-Sine Decomposition
- Domain-Specific Compilers for Dynamic Simulations of Quantum Materials on Quantum Computers
- Efficient solution of the non-unitary time-dependent Schrodinger equation on a quantum computer with complex absorbing potential
- Code Generator for Quantum Simulated Annealing
- Qubiter Algorithm Modification, Expressing Unstructured Unitary Matrices with Fewer CNOTs
- How to Compile Some NAND Formula Evaluators
- Use of a Quantum Computer to do Importance and Metropolis-Hastings Sampling of a Classical Bayesian Network
- Quantum Computer as a Probabilistic Inference Engine
- QuanTree and QuanLin, Two Special Purpose Quantum Compilers
- Quibbs, a Code Generator for Quantum Gibbs Sampling
- Replacing Two Controlled-U's with Two CNOTs
- Simplifying Quantum Circuits via Circuit Invariants and Dressed CNOTs
- Oracular Approximation of Quantum Multiplexors and Diagonal Unitary Matrices
- Quantum Compiling with Approximation of Multiplexors
- A Reed Muller-based approach for optimization of general binary quantum multiplexers
- Decomposition of quantum gates