When Close Enough Is Not Enough: Autoregressive Drift in Quantum Circuit Synthesis
Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates. We study this problem using a compact 44.8M-parameter encoder-decoder transformer with structured circuit tokenization, evaluating on parameterized circuits (2-6 qubits) and Clifford+T circuits (3-6 qubits). On parameterized circuits, a hybrid approach -- structure from the transformer, angles from classical optimization -- achieves median fidelity 1.000 on 3-6 qubit circuits. On Clifford+T circuits, where all gates are discrete and
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
Every edge carries a method, confidence, and the source snippet that justified it — so bad links are debuggable.
- PossiblePossibly related (embedding) · 53%MIT and IBM Project Quantum Unity Operators into Language Model Latent Spaces for Multimodal Circuit Synthesis - Quantum Computing Report →
- PossiblePossibly related (embedding) · 48%mit-han-lab/torchquantum →
- PossiblePossibly related (embedding) · 46%tensorflow/quantum →
- PossiblePossibly related (embedding) · 45%netket/netket →
- LinkedLinked via arxiv author · 85%Mehdi Saeedi →
“When Close Enough Is Not Enough: Autoregressive Drift in Quantum Circuit Synthesis”
- LinkedLinked via arxiv author · 85%Eddie Richter →
“When Close Enough Is Not Enough: Autoregressive Drift in Quantum Circuit Synthesis”
- LinkedLinked via arxiv author · 85%Paul Hartke →
“When Close Enough Is Not Enough: Autoregressive Drift in Quantum Circuit Synthesis”