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

Bulletin of the American Physical Society

Programming a Quantum Computer with Quantum Instructions (Part 1): Introduction and construction

Morten Kjærgaard, Mollie E. Schwartz, Amy Greene, Gabriel Samach, Andreas Bengtsson, Michael F. O’Keeffe, Chris McNally, Jochen Braumüller, David K. Kim, Philip Krantz, Milad Marvian, Alexander J. Melville, Bethany M. Niedzielski, Youngkyu Sung, Roni Winik, Jonilyn Yoder, Danna Rosenberg, Kevin Obenland, Seth Lloyd, Terry P. Orlando, Iman Marvian, Simon Gustavsson, William D. Oliver

Published Mar 17, 2021• 0 citations
OpenAlex

Related papers

Programming a Quantum Computer with Quantum Instructions (Part 2): Demonstration and Characterization

Mollie E. Schwartz, Morten Kjærgaard, Amy Greene +20 more

Bulletin of the American Physical Society•Mar 17, 2021•0 citations

The Theory of Quantum Computation: An Introduction

Tino Gramß

Wiley eBooks•May 14, 1998•2 citations

Assembly to Quantum Compiler

Andrew Haverly, Shahram Rahimi, Mark A. Novotny

This research presents a novel approach in quantum computing by transforming ARM assembly instructions for use in quantum algorithms. The core achievement is the development of a method to directly map the ARM assembly language, a staple in classical computing, to quantum computing paradigms. The practical application of this methodology is demonstrated through the computation of the Fibonacci sequence. This example serves to validate the approach and underscores its potential in simplifying quantum algorithms. Grover's Algorithm was realized through the use of quantum-specific instructions. These transformations were developed as part of an open-source assembly-to-quantum compiler (github.com/arhaverly/AssemblyToQuantumCompiler). This effort introduces a novel approach to utilizing classical instruction sets in quantum computing and offers insight into potential future developments in the field. The AssemblyToQuantumCompiler streamlines quantum programming and enables computer scientists to transition more easily from classical to quantum computer programming.

quant-pharXiv:2601.07706•Jan 13, 2026•0 citations

Quantum Programming Language NDQJava2 Processing System: Assembler and Interpreter

Zhu Zhengwen

NDQJava2 is a hybrid, structured and imperative quantum programming language, which is an extension of NDQJava with some additional quantum components, such as quantum conditional statement, quantum loop statement, quantum subprogram, quantum module and quantum exception handling mechanism. To execute NDQJava2 programs on a classical computer, this paper gives the design of the basic instruction set and assembly instruction set of a conceivable quantum computer, and the implementation of the corresponding assembler and interpreter. Combined with the other parts of the processing system, the Deutsch algorithm is verified. Experiments show that the assembler and interpreter achieve the desired purpose.

Jisuanji kexue yu tansuo•Jan 1, 2013•0 citations

Mathematics of Quantum Computing: An Introduction

Wolfgang Scherer

Springer eBooks•Jan 1, 2019•56 citations

Boolean satisfiability in quantum compilation

Mathias Soeken, Giulia Meuli, Bruno de O. Schmitt +3 more

Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program and the low-level instructions, quantum compilation is split into a multi-stage flow consisting of several layers of abstraction. Several different individual tasks have been proposed for the layers in the flow, many of them are NP-hard. In this article, we will describe the flow and we will propose algorithms based on Boolean satisfiability, which is a good match to tackle such computationally complex problems. This article is part of the theme issue 'Harmonizing energy-autonomous computing and intelligence'.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Dec 23, 2019•16 citations
This research presents a novel approach in quantum computing by transforming ARM assembly instructions for use in quantum algorithms. The core achievement is the development of a method to directly map the ARM assembly language, a staple in classical computing, to quantum computing paradigms. The practical application of this methodology is demonstrated through the computation of the Fibonacci sequence. This example serves to validate the approach and underscores its potential in simplifying quantum algorithms. Grover's Algorithm was realized through the use of quantum-specific instructions. These transformations were developed as part of an open-source assembly-to-quantum compiler (github.com/arhaverly/AssemblyToQuantumCompiler). This effort introduces a novel approach to utilizing classical instruction sets in quantum computing and offers insight into potential future developments in the field. The AssemblyToQuantumCompiler streamlines quantum programming and enables computer scientists to transition more easily from classical to quantum computer programming.
NDQJava2 is a hybrid, structured and imperative quantum programming language, which is an extension of NDQJava with some additional quantum components, such as quantum conditional statement, quantum loop statement, quantum subprogram, quantum module and quantum exception handling mechanism. To execute NDQJava2 programs on a classical computer, this paper gives the design of the basic instruction set and assembly instruction set of a conceivable quantum computer, and the implementation of the corresponding assembler and interpreter. Combined with the other parts of the processing system, the Deutsch algorithm is verified. Experiments show that the assembler and interpreter achieve the desired purpose.
Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program and the low-level instructions, quantum compilation is split into a multi-stage flow consisting of several layers of abstraction. Several different individual tasks have been proposed for the layers in the flow, many of them are NP-hard. In this article, we will describe the flow and we will propose algorithms based on Boolean satisfiability, which is a good match to tackle such computationally complex problems. This article is part of the theme issue 'Harmonizing energy-autonomous computing and intelligence'.