Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler

TL;DR

Qurzon is a prototype quantum compiler that leverages divide and conquer strategies combined with optimal qubit placement and scheduling algorithms to enable efficient execution of large quantum circuits on NISQ-era devices.

Contribution

It introduces a novel quantum compiler integrating divide and compute techniques with advanced qubit placement and scheduling for distributed quantum computing.

Findings

Demonstrated effectiveness on benchmark circuits

Showed potential for quantum parallelism

Validated on real NISQ devices

Abstract

When working with algorithms on quantum devices, quantum memory becomes a crucial bottleneck due to low qubit count in NISQ-era devices. In this context, the concept of `divide and compute', wherein a quantum circuit is broken into several subcircuits and executed separately, while stitching the results of the circuits via classical post-processing, becomes a viable option, especially in NISQ-era devices. This paper introduces \textbf{Qurzon}, a proposed novel quantum compiler that incorporates the marriage of techniques of divide and compute with the state-of-the-art algorithms of optimal qubit placement for executing on real quantum devices. A scheduling algorithm is also introduced within the compiler that can explore the power of distributed quantum computing while paving the way for quantum parallelism for large algorithms. Several benchmark circuits have been executed using the compiler, thereby demonstrating the power of the divide and compute when working with real NISQ-era quantum devices.