Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of information and organizational sciences

An approach to source code conversion of classical programming languages into source code of quantum programming languages

Alan Bojić

Published Dec 16, 2014• 2 citations
OpenAlex

Abstract

Basic principles of quantum computer ensure more computing power than the principles of classical computers. Quantum computers use quantum mechanical effects such as entanglement and superposition to speed up computing processes compared to classical computers. If the quantum computers one day becomes a commercially available product, then it is very important to have a converter that will convert the source code of programming languages for classical computers into source code of programming languages for quantum computers because it will speed up the translation process and ensure that developers of classical computers can develop programs for quantum computer using programming languages for classical computers. In this paper, the basic approach to automatic conversion of the source code for classical computer into a source code of quantum computer is introduced.

Related papers

Automatsko prevođenje izvornog koda za programske jezike klasičnog računala u izvorni kod za programske jezike kvantnog računala

Alan Bojić

Quantum computers use quantum mechanical effects such as quantum entanglement and quantum superposition. If one day the quantum computer becomes a commercially available product, then it is very important to have a transcompiler that will convert the source code of programming languages for classical computers into the source code of programming languages for quantum computers because it will speed up the translation process of existing applications and ensure that developers can write programs for quantum computers using programming languages for classical computers. This research proposes, implements and tests an approach for the conversion of the source code of programming languages for classical computers into the source code of programming languages for quantum computers. The accuracy of the generated source code for quantum computers and the quantum cost of quantum circuits which are generated using QR, CS algorithms and algorithm for direct translation of reversible circuit into quantum circuit will be measured on a data set which represents programmes on classical computers.

•Jun 7, 2018•0 citations

Programming Quantum Computers

Alice Flarend, Robert Hilborn

Abstract Programming a quantum computer can be thought of as having two steps. The first has been the subject of the past several chapters: leveraging number theory, superposition, entanglement, gates, and measurements to develop an algorithm to solve a problem. Classically, computer programmers do not work at the level of gates and there is, of course, no such thing in their world as entanglement or superposition. They work at the second level, writing code to implement the algorithm. There are several universal languages available for classical programming. This chapter provides resources for programming quantum computers using these standard languages.

•Jul 9, 2026•0 citations

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 Physics•Feb 1, 2009•1 citation

On Refactoring Quantum Programs

Jianjun Zhao

Refactoring is a crucial technique for improving the efficiency and maintainability of software by restructuring its internal design while preserving its external behavior. While classical programs have benefited from various refactoring methods, the field of quantum programming lacks dedicated refactoring techniques. The distinct properties of quantum computing, such as quantum superposition, entanglement, and the no-cloning principle, necessitate specialized refactoring techniques. This paper bridges this gap by presenting a comprehensive set of refactorings specifically designed for quantum programs. Each refactoring is carefully designed and explained to ensure the effective restructuring of quantum programs. Additionally, we highlight the importance of tool support in automating the refactoring process for quantum programs. Although our study focuses on the quantum programming language Q\#, our approach is applicable to other quantum programming languages, offering a general solution for enhancing the maintainability and efficiency of quantum software.

arXiv:2306.10517•Jun 18, 2023•1 citation

Simulation of Quantum Algorithms with a Symbolic Programming Language

Peter Nyman

This study examines the simulation of quantum algorithms on a classical computer. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. The computational language will include formulations such as quantum state, superposition and quantum operator.

arXiv:0705.3333•May 23, 2007•9 citations

A Quantum Computation Language-based Quantum Compiler

S. Jaya Amruth, T.M. Nigelesh, V. Sai Shruthik +2 more

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.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Jun 24, 2024•0 citations
Basic principles of quantum computer ensure more computing power than the principles of classical computers. Quantum computers use quantum mechanical effects such as entanglement and superposition to speed up computing processes compared to classical computers. If the quantum computers one day becomes a commercially available product, then it is very important to have a converter that will convert the source code of programming languages for classical computers into source code of programming languages for quantum computers because it will speed up the translation process and ensure that developers of classical computers can develop programs for quantum computer using programming languages for classical computers. In this paper, the basic approach to automatic conversion of the source code for classical computer into a source code of quantum computer is introduced.
Quantum computers use quantum mechanical effects such as quantum entanglement and quantum superposition. If one day the quantum computer becomes a commercially available product, then it is very important to have a transcompiler that will convert the source code of programming languages for classical computers into the source code of programming languages for quantum computers because it will speed up the translation process of existing applications and ensure that developers can write programs for quantum computers using programming languages for classical computers. This research proposes, implements and tests an approach for the conversion of the source code of programming languages for classical computers into the source code of programming languages for quantum computers. The accuracy of the generated source code for quantum computers and the quantum cost of quantum circuits which are generated using QR, CS algorithms and algorithm for direct translation of reversible circuit into quantum circuit will be measured on a data set which represents programmes on classical computers.
Abstract Programming a quantum computer can be thought of as having two steps. The first has been the subject of the past several chapters: leveraging number theory, superposition, entanglement, gates, and measurements to develop an algorithm to solve a problem. Classically, computer programmers do not work at the level of gates and there is, of course, no such thing in their world as entanglement or superposition. They work at the second level, writing code to implement the algorithm. There are several universal languages available for classical programming. This chapter provides resources for programming quantum computers using these standard languages.
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.
Refactoring is a crucial technique for improving the efficiency and maintainability of software by restructuring its internal design while preserving its external behavior. While classical programs have benefited from various refactoring methods, the field of quantum programming lacks dedicated refactoring techniques. The distinct properties of quantum computing, such as quantum superposition, entanglement, and the no-cloning principle, necessitate specialized refactoring techniques. This paper bridges this gap by presenting a comprehensive set of refactorings specifically designed for quantum programs. Each refactoring is carefully designed and explained to ensure the effective restructuring of quantum programs. Additionally, we highlight the importance of tool support in automating the refactoring process for quantum programs. Although our study focuses on the quantum programming language Q\#, our approach is applicable to other quantum programming languages, offering a general solution for enhancing the maintainability and efficiency of quantum software.
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.