Speed-oriented quantum circuit backend

TL;DR

This paper introduces a new quantum circuit backend optimized for speed, capable of generating large circuits faster than existing tools, crucial for applications needing minimal classical preprocessing.

Contribution

The paper presents a novel software package that significantly accelerates quantum circuit generation, especially for large systems, with high-level manipulation primitives.

Findings

Can generate circuits for up to 2000 qubits faster than Qiskit and Q#

Demonstrates advantages in classical preprocessing time for quantum algorithms

Provides high-level primitives for easier integration with quantum languages

Abstract

We present a new software package for efficient quantum circuit generation, designed to achieve optimal runtime performance. Despite being in an early stage of development, our implementation demonstrates significant advantages over existing tools. Using the quantum Fourier transform (QFT) as a benchmark, we show that our backend can generate circuits for systems with up to 2000 qubits faster than widely used frameworks such as Qiskit and Q#. This improvement is particularly relevant for applications where classical preprocessing time, including circuit generation, must be minimized to not diminish any potential quantum advantage - for example, in combinatorial optimization tasks. Additionally, our software provides high-level primitives for bit- and integer-level manipulations, offering a simplified interface for integration with high-level quantum programming languages.