Our central question
Can a parameterized quantum circuit learn context-dependent next-token distributions with better parameter efficiency or computational scaling than a comparably sized classical model?
How the lab’s work fits together: our Rust state-vector simulator runs the circuits, aaronnet runs the classical baselines, and the transformer work is the classical comparator we measure against.
Planned approach.
- Small synthetic next-token tasks with controlled context dependence and a small vocabulary.
- Compare circuits against classical models with matched parameter counts: an MLP, a small transformer, and a matrix product state (MPS) Born machine.
- Measure parameter efficiency on the simulator as held-out cross-entropy against parameter count.
- Treat computational scaling separately. Argue it in gate count, circuit depth, and measurement shots, never in simulator wall time, since state-vector simulation costs 2ⁿ by construction.
- Count shots in any cost comparison, because hardware estimates probabilities by sampling while the simulator reads them exactly.
Related work.
- Anschuetz, Hu, Huang, and Gao 2023, “Interpretable Quantum Advantage in Neural Sequence Learning” (PRX Quantum).
- Anschuetz and Gao 2024, “Arbitrary Polynomial Separations in Trainable Quantum Machine Learning” (arXiv:2402.08606).
- McClean et al. 2018, “Barren plateaus in quantum neural network training landscapes.”
Their sequence models are continuous-variable, built from Gaussian operations, while we study qubit circuits; we expect trainability at scale to be the main obstacle.