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 2): Demonstration and Characterization

Mollie E. Schwartz, Morten Kjærgaard, 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 1): Introduction and construction

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

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

Programming a quantum computer with quantum instructions

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

The equivalence between the instructions used to define programs and the input data on which the instructions operate is a basic principle of classical computer architectures and programming. Replacing classical data with quantum states enables fundamentally new computational capabilities with scaling advantages for many applications, and numerous models have been proposed for realizing quantum computation. However, within each of these models, the quantum data are transformed by a set of gates that are compiled using solely classical information. Conventional quantum computing models thus break the instruction-data symmetry: classical instructions and quantum data are not directly interchangeable. In this work, we use a density matrix exponentiation protocol to execute quantum instructions on quantum data. In this approach, a fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. Our demonstration relies on a 99.7% fidelity controlled-phase gate implemented using two tunable superconducting transmon qubits, which enables an algorithmic fidelity surpassing 90% at circuit depths exceeding 70. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation, thereby enabling exponential speedup for a broad range of algorithms, including quantum principal component analysis, the measurement of entanglement spectra, and universal quantum emulation.

arXiv:2001.08838•Jan 23, 2020•49 citations

Experimental aspects of quantum computing

Dipankar Bhattacharyya, Jyotirmoy Guha

Institute of Physics eBooks•Jan 1, 2022•1 citation

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

Understanding Quantum Computing: From Qubits to Quantum Algorithms

Vikash Kumar, Ankush Joshi, Gesu Thakur +2 more

Information systems engineering and management•Jan 1, 2025•1 citation

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
The equivalence between the instructions used to define programs and the input data on which the instructions operate is a basic principle of classical computer architectures and programming. Replacing classical data with quantum states enables fundamentally new computational capabilities with scaling advantages for many applications, and numerous models have been proposed for realizing quantum computation. However, within each of these models, the quantum data are transformed by a set of gates that are compiled using solely classical information. Conventional quantum computing models thus break the instruction-data symmetry: classical instructions and quantum data are not directly interchangeable. In this work, we use a density matrix exponentiation protocol to execute quantum instructions on quantum data. In this approach, a fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. Our demonstration relies on a 99.7% fidelity controlled-phase gate implemented using two tunable superconducting transmon qubits, which enables an algorithmic fidelity surpassing 90% at circuit depths exceeding 70. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation, thereby enabling exponential speedup for a broad range of algorithms, including quantum principal component analysis, the measurement of entanglement spectra, and universal quantum emulation.
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.