A Rudimentary Quantum Compiler

Abstract

We present a new algorithm for reducing an arbitrary unitary matrix 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). We report on a C++ program called "Qubiter" that implements our algorithm. Qubiter source code is publicly available.

1 LaTeX file (25 pages), 9 eps files

References in corpus (1)

• How to Compile A Quantum Bayesian Net

Cited by in corpus (21)

• Synthesis of Quantum Logic Circuits
• Open source software in quantum computing
• An Arbitrary Two-qubit Computation In 23 Elementary Gates
• Synthesis of multi-qudit Hybrid and d-valued Quantum Logic Circuits by Decomposition
• Approaching the theoretical limit in quantum gate decomposition
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• Designing calibration and expressivity-efficient instruction sets for quantum computing
• Variational quantum state discriminator for supervised machine learning
• An Ancilla Based Quantum Simulation Framework for Non-Unitary Matrices
• How to Compile A Quantum Bayesian Net
• Exploring ab initio machine synthesis of quantum circuits
• Smaller Circuits for Arbitrary n-qubit Diagonal Computations
• Code Generator for Quantum Simulated Annealing
• Programmable Quantum Networks with Pure States
• Phase context decomposition of diagonal unitaries for higher-dimensional systems
• Java Application that Outputs Quantum Circuit for Some NAND Formula Evaluators
• A new algorithm for producing quantum circuits using KAK decompositions
• Quibbs, a Code Generator for Quantum Gibbs Sampling
• Note on the Khaneja Glaser Decomposition
• Clifford algebras, noncommutative tori and universal quantum computers
• An Optimization for Qubiter