Towards Turing-Complete Quantum Computing Coming From Classical Assembler

TL;DR

This paper introduces a hybrid quantum-classical language built from classical assembler, enabling quantum algorithms to be integrated into classical software, potentially guiding future quantum programming development.

Contribution

It presents a novel language framework that combines classical assembler with quantum capabilities, bridging classical and quantum programming paradigms.

Findings

Quantum algorithms become a subset of the new language.

Enables development of hybrid algorithms from classical software.

Lays groundwork for future quantum programming tools.

Abstract

Instead of producing quantum languages that are fit for current quantum computers, we build a language from standard classical assembler and augment it with quantum capabilities so that quantum algorithms become a subset of it. This paves the way for the development of hybrid algorithms directly from classical software, which is not feasible on today's hardware but might inspire future quantum programmers.