Qcompiler: quantum compilation with the CSD method
From MaRDI portal
Publication:483871
DOI10.1016/J.CPC.2012.10.019zbMATH Open1302.81084arXiv1208.0194OpenAlexW2004347813MaRDI QIDQ483871FDOQ483871
Authors: Yong-Cai Geng, Sumit K. Garg 
Publication date: 17 December 2014
Published in: Computer Physics Communications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1208.0194
Recommendations
- \textit{OptQC}: an optimized parallel quantum compiler
- The HLRB cluster as quantum CISC compiler. Matrix methods and applications for advanced quantum control by gradient-flow algorithms on parallel clusters
- \textit{OptQC} v1.3: an (updated) optimized parallel quantum compiler
- Deterministic algorithms for compiling quantum circuits with recurrent patterns
- Compiling quantum programs
Cites Work
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A classical approach to the graph isomorphism problem using quantum walks
- History and generality of the CS decomposition
- Computing the complete CS decomposition
- Synthesis of multi-qudit hybrid and \(d\)-valued quantum logic circuits by decomposition
- Title not available (Why is that?)
- An efficient quantum circuit analyser on qubits and qudits
- Multiple-valued reversible logic circuits
Cited In (14)
- A new algorithm for producing quantum circuits using KAK decompositions
- Boolean satisfiability in quantum compilation
- An efficient quantum circuit analyser on qubits and qudits
- A framework for quantum-classical cryptographic translation
- Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
- Basic circuit compilation techniques for an ion-trap quantum machine
- The HLRB cluster as quantum CISC compiler. Matrix methods and applications for advanced quantum control by gradient-flow algorithms on parallel clusters
- Deterministic algorithms for compiling quantum circuits with recurrent patterns
- Efficient discrete approximations of quantum gates
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Synthesis of quantum circuits for \(d\)-level systems by using cosine-sine decomposition
- Lattice surgery translation for quantum computation
- \textit{OptQC} v1.3: an (updated) optimized parallel quantum compiler
- \textit{OptQC}: an optimized parallel quantum compiler
Uses Software
This page was built for publication: \(Qcompiler\): quantum compilation with the CSD method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q483871)
