Development of a multi-technology, template-based quantum circuits compilation toolchain

Abstract

With noisy intermediate scale quantum computers (NISQ) becoming larger in scale and more reliable, quantum circuits are growing in size and complexity. In order to face the challenge of achieving optimal circuits, design automation approaches for improving and mapping quantum circuits on different architectures have been proposed, each one characterized by a specific optimization strategy. In this article, the use of a template-based approach for quantum circuits optimization purposes is explored, and the proposal of a modular compilation toolchain, which supports three quantum technologies (nuclear magnetic resonance, trapped ions and superconducting qubits), is presented. The toolchain tackles the task of implementing logic synthesis for single-qubit and multi-qubit gates in the compilation process and it is structured with multiple steps and modular libraries. The toolchain was tested through a benchmarking procedure, and the results for a subset of complex quantum circuits as inputs are here reported, alongside a comparison with those provided by the compilers of IBM’s Qiskit and Cambridge Quantum Computing’s $$ \mathrm{\left. {t|ket} \right\rangle } $$ t | ket . The current toolchain prototype was crafted to be an easily expandable and reliable core for future developments, which could lead it to support even more quantum technologies and a fully fledged layout synthesis. Nonetheless, the obtained results are quite encouraging, and they prove that in certain conditions the Toolchain can be competitive in quantum circuits optimization, especially when dealing with single-qubit gates.

Advances in Modeling of Noisy Quantum Computers: Spin Qubits in Semiconductor Quantum Dots

“…Moreover, in an application-driven scenario where quantum computing is going to be employed for facing realworld problems, manual quantum algorithm optimisation is unfeasible. Hence, the input quantum circuit, described in OpenQASM 2.0 -standard de facto for quantum algorithms -, is handled by a technology-aware compilation utility that translates the abstract input description into one compliant with the target coupling graph and gate native set, carrying out a technology-inspired logic -proposed in a previous article [50] -and layout synthesis, trying, at the same time, to reduce the number of gates, by introducing some fine-grain technology-dependent optimisations. The re-sulting output is a quantum circuit built to work smoothly with the target device, tailored to properly optimise specific performance parameters.…”

Exploring the Advantages of Layout Procedure with Fully‐Connected Quantum Computing Technologies

“…The presented layout library was integrated into the compilation toolchain presented in ref. [6], which supports superconducting qubits (with IBMQ native gates), NMR and trapped ions and performs only the logic synthesis .…”

“…In fact, the single‐qubit gates $$R_{x,y,z}(\theta )$$ are supported by both technologies and the quantum dots exchange interaction and the NMR J‐coupling have an analogous unitary evolution, traceable back to $$R_{zz}(\theta )$$. [ 6,9,15 ]…”

“…Moreover, the layout synthesis was inserted in toolchain's Step 3 (see ref. [ 6 ] ), as shown in Figure . The layout synthesis is executed before the CX and CZ gates decomposition in technology native gates to simplify the routing phase.…”

“…Moreover, the library is integrated into the template‐based compilation toolchain presented in [ 6 ] and benchmarked against IBM's Qiskit [ 7 ] and Cambridge Quantum Computing's $$\textrm {t} \vert \textrm {ket} \rangle$$. [ 8 ]…”