Towards Turing-Complete Quantum Computing Coming From Classical Assembler

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.