Toolchain for Faster Iterations in Quantum Software Development

Abstract

Quantum computing proposes a revolutionary paradigm that can radically transform numerous scientific and industrial application domains. To realize this promise, these new capabilities need software solutions that are able to effectively harness its power. However, developers may face significant challenges when developing and executing quantum software due to the limited availability of quantum computer hardware, high computational demands of simulating quantum computers on classical systems, and complicated technology stack to enable currently available accelerators into development environments. These limitations make it difficult for the developer to create an efficient workflow for quantum software development. In this paper, we investigate the potential of using remote computational capabilities in an efficient manner to improve the workflow of quantum software developers, by lowering the barrier of moving between local execution and computationally more efficient remote hardware and offering speedup in execution with simulator surroundings. The goal is to allow the development of more complex circuits and to support an iterative software development approach. In our experiment, with the solution presented in this paper, we have obtained up to 5 times faster circuit execution runtime, and enabled qubit ranges from 21 to 29 qubits with a simple plug-and-play kernel for the Jupyter notebook.

arXiv admin note: text overlap with arXiv:2408.06756

References in corpus (16)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Demonstration of a small programmable quantum computer with atomic qubits
• Validating quantum computers using randomized model circuits
• Fast universal quantum control above the fault-tolerance threshold in silicon
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Efficient tensor network simulation of IBM's largest quantum processors
• Containerisation for High Performance Computing Systems: Survey and Prospects
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• Quantum computing 40 years later
• Qubernetes: Towards a Unified Cloud-Native Execution Platform for Hybrid Classic-Quantum Computing
• Uncomputation in the Qrisp high-level Quantum Programming Framework
• Full-Stack Quantum Software in Practice: Ecosystem, Stakeholders and Challenges