论文用Claude Opus 4.7自动写量子穿梭编译器，性能超手工，开发时间从数月缩到数天，效率提升惊人。
Claude Opus 4.7首次生成并迭代优化了离子阱穿梭编译器的完整Python代码，从线性分段陷阱扩展到有结架构，最终适用于广泛连接图。在基准量子电路测试中，线性架构的穿梭time steps减少76%，有结架构减少39%。对于密集连接、结丰富的架构，穿梭time steps比走廊式架构降低一个数量级。Claude Fable 5复现了结果，在大电路上超越手工编译器的次数更多。开发时间从数月缩短到数天。
Efficient LLM-Generated Shuttling Compilers for Complex Trapped-Ion Architectures
Trapped-ion quantum computers rely on shuttling compilers, which cast an input algorithm into a sequence of ion-qubit movements within a given architecture. We present the first study in which a single frontier large language model (LLM), Claude Opus 4.7, generates and iteratively refines the full Python code of shuttling compilers from written specifications. We start with a compiler for (i) a linear segmented trap, extend it to (ii) a trap with junctions, and finally achieve efficient compilation for (iii) a broad class of connected trap graphs. The compilers for the more general cases are seeded with code from the previous ones. We benchmark the LLM-generated compilers against state-of-the-art hand-crafted ones using a common suite of quantum circuits. The number of shuttling timesteps is reduced by up to 76% for (i) and up to 39% for (ii). For the broad case (iii) of freely connected architectures, we find large variations in the required number of shuttling timesteps, depending on the connectivity. A densely connected, junction-rich architecture yields an order-of-magnitude reduction in shuttling timesteps compared to a corridor-like one. Repeating the complete generation and evaluation with a second frontier LLM, Claude Fable 5, reproduces these findings, with the Fable 5 compilers surpassing the hand-crafted ones more often on the largest circuits. Our results show that an unmodified frontier LLM can produce working, correct, and competitive shuttling compilers without additional manual algorithmic engineering, thus reducing the development time for new architectures from several months to a few days.