Feynman Meets Turing: The Curse of Quantum Universality

2026-07-17

AI Summary

This study investigates whether semantically universal quantum circuit description languages (QCDLs) can effectively decide the validity of programs. By integrating computability theory, formal language theory, and models of quantum unitary operators, the work presents a formal characterization of QCDLs and establishes, for the first time, that the set of valid programs in any semantically universal QCDL is not semi-decidable. This result underscores a fundamental divergence between quantum and classical programming languages at the level of semantic structure and reveals an intrinsic limitation of quantum circuit description languages: no compiler can reliably recognize all valid programs. Consequently, the findings highlight the unique challenges posed by quantum computation in the realm of formal semantics.

Abstract

We consider a formal model of quantum circuit description languages (QCDLs) in which semantically meaningful programs correspond to computable unitary matrices. We show that any semantically universal QCDL -- that is, any QCDL able to describe all computable unitary matrices, which in turn form the set of matrices we can meaningfully represent on digital hardware -- cannot have a semi-decidable set of semantically meaningful descriptions. In particular, no such language admits a compiler that reliably recognizes all valid program descriptions. This result stands in contrast to classical programming languages. While compilation in languages such as C or C++ may itself involve non-terminating computations, the set of semantically meaningful programs remains recursively enumerable, since successful compilation provides a witness of validity. The essential difference lies in the nature of the semantic domains: classical languages describe partial recursive functions, whereas QCDLs describe total unitary operators. Our analysis establishes a fundamental limitation of quantum circuit description languages and highlights a structural distinction between classical and quantum models of computation at the level of formal language theory.

Problem

• quantum circuit description languages
• semantic universality
• computable unitary matrices
• semi-decidability
• quantum computation

Innovation

• quantum circuit description languages
• semantic universality
• undecidability
• unitary operators
• formal language theory