Abstract
In this paper, we present a general quantum computation compiler, which maps any given quantum algorithm to a quantum circuit consisting a sequential set of elementary quantum logic gates based on recursive cosine-sine decomposition. The resulting quantum circuit diagram is provided by directly linking the package output written in LaTeX to Qcircuit.tex <http://www. cquic.org/Qcircuit >. We illustrate the use of the Qcompiler package through various examples with full details of the derived quantum circuits. Besides its accuracy, generality and simplicity, Qcompiler produces quantum circuits with significantly reduced number of gates when the systems under study have a high degree of symmetry.
Original language | English |
---|---|
Pages (from-to) | 853-865 |
Number of pages | 13 |
Journal | Computer Physics Communications |
Volume | 184 |
Issue number | 3 |
DOIs | |
Publication status | Published - Mar 2013 |
Externally published | Yes |
Keywords
- matrix decomposition
- quantum compiler
- quantum computation
- quantum walk