This paper describes a quantum programming environment called $Q|SI\rangle $ . It is a platform created in the .NET language to support quantum programming as a quantum extension of the $\mathbf{while}$-language. This platform includes a compiler for the quantum $\mathbf{while}$-language and a chain of tools for the simulation of quantum computations, optimization of quantum circuits, and analysis and verification of quantum programs. Throughout the paper, $Q|SI\rangle $ is used to simulate quantum behaviors on classical platforms and demonstrate the combination of components. The scalable framework allows users to program customized functions on the platform. The compiler works as the core of $Q|SI\rangle $ , bridging the gap between quantum hardware and quantum software. The built-in decomposition algorithms enable universal quantum computation on current quantum hardware.
This paper describes a quantum programming environment called Q∣SI⟩ . It is a platform created in the .NET language to support quantum programming as a quantum extension of the while-language. This platform includes a compiler for the quantum while-language and a chain of tools for the simulation of quantum computations, optimization of quantum circuits, and analysis and verification of quantum programs. Throughout the paper, Q∣SI⟩ is used to simulate quantum behaviors on classical platforms and demonstrate the combination of components. The scalable framework allows users to program customized functions on the platform. The compiler works as the core of Q∣SI⟩ , bridging the gap between quantum hardware and quantum software. The built-in decomposition algorithms enable universal quantum computation on current quantum hardware.
Quantum computing has developed at an incredible pace from abstraction to reality, making the construction of quantum programming languages, tools, and software frameworks imperative. Quantum programming languages such as Qiskit and Cirq are specifically meant for quantum hardware platforms, providing high-level abstractions and low-level gate operations for precise algorithmic control. Some of the hardest parts of making quantum software are optimizing quantum algorithms for noisy intermediate-scale quantum devices, combining quantum software with hardware platforms that change quickly, and using quantum error correction methods. Hybrid quantum-classical programming is becoming an area of increasing interest, mixing quantum and classical resources in a single application. The quantum software tool ecosystem is currently made up of simulators, development kits, and application frameworks. Some of the emerging trends in quantum software development are sophisticated optimization methods, cloud platforms providing quantum as a service, and sector-specific applications in cryptography, logistics, and pharmaceuticals.
The Intel(R) Quantum Software Development Kit (SDK) offers a comprehensive platform for developers to create quantum applications using an LLVM-based compiler with user-friendly C++ language extensions. This full-stack solution facilitates the expression and optimization of quantum circuits and includes a quantum runtime library for seamless hybrid execution between classical and quantum kernels. The runtime enables dynamic parameter determination for quantum circuits, allowing both quantum and classical components of variational algorithms to be defined within a single program, compiled once, and significantly reducing execution latency. The SDK features a suite of quantum simulators, including simulations of Intel's quantum hardware components such as qubit control processors, control electronics, and quantum dot qubits. With a unified interface, the Intel Quantum SDK allows users to target ideal qubit simulators, realistic Intel quantum hardware simulators, and future Intel quantum hardware, enabling efficient optimization, compilation, and execution of scalable hybrid quantum-classical variational algorithms.
Quantum computing is a promising approach of computation that is based on equations from Quantum Mechanics. A simulator for quantum algorithms must be capable of performing heavy mathematical matrix transforms. The design of the simulator itself takes one of three forms: Quantum Turing Machine, Network Model or circuit model of connected gates or, Quantum Programming Language, yet, some simulators are hybrid. We studied previous simulators and then we adopt features from three simulators of different implementation languages, different paradigms, and for different platforms. They are Quantum Computing Language (QCL), QUASI, and Quantum Optics Toolbox for Matlab 5. Our simulator for quantum algorithms takes the form of a package or a programming library for Quantum computing, with a case study showing the ability of using it in the circuit model. The .NET is a promising platform for computing. VB.NET is an easy, high productive programming language with the full power and functionality provided by the .NET framework. It is highly readable, writeable, and flexible language, compared to another language such as C#.NET in many aspects. We adopted VB.NET although its shortage in built-in mathematical complex and matrix operations, compared to Matlab. For implementation, we first built a mathematical core of matrix operations. Then, we built a quantum core which contains: basic qubits and register operations, basic 1D, 2D, and 3D quantum gates, and multi-view visualization of the quantum state, then a window for demos to show you how to use and get the most of the package.
This thesis presents the architecture of quantum programming environment, called QSI, along with its related modules and several quantum experiments. The environment is based on one specific quantum language, namely quantum while-language. Some partial experimental results are also presented within QSI. \nThe first part relates to the architecture, the designing and the implementation of quantum programming environment which provides a new, powerful and flexible environment for developing and implementing quantum programs. First, we study the possible structure of the programming environment which supports a measurement-based case statement and a measurement-based while-loop. These two program constructs are extremely convenient for describing large-scale quantum algorithms, such as quantum random walk-based algorithms. We also define a new assembly language called f-QASM (Quantum Assembly Language with feedback) as an interactive command set. The assembly language is compatible with other low-level instruction sets and can be used to directly drive quantum hardware. Moreover, the simulation of syntax of quantum program and the behaviours within the architecture on the classical computer are discussed. Finally, we consider the work-flow which contains the decomposition of unitary matrix to achieve the goal that executing on Noisy Intermediate-Scale Quantum Computer. \nThe second part concerns the modules based on quantum programming environment: termination analysis module, detective separable unitary module and quantum control module. Along with the architecture, we bring an essential module - termination analysis module for the loop structure. It can analyze sub-bodies of quantum program and suggest the critical termination information. In addition, we improve the Jordan decomposition step in the original algorithm which consumes extended period for analyzing. This improvement also makes the module more robust on executing. A fast permutation algorithm module clarifies the re-ordering algorithm in case of qubits system. It regenerates the program (unitary operator) which is not in pre-ordered sequence. In the detective separable unitary module, we prove sufficient conditions for separable unitary and its approximate scenario. The result shows there does not exist a universal algorithm for potential parallel executing quantum programs without communications (classical or quantum communications). However, in approximate, there exists a scheme for parallel computing without the help of communication. In this part, two examples for parallel computing are given. Last, in quantum control module, an algorithm is suggested towards automatically generating quantum circuits for quantum case-statement. We believe these analysis modules can help the compiler to optimize the implementation of quantum algorithms. \nThe third part is devoted to quantum experiment. First, we focus several experiments which can be operated directly by QSI : Qloop, BB84 protocol and Grover search algorithm. After that, with the help of IBM’s QISKit, two impressive experiments: distinguishing unitary gates and Bell states are given on real quantum computer. Finally, we combine QSI with Microsoft’s LIQUi|> to implement quantum case-statement. These experiments significantly show the quantum power and the scalable framework of the quantum programming environment in practice.
As quantum computing matures beyond isolated algorithm demonstrations, the need for robust, scalable, and formally structured programming environments has become increasingly evident.While early quantum programming frameworks primarily focused on circuit construction and gate-level abstraction, modern quantum software development requires higher-level language constructs, strong correctness guarantees, and seamless integration with classical computing infrastructure.Addressing these needs, Q# was introduced by Microsoft as part of its broader quantum software ecosystem [113].Unlike Python-based libraries such as Qiskit and Cirq, Q# is a domain-specific programming language designed explicitly for quantum computation.It is not merely a library layered on top of an existing classical language; rather, it is a purpose-built language that embeds quantum programming principles directly into its syntax, type system, and execution model.Q# emphasizes correctness, composability, and hybrid quantum-classical workflows, making it particularly suitable for largescale algorithm development, formal reasoning, and long-term quantum software engineering.This chapter presents an in-depth exploration of Q# and Microsoft's Quantum Toolkit.It begins by examining the conceptual foundations and design philosophy of Q#, followed by a detailed discussion of writing quantum programs in Q#.The chapter then explores the rich quantum libraries and simulation infrastructure provided by Microsoft and concludes with an extensive analysis of hybrid quantum-classical programming, which lies at the heart of practical quantum applications.
Quantum computing is a revolution in computational theory that uses the principles of quantum mechanics to perform computations that are beyond the capacity of classical computers. It works with the special features of the quantum bits or qubits to encode and transform the information in manners conventional bits cannot imagine. A quantum compiler is a software tool designed to translate high-level quantum language code into executable quantum instructions. This paper aims to develop a quantum compiler for translating Quantum Computation Language source codes into quantum bytecodes which can later be executed on a Quantum Virtual Machine. This compiler will have a combinational structure that includes a frontend for interpreting the QCL code, an intermediate representation for optimizing quantum algorithms, and a backend for generating efficient quantum bytecode. Optimization techniques will be applied to improve the functioning of the quantum circuits. The compiler will also include an error handling module to handle the errors. The successful deployment of a quantum compiler for QCL has many implications and unlocks opportunities for advancements in quantum technologies.