Tower: Data Structures in Quantum Superposition
summary
Implements a language and runtime that realize reversible, history‑independent, bounded‑time data structures for quantum algorithms: Tower provides reversible memory and pointer primitives compiled to bounded quantum circuits, and Boson is an allocator that produces a uniform superposition of permutations (a history‑independent layout) and enables constant‑time dynamic allocation in quantum superposition. A Ground library of lists, sets and radix‑tree sets compiles to circuits whose qubit and gate counts match the promised polylogarithmic asymptotics, validating the approach.
AI-written summary · about
chapters (10)
- 0:00Intro
- 0:19Quantum Algorithmic Advantage
- 2:21Superposition of Data Structures
- 3:05Linked Data Structures
- 6:56Requirement 1: Reversibility
- 8:41Tower: Reversible Programming
- 11:51Requirement 2: History Independence
- 15:33Boson: History-Independent Allocation
- 16:37Three Requirements
- 17:20Ground: Data Structure Library
related talks
25mTower: Data Structures in Quantum Superposition
15mToward A Quantum Programming Language for Higher Level Formal Verification
01h 20mA Quantum Data Structure For Classical Computers
39mBuilding a Compiler for Quantum Computers
01h 01mWhat Is "Quantum" About Quantum Computing?
06mLightning Talk: Quantum Computing and Superpositional Cats
30mQuantum Computing for Programming Languages Researchers
41mQuantum Computing deep dive