arXiv:1006.1549 · Bulletin of the Polish Academy of Sciences Technical Sciences

Extending scientific computing system with structural quantum programming capabilities

Piotr Gawron, J. Klamka, J. Miszczak, R. Winiarczyk

Published Jan 1, 2010• 5 citations

Abstract

We present a basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave, providing a library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for high-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices.

DOI: 10.2478/v10175-010-0008-4

Related papers

Extending scientific computing system with structural quantum programming capabilities

P. Gawron, J. Klamka, Jarosław Adam Miszczak +1 more

Abstract. We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming languages and we use quantum pseudo-code based on QCL quantum programming language to describe them. We also present the implementation of introduced structures in GNU Octave language for scientific computing. Procedures used in the implementation are available as a package quantum-octave providing library of functions, which facilitates the simulation of quantum computing. This package allows also to incorporate high-level programming concepts into the simulation in GNU Octave and Matlab. As such it connects features unique for higl-level quantum programming languages, with the full palette of efficient computational routines commonly available in modern scientific computing systems. To present the major features of the described package we provide the implementation of selected quantum algorithms. We also show how quantum errors can be taken into account during the simulation of quantum algorithms using quantum-octave package. This is possible thanks to the ability to operate on density matrices implemented in quantum-octave. Key words: quantum information, quantum programming, models of quantum computation. 1.

Jan 1, 200914 citations

Simulations of quantum systems evolution with quantum-octave package

Piotr Gawron, Jarosław Adam Miszczak

Article presents package of functions for GNU Octave computer algebra system. Those functions were designed to perform simple but not necessary efficient simulations of quantum systems, especially quantum computers. The most important feature of this package is the ability to perform calculations with mixed states.We describe application of quantum-octave package for simulation of Grovers algorithm, which is one of the most important quantum algorithms. We also list other possible calculations, which can be performed with this package.

Annales Universitatis Mariae Curie-Sklodowska sectio AI – InformaticaJan 4, 20152 citations

Qutes: A High-Level Quantum Programming Language for Simplified Quantum Computing

Simone Faro, Francesco Pio Marino, Gabriele Messina

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.

ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC)Jul 20, 20252 citations

A Procedural Formalism for Quantum Computing

Bernhard Ömer

Despite many common concepts with classical computer science, quantum computing is still widely considered as a special discipline within the broad field of theoretical physics. One reason for the slow adoption of QC by the computer science community is the confusing variety of formalisms (Dirac notation, matrices, gates, operators, etc.), none of which has any similarity with classical programming languages, as well as the rather “physical” terminology in most of the available literature. QCL (Quantum Computation Language) tries to fill this gap: QCL is a hight level, architecture independent programming language for quantum computers, with a syntax derived from classical procedural languages like C or Pascal. This allows for the complete implementation and simulation of quantum algorithms (including classical components) in one consistent formalism. Chapter 1 is an introduction into the basic concepts of quantum programming,

Jan 1, 200285 citations

Simulating quantum circuits with GNU Octave and Python

Makhamisa Senekane, Lerato Mohapi, Francesco Petruccione

Quantum algorithms are known to be more powerful than their classical counterparts, in the sense that they offer huge speed-ups as opposed to their classical counterparts. Physical realization of quantum algorithms results in the building of quantum circuits, which are in turn used to build a quantum computer. Unfortunately, a full-scale quantum computer is yet to be realized, hence why quantum algorithms are currently modelled on classical computers. In this work, we report the simulation of quantum circuits using GNU Octave and Python Programming languages. Additionally, performance of these languages on simulating such circuits is compared. Quantum circuits simulated are: the circuit for preparing a two-qubit entanglement (Einstein-Podolsky-Rosen (EPR) state), the one for preparing a three-qubit entanglement (Greenberger-Horne-Zeilinger (GHZ) state), swap circuit and Quantum Fourier Transform (QFT).

IEEE AFRICONSep 1, 20131 citation

A compact program code for simulations of quantum algorithms in classical computers

P. Nyman

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.

Laser PhysicsFeb 1, 20091 citation