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

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.

References in corpus (5)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• An introduction to quantum machine learning
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Quantum Divide and Compute: Exploring The Effect of Different Noise Sources

Cited by in corpus (8)

• Review of Distributed Quantum Computing. From single QPU to High Performance Quantum Computing
• Cutting multi-control quantum gates with ZX calculus
• Networked Quantum Services
• SCIM MILQ: An HPC Quantum Scheduler
• FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation
• A Multilevel Framework for Partitioning Quantum Circuits
• Distributing Quantum Computations, Shot-wise
• DPRQ: A Dynamic Programming-based Qubit Routing Algorithm for Collective Communication in Distributed Quantum Computing