Compiling Quantum Regular Language States

Abstract

Artifact for Accepted Paper #331: "Compiling Quantum Regular Language States" (OOPSLA 2026) arXiv: 2602.02698 A quantum state-preparation compiler for Regular Language States (RLS). Users describe target states via regular expressions, bitstring lists, or DFAs, and the compiler produces hardware-aware quantum circuits via two backends: SeqRLSP (linear depth, LNN connectivity) and TreeRLSP (logarithmic depth, all-to-all connectivity). Getting started and verifying the results: Download all files into a single directory tar xzf rlscomp-artifact.tar.gz cd rlscomp-artifact docker load < docker-image.tar docker run --platform linux/amd64 -it -v $(pwd):/work rlscomp-artifact bash python run_sec56_sec57.py (sanity check, ~1 min) See README.md for full instructions and CLAIMS.md for the mapping of paper claims to experiments. Reusing the code: To reuse and build upon the code please refer to the additional resources: Document What it covers ARCHITECTURE.md High-level overview of the codebase: the four-stage compilation pipeline, a module-by-module map, the data representations and conventions every stage relies on, a table mapping each construction in the paper to the function that implements it, and an annotated end-to-end trace of one compilation. GUIDE.md Guide to the main functionality: installation, the four ways to describe a state, complements, choosing between the three backends, verifying that a circuit is correct, measuring circuit cost the way the paper does, exporting circuits, using the intermediate stages directly, running benchmark sweeps, and a troubleshooting table. EXTENDING.md Applying and extending the package beyond our experiments: adding input front ends, compiling states that are not regular languages, adding methods to the benchmark harness, adding new circuit backends, generalising past the binary alphabet, using the analysis machinery on its own, known limits with workarounds, and how to test an extension.