Performance analysis of quantum algorithms on Param Siddhi-AI system

The realization of certain computational problems using quantum mechanics opened up interesting new possibilities which may be better and beyond the scope of classical supercomputers. Simulation of quantum circuits on classical computers is necessary to analyze the properties of superposition and entanglement. Here, we used the SDKs of optimized libraries and tools of cuQuantum for accelerating quantum computing workflows on FP64 and TF32 based accelerated system for performance analysis. In this paper, the performance of quantum algorithms (Shor’s algorithm, Quantum Fourier Transformation, and Sycamore circuit), implemented by the CIRQ simulator, is analyzed on the PARAM HPC-AI system. Execution time and relative speed up for CPU only and accelerators having multiple precision capability enabled run is discussed in detail on PARAM Siddhi-AI system. The graphs are plotted to give a real-time analysis of the quantum circuit algorithms with the increase in the number of qubits. For Shor’s algorithm, Quantum Fourier Transformation, and Sycamore circuit, the maximum speed up, between CPU only and GPU enabled run, is observed as ~143x, ~115x, and 104x for 30, 32, and 32 qubits respectively.