Quantum programming languages (QPL) fill the gap between quantum mechanics and classical programming constructions, simplifying the development of quantum applications. However, most QPL addresses the inherent quantum programming problem, neglecting quantum computer implementation constraints. We present a runtime architecture for classical-quantum execution that mitigates the limitation of interaction between classical and quantum computers originated from the cloud-based model of quantum computation provided by several vendors, which implies a quantum computer processing in batch. In the proposed runtime architecture, we introduce (i) runtime quantum code generation to enable generic quantum programming and dynamic quantum execution; and (ii) the concept of futures to handle dynamic interaction between classical and quantum computers. To support our proposal, we have implemented the Ket Quantum Programming framework that features a Python-embedded classical-quantum programming language named Ket, the C++ quantum programming library Libket, and Ket Bitwise (quantum computing) Simulator. The last one improves over the bitwise representation, making the simulation time not dependent on the number of qubits but the amount of superposition and entanglement of simulation.
Quantum programming languages (QPL) fill the gap between quantum mechanics and classical programming constructions, simplifying the development of quantum applications. However, most QPL addresses the inherent quantum programming problem, neglecting quantum computer implementation constraints. We present a runtime architecture for classical-quantum execution that mitigates the limitation of interaction between classical and quantum computers originated from the cloud-based model of quantum computation provided by several vendors, which implies a quantum computer processing in batch. In the proposed runtime architecture, we introduce (i) runtime quantum code generation to enable generic quantum programming and dynamic quantum execution; and (ii) the concept of futures to handle dynamic interaction between classical and quantum computers. To support our proposal, we have implemented the Ket Quantum Programming framework that features a Python-embedded classical-quantum programming language named Ket, the C++ quantum programming library Libket, and Ket Bitwise (quantum computing) Simulator. The last one improves over the bitwise representation, making the simulation time not dependent on the number of qubits but the amount of superposition and entanglement of simulation.
We propose a runtime architecture that can be used in the development of a quantum programming language and its programming environment. The proposed runtime architecture enables dynamic interaction between classical and quantum data following the restriction that a quantum computer is available in the cloud as a batch computer, with no interaction with the classical computer during its execution. It is done by leaving the quantum code generation for the runtime and introducing the concept of futures for quantum measurements. When implemented in a quantum programming language, those strategies aim to facilitate the development of quantum applications, especially for beginning programmers and students. Being suitable for the current Noisy Intermediate-Scale Quantum (NISQ) Computers, the runtime architecture is also appropriate for simulation and future Fault-Tolerance Quantum Computers.
The development of quantum computing necessitates specialized software tools. Ket is an open-source quantum programming platform that enables gate-based quantum development in Python, supported by a Rust-based runtime library and simulator. This paper presents a programming guide for the Ket platform. It covers the core concepts required to develop quantum applications, including quantum process management, gate operations, measurement strategies, and Hamiltonian construction. Designed for readers with prior knowledge of quantum computing and Python, this guide bridges the gap between theoretical algorithms and practical software implementation. To consolidate these concepts, the paper concludes with a practical tutorial applying QAOA, VQE, and FALQON to the Max-Cut problem, ultimately equipping researchers and developers to fully utilize the Ket platform.
A general quantum simulation language on a classical computer provides the opportunity to compare an experiential result from the development of quantum computers with mathematical theory. The intention of this research is to develop a program language that is able to make simulations of all quantum algorithms in same framework. This study examines the simulation of quantum algorithms on a classical computer with a symbolic programming language. We use the language Mathematica to make simulations of well-known quantum algorithms. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. This gives us an uncomplicated and clear language for the implementations of algorithms. The computational language includes essential formulations such as quantum state, superposition and quantum operator. This symbolic programming language provides a universal framework for examining the existing as well as future quantum algorithms. This study contributes with an implementation of a quantum algorithm in a program code where the substance is applicable in other simulations of quantum algorithms.
With the potential of quantum algorithms to solve intractable classical problems, quantum computing is rapidly evolving, and more algorithms are being developed and optimized. Expressing these quantum algorithms using a high-level language and making them executable on a quantum processor while abstracting away hardware details is a challenging task. First, a quantum programming language should provide an intuitive programming interface to describe those algorithms. Then a compiler has to transform the program into a quantum circuit, optimize it, and map it to the target quantum processor respecting the hardware constraints such as the supported quantum operations, the qubit connectivity, and the control electronics limitations. In this article, we propose a quantum programming framework named OpenQL, which includes a high-level quantum programming language and its associated quantum compiler. We present the programming interface of OpenQL, we describe the different layers of the compiler and how we can provide portability over different qubit technologies. Our experiments show that OpenQL allows the execution of the same high-level algorithm on two different qubit technologies, namely superconducting qubits and Si-Spin qubits. Besides the executable code, OpenQL also produces an intermediate quantum assembly code, which is technology independent and can be simulated using the QX simulator.
Quantum computing leverages the principles of quantum mechanics to perform computations far beyond the capabilities of classical systems, particularly in fields such as cryptography and optimization. However, current quantum programming languages often require low-level implementation, posing significant barriers for many developers due to their steep learning curve and limited abstraction. In response, we introduce Qutes, a high-level quantum programming language designed to simplify quantum algorithm development while maintaining the flexibility required for advanced applications. By abstracting complex quantum operations and allowing intuitive expressions through high-level constructs, Qutes enables users to write efficient quantum programs without extensive knowledge of quantum mechanics or circuit design. Built upon Qiskit, Qutes translates its syntax directly into executable quantum code, facilitating seamless integration with quantum hardware. This paper provides an overview of the language's architecture, core functionalities, and its ability to unify classical and quantum operations within a single framework. Additionally, we demonstrate Qutes' application in key quantum algorithms, showcasing its potential to make quantum programming more accessible and practical for a wider range of developers and researchers.
Quantum computing has become an increasingly relevant topic in computer science due to the development of functional quantum computers in recent years. Quantum processing units (QPUs) use quantum particles in the form of qubits as information carriers. By using properties of quantum particles, quantum algorithms have been developed that can solve problems in polynomial time, for which only exponentially scaling classical algorithms are known. QPUs will not run on their own in the foreseeable future, due to high error rates and low stability of qubits. Instead, quantum devices will be one component in a quantum-classical (hybrid) computing system (distributed system). Quantum computers embedded in distributed hybrid quantum-classical systems get instructions from a main CPU, execute them and report their results. To fully utilize quantum calculations, a QPU should be able to communicate with a CPU in real-time. This means the qubits information content should stay stable during communication time. In this thesis, we will look at quantum computing systems with real-time feedback between a QPU and a CPU. As quantum computers are going to be used in real-time hybrid systems, we need optimization routines for code running on these systems. Existing works on the optimization of quantum code focus on the optimization of quantum circuits only, and neglect potential classical calculations that are necessary on a hybrid distributed system. We want to examine which kind of optimization routines are possible and sensible for hybrid quantum-classical computations. We will evaluate some of todays quantum programming languages (QPLs), especially with respect to their ability to support and optimize real-time hybrid calculations. We will find that most languages support real-time calculations to some extent, but are more adapted to the programming approach of static circuit creation. Additionally, none of the QPLs offer optimization routines targeted at quantum-classical calculations. Therefore, we will examine options for real-time quantum-classical optimization. For this, we use the low-level QPL Quil. We will introduce optimization operations and apply them to real-time quantum-classical algorithms. We will present metrics to evaluate the performance of hybrid calculations. The results of applying our optimization operations to Quil code will be evaluated against our performance metrics. We will find that we are in principle able to optimize hybrid quantum-classical programs. We encourage more research in this field. QPLs will become more abstract in the future and need more compilation steps until they can be executed on hardware. This will make the optimization of quantum-classical hybrid code more relevant.