Explainable Quantum Program Repair with Verifiable Proof Traces (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to program repair provide only post-hoc, non-verifiable explanations that are not executable or verifiably. |
| Approach: | They propose a framework that couples repair generation with machine-checkable executable explanations for quantum programs where correctness hinges on subtle semantic properties such as circuit equivalence and fidelity preservation. |
| Outcome: | Experiments on QASMBench with mutation-generated quantum program bugs show that the proposed framework improves both semantic precision and explanation faithfulness over baselines that rely on unconstrained or purely natural-language explanations. |
Similar Papers
Verifiable, Debuggable, and Repairable Commonsense Logical Reasoning via LLM-based Theory Resolution (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have led to substantial interest in their application to commonsense reasoning tasks. |
| Approach: | They propose a logical reasoning framework that integrates commonsense knowledge with a verifiable logical framework that mitigates hallucinations and facilitates debugging. |
| Outcome: | The proposed framework improves on three language-based reasoning tasks and improves accuracy and reasoning correctness. |
Investigating the Transferability of Code Repair for Low-Resource Programming Languages (2025.findings-naacl)
Copied to clipboard
| Challenge: | Large language models (LLMs) have shown remarkable performance on code generation tasks. |
| Approach: | They investigate the benefits of distilling the ability to repair code for both high and low resource languages to determine if the techniques are also applicable in low resource settings. |
| Outcome: | The proposed techniques are effective in high- and low-resource languages, but weak in low-level languages. |
LogicEval: A Systematic Framework for Evaluating Automated Repair Techniques for Logical Vulnerabilities in Real-World Software (2026.acl-long)
Copied to clipboard
Syed Md Mukit Rashid, Abdullah Al Ishtiaq, Kai Tu, Yilu Dong, Tianwei Wu, Ali Ranjbar, Tianchang Yang, Najrin Sultana, Shagufta Mehnaz, Syed Rafiul Hussain
| Challenge: | Existing automated program-repair techniques focus on repairing memory corruptions, but they struggle with logical vulnerabilities because of their limited semantic understanding of the code and its expected behavior. |
| Approach: | They evaluated a dataset of 122 logical vulnerabilities and a framework to evaluate patches for logical weaknesses. |
| Outcome: | The proposed framework evaluates both traditional and LLM-based approaches for addressing real-world logical vulnerabilities. |
QuantumQA: Enhancing Scientific Reasoning via Physics-Consistent Dataset and Verification-Aware Reinforcement Learning (2026.acl-long)
Copied to clipboard
Songxin Qu, Tai-Ping Sun, Yun-Jie Wang, Huan-Yu Liu, Cheng Xue, Xiao-Fan Xu, Han Fang, Yang Yang, Yu-Chun Wu, Guo-Ping Guo, Zhao-Yun Chen
| Challenge: | Large language models lack reliability in scientific domains that require strict adherence to physical constraints. |
| Approach: | They propose a large-scale dataset constructed via a task-adaptive strategy and a hybrid verification protocol that combines deterministic solvers with semantic auditing to guarantee scientific rigor. |
| Outcome: | The proposed model outperforms baselines and general-purpose preference models and is competitive with proprietary models. |
Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations (2025.acl-long)
Copied to clipboard
| Challenge: | Recent work has shown that the interaction of large language models (LLMs) with theorem provers (TPs) can help verify and improve the validity of NLI explanations. |
| Approach: | They propose to use logical expressions to guide LLMs in generating structured proof sketches and to use them to improve their accuracy. |
| Outcome: | The proposed strategies improve autoformalisation, syntactic errors and explanation refinement over the state-of-the-art model. |
QiMeng-PRepair: Precise Code Repair via Edit-Aware Reward Optimization (2026.acl-long)
Copied to clipboard
Changxin Ke, Rui Zhang, Jiaming Guo, Yuanbo Wen, Li Ding, Shuo Wang, Xuyuan Zhu, Xiong Peng, Di Huang, Zidong Du, Xing Hu, Qi Guo, Yunji Chen
| Challenge: | Existing approaches to program repair are based on correctness alone. |
| Approach: | They propose a framework that mitigates over-editing and improves repair accuracy by generating buggy programs and re-edits. |
| Outcome: | The proposed framework improves repair precision by 31.4% under fix1@1, a metric that considers repair correctness and extent, and significantly increases decoding throughput when combined with speculative editing. |
RePair: Automated Program Repair with Process-based Feedback (2024.findings-acl)
Copied to clipboard
| Challenge: | Commercial-scale language models (LMs) have taken APR to unprecedented levels, but they are limited by parameters and humans interact with them through explicit prompts. |
| Approach: | They propose a method that utilizes process supervision to improve program repair by allowing users to input feedback from compilers and test cases. |
| Outcome: | The proposed method outperforms large outcome-based generation methods and is inspired by strategies used in programming competitions. |
Code Reffix: A Benchmark for Reflection-Guided Code Repair with Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks focus on the repair generation capability of LLMs, lacking fine-grained evaluation of reflection. |
| Approach: | They propose a benchmark with oracle reflections and a dual-task protocol to decouple evaluation of reflection from repair. |
| Outcome: | The proposed benchmarks show that underperforming reflection capabilities remain a bottleneck for code repair. |
Natural Language Processing Meets Quantum Physics: A Survey and Categorization (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent research has focused on quantum-inspired algorithms for NLP and quantum-based algorithms for cognition. |
| Approach: | They propose to categorize quantum-inspired algorithms according to quantum theory, linguistic targets that are modeled, and the downstream application. |
| Outcome: | The proposed methods are categorized according to the use of quantum theory, the linguistic targets that are modeled, and the downstream application. |
Can NLI Models Verify QA Systems’ Predictions? (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Recent question answering systems perform well on benchmark datasets, but are not always well-calibrated to spot spurious answers under distribution shifts. |
| Approach: | They propose to use natural language inference to verify whether answers are correct . they leverage large pre-trained models and recent prior datasets to construct powerful question conversion and decontextualization modules. |
| Outcome: | The proposed approach improves the confidence estimation of a QA model across different domains, evaluated in a selective QA setting. |