This position paper argues that applying this probabilistic paradigm to generic quantum circuit synthesis is a directional error, and proposes a pivot from human-centric copilots to verifier-centric agents, and suggests that scale alone cannot bridge the validity gap.
Abstract
The scaling hypothesis assumes that increasing model parameters yields emergent reasoning capabilities. This position paper argues that applying this probabilistic paradigm to generic quantum circuit synthesis is a directional error. Unlike natural languages, quantum circuits require strict adherence to mathematical constraints that manifest a significant syntax-semantics gap. Training on unverified quantum programs means that models learn syntax but fail to capture the physical semantics of the Hilbert space. Since the valid subset of circuit designs decays exponentially with the number of qubits, post-hoc filtering is mathematically intractable. We propose a pivot from human-centric copilots to verifier-centric agents. We integrate hierarchical constraints, topological masks, and symbolic proxies directly into generation. Our analysis suggests that scale alone cannot bridge the validity gap. Verification-aware architectures offer a viable path for modular quantum program generation. These considerations point toward generation methods that encode task-specific rules of quantum information, rather than relying on imitation alone.
This survey contributes a refined taxonomy with an attention-semantics dimension distinguishing pairwise from holistic mechanisms, a resource-realism analysis, and a critical synthesis of the empirical literature that finds parity or task-conditional modest gains rather than uniform quantum advantage across the five pa...
L. Sithamparanathan, Sathish A. P. Kumar· IEEE Access· 0 citations
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
The results indicate that typed state transitions and deterministic evidence control contribute beyond fluent generation alone on quantum-acceleration hypotheses beyond fluent generation alone.
Yijing Zuo, Zhengkang Fu, Zihan Nie et al.· 0 citations
As IQP circuits produce remarkably low intermediate magic relative to phase-randomised states with the same sampling distributions, this renders IQP-based quantum generative models as promising candidates for resource-efficient demonstrations of quantum advantage on early fault-tolerant architectures.
Current quantum programs are mainly designed at the level of quantum gates acting on individual qubits; on a large scale and for complex problems this may involve a high cognitive load on the programmer, making the program specification nontrivial and error-prone. In this context, providing quantum programming with hig...
David Chamizo, José García-Alonso, J. M. Murillo· 0 citations
This work presents important patterns and algorithms from fault-tolerant quantum applications which admit a structured representation that it is argued is crucial to preserve, and sets a challenge to the community to compile such representations without unrolling them into straight-line quantum circuits.
Damian Rovara, Daniel Haag, Mark Koch et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.