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

Cambridge University Press eBooks

Programming Languages

Noson S. Yanofsky, Mirco A. Mannucci

Published Aug 11, 2008• 0 citations
Publisher

Abstract

The computer programmer is a creator of universes for which he alone is the lawgiver … universes of virtually unlimited complexity can be created in the form of computer programs. … They compliantly obey their laws and vividly exhibit their obedient behavior. No playwright, no stage director, no emperor, however powerful, has ever exercised such absolute authority to arrange a stage or a field of battle and to command such unswervingly dutiful actors or troops. J. Weizmann, Computer Power and Human Reason: From Judgement to Calculation In this chapter we are going to describe quantum programming , i.e., the art and science of programming a quantum computer. In Section 7.1, we briefly sketch what it means to program a quantum computing device. Section 7.2 covers a simple version of quantum assembler, based on the so-called QRAM architecture. Section 7.3 describes possible steps leading to higher-level programming languages and constructs. We conclude this chapter with Section 7.4, a short discussion on quantum emulators. PROGRAMMING IN A QUANTUM WORLD As you are about to read this chapter, you have undoubtedly been exposed to computer programming in a variety of flavors, and are perhaps already an accomplished programmer of real-life applications. Programming a classical machine carries an immediate, unambiguous sense. However, we are going to leave the familiar world of binary chips, and learn how to program some as yet unspecified quantum hardware.

DOI
10.1017/cbo9780511813887.009

Related papers

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.

Oxford University Press eBooks•Jul 9, 2026•0 citations

QUANTUM PROGRAMMING

Ellie D’Hondt

The goal of this text is to advertise the need and support the development of quantum programming paradigms. By this we mean that we are essentially interested in an exploration of the expressiveness of quantum computations. We advocate that the history and evolution of classical programming paradigms is an essential learning ground and source of inspiration in establishing quantum programming paradigms. To clarify this we start with a historical explanation of the early development classical programming paradigms. Next we argue that quantum programming currently occurs at best at the level of assembly language. In particular we reason that the measurement calculus is the only suitable candidate for assembly-level quantum computations, giving an overview of its syntax, features and applications. We also provide a short overview of related work in quantum programming languages, which should further convince the reader of the uniqueness of the measurement calculus as a formal model. Since there is much activity in the area of distributed quantum computations we also explain where we are at in paradigm development for this type of computations. In particular we put forward as associated assembly language the distributed measurement calculus, again giving an overview of its syntax, features, applications and related work. We conclude with some ideas on how to move to higher-level quantum programming languages, in particular by focusing on correlations as the main driving force behind computations in arbitrary computing environments. This article is not technical, nor it is intended to be. The aim, rather, is to provide the reader with a general feel for the subject and to support our claims by example, while at the same time giving references to more specialised articles for the interested reader.

•Dec 1, 2011•0 citations

Quantum Computing. (II.Quantum Computer Languages)

I. Bolesta, Олексій Кушнір, Serhiy Velhosh +1 more

The programming languages that can be used to write the program code when using quantum computers are reviewed.The prospects of using such languages from the point of view of integrating them into software complexes that are convenient for the developer are discussed.

•Jan 1, 2018•0 citations

QCOR: A Language Extension Specification for the Heterogeneous Quantum-Classical Model of Computation

Tiffany M. Mintz, Alexander McCaskey, Eugene Dumitrescu +3 more

Quantum computing (QC) is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for QC were designed with fault-tolerant hardware in mind, envisioning stand-alone applications. However, the susceptibility of near-term quantum computers to noise limits their stand-alone utility. To better leverage limited computational strengths of noisy quantum devices, hybrid algorithms have been suggested whereby quantum computers are used in tandem with their classical counterparts in a heterogeneous fashion. This modus operandi calls out for a programming model and a high-level programming language that natively and seamlessly supports heterogeneous quantum-classical hardware architectures in a single-source-code paradigm. Motivated by the lack of such a model, we introduce a language extension specification, called QCOR , which enables single-source quantum-classical programming. Programs written using the QCOR library–based language extensions can be compiled to produce functional hybrid binary executables. After defining QCOR’s programming model, memory model, and execution model, we discuss how QCOR enables variational, iterative, and feed-forward QC. QCOR approaches quantum-classical computation in a hardware-agnostic heterogeneous fashion and strives to build on best practices of high-performance computing. The high level of abstraction in the language extension is intended to accelerate the adoption of QC by researchers familiar with classical high-performance computing.

arXiv:1909.02457•ACM Journal on Emerging Technologies in Computing Systems•Mar 18, 2020•55 citations

Quantum Computer:5. Quantum Programming Languages

蓮尾 一郎, Naohiko Hoshino

情報処理•Jan 1, 2014•0 citations

Quantum computation

Stephen Mark Barnett

In the preceding chapter we established that a suitable set of quantum gates, complemented by quantum error correction, allows us to produce a desired multiqubit unitary transformation. This transformation is one of the three steps in a quantum computation; the others, of course, are the preparation of the qubits in their initial state and the measurement of them after the transformation has been implemented. A quantum computation is designed to solve a problem or class of problems. The power of quantum computers is that they can do this, at least for some problems, very much more efficiently and quickly than any conventional computer based on classical logic operations. If we can build a quantum computer then a number of important problems which are currently intractable will become solvable. The potential for greatly enhanced computational power is, in itself, reason enough to study quantum computers, but there is another. Moore’s law is the observation that the number of transistors on a chip doubles roughly every eighteen months. A simple corollary is that computer performance also doubles on the same timescale. Associated with this exponential improvement is a dramatic reduction in the size of individual components. If the pace is to be kept up then it is inevitable that quantum effects will become increasingly important and ultimately will limit the operation of the computer. In these circumstances it is sensible to consider the possibility of harnessing quantum effects to realize quantum information processors and computers. We start with a brief introduction to the theory of computer science, the principles of which underlie the operation of what we shall refer to as classical computers. These include all existing machines and any based on the manipulation of classical bits. The development of computer science owes much to Turing, who devised a simple but powerful model of a computing device: the Turing machine. It its most elementary form, this consists of four elements. (i) A tape for data storage, which acts as a memory. This tape has a sequence of spaces, each of which has on it one of a finite set of symbols. (ii) A processor, which controls the operations of the machine.

Oxford University Press eBooks•May 28, 2009•0 citations
The computer programmer is a creator of universes for which he alone is the lawgiver … universes of virtually unlimited complexity can be created in the form of computer programs. … They compliantly obey their laws and vividly exhibit their obedient behavior. No playwright, no stage director, no emperor, however powerful, has ever exercised such absolute authority to arrange a stage or a field of battle and to command such unswervingly dutiful actors or troops. J. Weizmann, Computer Power and Human Reason: From Judgement to Calculation In this chapter we are going to describe quantum programming , i.e., the art and science of programming a quantum computer. In Section 7.1, we briefly sketch what it means to program a quantum computing device. Section 7.2 covers a simple version of quantum assembler, based on the so-called QRAM architecture. Section 7.3 describes possible steps leading to higher-level programming languages and constructs. We conclude this chapter with Section 7.4, a short discussion on quantum emulators. PROGRAMMING IN A QUANTUM WORLD As you are about to read this chapter, you have undoubtedly been exposed to computer programming in a variety of flavors, and are perhaps already an accomplished programmer of real-life applications. Programming a classical machine carries an immediate, unambiguous sense. However, we are going to leave the familiar world of binary chips, and learn how to program some as yet unspecified quantum hardware.
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.
The goal of this text is to advertise the need and support the development of quantum programming paradigms. By this we mean that we are essentially interested in an exploration of the expressiveness of quantum computations. We advocate that the history and evolution of classical programming paradigms is an essential learning ground and source of inspiration in establishing quantum programming paradigms. To clarify this we start with a historical explanation of the early development classical programming paradigms. Next we argue that quantum programming currently occurs at best at the level of assembly language. In particular we reason that the measurement calculus is the only suitable candidate for assembly-level quantum computations, giving an overview of its syntax, features and applications. We also provide a short overview of related work in quantum programming languages, which should further convince the reader of the uniqueness of the measurement calculus as a formal model. Since there is much activity in the area of distributed quantum computations we also explain where we are at in paradigm development for this type of computations. In particular we put forward as associated assembly language the distributed measurement calculus, again giving an overview of its syntax, features, applications and related work. We conclude with some ideas on how to move to higher-level quantum programming languages, in particular by focusing on correlations as the main driving force behind computations in arbitrary computing environments. This article is not technical, nor it is intended to be. The aim, rather, is to provide the reader with a general feel for the subject and to support our claims by example, while at the same time giving references to more specialised articles for the interested reader.
Quantum computing (QC) is an emerging computational paradigm that leverages the laws of quantum mechanics to perform elementary logic operations. Existing programming models for QC were designed with fault-tolerant hardware in mind, envisioning stand-alone applications. However, the susceptibility of near-term quantum computers to noise limits their stand-alone utility. To better leverage limited computational strengths of noisy quantum devices, hybrid algorithms have been suggested whereby quantum computers are used in tandem with their classical counterparts in a heterogeneous fashion. This modus operandi calls out for a programming model and a high-level programming language that natively and seamlessly supports heterogeneous quantum-classical hardware architectures in a single-source-code paradigm. Motivated by the lack of such a model, we introduce a language extension specification, called QCOR , which enables single-source quantum-classical programming. Programs written using the QCOR library–based language extensions can be compiled to produce functional hybrid binary executables. After defining QCOR’s programming model, memory model, and execution model, we discuss how QCOR enables variational, iterative, and feed-forward QC. QCOR approaches quantum-classical computation in a hardware-agnostic heterogeneous fashion and strives to build on best practices of high-performance computing. The high level of abstraction in the language extension is intended to accelerate the adoption of QC by researchers familiar with classical high-performance computing.
In the preceding chapter we established that a suitable set of quantum gates, complemented by quantum error correction, allows us to produce a desired multiqubit unitary transformation. This transformation is one of the three steps in a quantum computation; the others, of course, are the preparation of the qubits in their initial state and the measurement of them after the transformation has been implemented. A quantum computation is designed to solve a problem or class of problems. The power of quantum computers is that they can do this, at least for some problems, very much more efficiently and quickly than any conventional computer based on classical logic operations. If we can build a quantum computer then a number of important problems which are currently intractable will become solvable. The potential for greatly enhanced computational power is, in itself, reason enough to study quantum computers, but there is another. Moore’s law is the observation that the number of transistors on a chip doubles roughly every eighteen months. A simple corollary is that computer performance also doubles on the same timescale. Associated with this exponential improvement is a dramatic reduction in the size of individual components. If the pace is to be kept up then it is inevitable that quantum effects will become increasingly important and ultimately will limit the operation of the computer. In these circumstances it is sensible to consider the possibility of harnessing quantum effects to realize quantum information processors and computers. We start with a brief introduction to the theory of computer science, the principles of which underlie the operation of what we shall refer to as classical computers. These include all existing machines and any based on the manipulation of classical bits. The development of computer science owes much to Turing, who devised a simple but powerful model of a computing device: the Turing machine. It its most elementary form, this consists of four elements. (i) A tape for data storage, which acts as a memory. This tape has a sequence of spaces, each of which has on it one of a finite set of symbols. (ii) A processor, which controls the operations of the machine.