QEncodeBench evaluates whether large language models can translate classical constraint problems into verified quantum phase oracles. The benchmark measures the correctness of generated circuits using an adversarial self‑validated verifier that checks full solution‑set equivalence while enforcing resource limits. Results show that models lacking a reasoning mode perform poorly, whereas enabling native reasoning improves accuracy tenfold; semantic errors dominate, and neuro‑symbolic pipelines close most gaps by delegating critical composition to deterministic procedures.
By Xujun Che, Hanhan Wu, Yuchen Yuan, Chenyang Yu
arXiv:2607. 25647v1 Announce Type: cross Abstract: As quantum computing continually improves, ensuring the reliability and correctness of quantum libraries has become increasingly critical.
By Fuyuan Xia, Qixin Zhang, Chenhao Ying, Haojin Zhu, Shuai Wang, Yuan Luo, Pingchuan Ma, Yuxuan Du
QC-Stark is a benchmark that evaluates large language models on 11 quantum computing tasks, including circuit construction, debugging, compilation, error correction, and simulation. It comprises 2,750 evaluations across 10 models, 5 difficulty levels, and 5 seeds, revealing that overall model rankings can hide significant per-task differences, with Spearman correlation being insignificant for 4 of the 11 tasks. The benchmark’s measurement quality is validated by a 2‑parameter Item Response Theory model, prompt sensitivity analysis confirms ranking robustness, and all tasks are auto‑verifiable via execution, eliminating the need for manual evaluation. The code and data are publicly available on Hugging Face.
arXiv:2605. 30358v2 Announce Type: replace Abstract: Quantum computing remains in the Noisy Intermediate-Scale Quantum (NISQ) era, with performance constrained by noise.
By Zhenxiao Fu, Lei Jiang, Fan Chen
arXiv:2607. 04072v1 Announce Type: cross Abstract: Large language models can generate plausible quantum code, but it is unclear whether they can reliably target the specific software development kit (SDK) version requested by the user.
By Mohammad Arif Rasyidi, Syahirul Faiz
arXiv:2605. 25572v2 Announce Type: replace-cross Abstract: The growing complexity of quantum programming frameworks has exposed a critical limitation in existing large language model (LLM)-based code assistants: general-purpose models hallucinate PennyLane-specific gate names, misplace device configurations, and produce structurally invalid circuits when faced with specialized quantum coding challenges.
By Minghao Shao, Nouhaila Innan, Hariharan Janardhanan, Muhammad Kashif, Alberto Marchisio, Muhammad Shafique