Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
summary
Proposes a new quantum register machine architecture plus an instruction set (QINS) and a compilation pipeline that compiles RQ++ recursive programs into instructions, performs a classical-input-only partial evaluation to build a QF table for synchronization, and executes a fixed unitary U_cycle on QRAM with a quantum program counter and quantum call stack. Demonstrates automatic parallelisation that yields an exponential parallel speed-up for the quantum multiplexer versus the naive sequential implementation, while noting current restrictions to unitary-only programs and reliance on a practical time bound to avoid nontermination.
AI-written summary · about
chapters (13)
- 0:00Quantum programming goals
- 1:35Quantum recursion
- 3:20Quantum control flow
- 5:00Quantum multiplexer
- 7:27Quantum recursive programs in RQC++
- 8:31Quantum Register Machine
- 10:17Synchronization in quantum recursion
- 12:23Compilation process
- 13:27Partial evaluation
- 14:54Execution on Quantum Register Machine
- 15:37Efficiency analysis
- 15:57Future directions
- 16:38Q&A
related talks
21mQuantum Register Machine: Efficient Implementation of Quantum Recursive Programs(…)
17mQuantum and classical registers
23mA Case for Synthesis of Recursive Quantum Unitary Programs
16mqKleene: Verification of Quantum RAM Made Easy
24mQuantum Control Machine: The Limits of Control Flow in Quantum Programming
15mToward A Quantum Programming Language for Higher Level Formal Verification
40mQ# - going beyond quantum circuits
39mBuilding a Compiler for Quantum Computers