Table of Contents
Fetching ...

Assembly to Quantum Compiler

Andrew Haverly, Shahram Rahimi, Mark A. Novotny

TL;DR

The paper addresses translating classical ARM assembly into quantum circuits to enable quantum execution of traditional algorithms. It introduces a mapping framework that aligns ARM mnemonics with quantum gate sequences and demonstrates this approach with a Fibonacci computation, where the coherence-breaking circuit yields $F(5)=3$, and with a Grover oracle realized from assembly. Key contributions include a detailed ARM-to-quantum mapping, unrolled-loop strategies for small qubit budgets, and an open-source compiler under the MIT license. The work offers a practical bridge between classical and quantum programming, enabling easier porting of algorithms to quantum hardware and motivating further open-source development.

Abstract

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.

Assembly to Quantum Compiler

TL;DR

The paper addresses translating classical ARM assembly into quantum circuits to enable quantum execution of traditional algorithms. It introduces a mapping framework that aligns ARM mnemonics with quantum gate sequences and demonstrates this approach with a Fibonacci computation, where the coherence-breaking circuit yields , and with a Grover oracle realized from assembly. Key contributions include a detailed ARM-to-quantum mapping, unrolled-loop strategies for small qubit budgets, and an open-source compiler under the MIT license. The work offers a practical bridge between classical and quantum programming, enabling easier porting of algorithms to quantum hardware and motivating further open-source development.

Abstract

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.
Paper Structure (7 sections, 30 figures, 3 tables)

This paper contains 7 sections, 30 figures, 3 tables.

Figures (30)

  • Figure 1: ADC Quantum Equivalent Circuit: A full or ripple carry adder that also sets the Carry Flag.
  • Figure 2: ADD Quantum Equivalent Circuit: A full or ripple carry adder.
  • Figure 3: AND Quantum Equivalent Circuit: A Multiply-Controlled Toffoli gate is applied to each bit in the registers.
  • Figure 4: BIC Quantum Equivalent Circuit: Op2 is inverted then a Multiply-Controlled Toffoli gate is applied to each bit in the registers.
  • Figure 5: CMN Quantum Equivalent Circuit: Adds Rn and Op2 then determine the values for the Zero, Negative, Carry, and Overflow flags.
  • ...and 25 more figures