Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs(…)
summary
Proposes a quantum register machine architecture with a 22-instruction set and a quantum program counter, compiles RQ++ into low-level Qins, and uses a QF table (graph of Q-if instantiations with wait counters) loaded into QRAM to synchronize divergent quantum branches in superposition. Claims automatic parallelisation—e.g., the quantum multiplexor gets circuit depth proportional to max(Tx) rather than sum(Tx), an exponential improvement over naive serial compilation—and demonstrates a reversible execution unitary that implements and decodes instructions on QRAM.
AI-written summary · about
chapters (17)
- 0:00Quantum register machine intro
- 0:22Quantum programming recursion
- 1:08High-level goals
- 2:32Quantum recursion challenges
- 3:58Quantum multiplexer example
- 5:24Register machine architecture
- 7:13Storage and program counter
- 8:19Synchronization in control flows
- 9:23Recursive calls handling
- 9:46Instruction set Qins design
- 10:28Compiling RQ++ programs
- 11:31Automatic uncomputation
- 12:58Partial evaluation sync
- 14:44Execution cycle QF table
- 15:47Efficiency parallelization
- 16:30Take-home message
- 17:11Q&A
related talks
20mQuantum Register Machine: Efficient Implementation of Quantum Recursive Programs
39mBuilding a Compiler for Quantum Computers
17mQVM: Quantum Gate Virtualization Machine
19mQuantum Virtual Machines
01h 10mThe Rise & Collapse of a Quantum State
15mCompositional Quantum Control Flow with Efficient Compilation in Qunity
16mCompiling and Running High-level Quantum Programs
15mAssertion-Based Optimization of Quantum Programs