QEncodeBench: Can Large Language Models Encode Classical Problems into Verified Quantum Oracles?
QEncodeBench tasks large language models with encoding classical constraint problems as phase oracles and scores the generated circuits with an adversarially self-validated verifier that decides full solution-set equivalence up to a global phase, with ancillas restored and resource budgets enforced.
Xu-Jun Che, Han-Han Wu, Yu-Chen Yuan et al.
· 1 citation