Qcompiler: quantum compilation with CSD method

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 generality and simplicity, Qcompiler produces quantum circuits which reflect the symmetry of the systems under study.

References in corpus (3)

• Classical approach to the graph isomorphism problem using quantum walks
• Quantum walk-based search and centrality
• An efficient quantum circuit analyser on qubits and qudits

Cited by in corpus (7)

• Universal qudit gate synthesis for transmons
• Primitive Quantum Gates for an SU(3) Discrete Subgroup: $\Sigma (36\times 3)$
• Generating 3 qubit quantum circuits with neural networks
• Efficient quantum circuits for continuous-time quantum walks on composite graphs
• Enhancing quantum models of stochastic processes with error mitigation
• Quantum Encoding of Structured Data with Matrix Product States
• Exploring the Impact of Affine Loop Transformations in Qubit Allocation