Position: Quantum Program Generation Must Prioritize Validity Over Probabilistic Scaling

• URL: http://arxiv.org/abs/2607.15313v1
• Date: Wed, 15 Jul 2026 21:28:59 GMT
• Title: Position: Quantum Program Generation Must Prioritize Validity Over Probabilistic Scaling
• Abstract summary: Unlike natural languages, quantum circuits require strict adherence to mathematical constraints that manifest a significant syntax-semantics gap.<n>Training on unverified quantum programs means that models learn syntax but fail to capture the physical semantics of the Hilbert space.<n>We propose a pivot from human-centric copilots to verifier-centric agents.
• Score: 7.165225514185139
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Aligning Quantum Operators with Large Language Models [7.837080726525561]
  We introduce an approach that maps unitary operators into the latent space of an LLM.<n>We instantiate this idea on Clifford+T circuit synthesis over a Pauli rotation gate set.<n>Our approach further enables language synthesis, allowing gate constraints unseen during training to be specified directly in natural language.
  arXiv  Detail & Related papers  (2026-06-11T18:27:27Z)
• Denotational semantics for stabiliser quantum programs [0.0]
  We develop a sound, universal and complete denotational semantics for stabiliser operations.<n>We demonstrate the power of the resulting semantics by describing a small, proof-of-concept assembly language for stabiliser programs.
  arXiv  Detail & Related papers  (2025-11-27T19:51:43Z)
• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Quantum Control Machine: The Limits of Control Flow in Quantum Programming [9.481014977048282]
  We provide a complete characterization of the properties of control flow abstractions that are correctly realizable on a quantum computer. We show how this design enables a developer to correctly express control flow in quantum algorithms using a program counter in place of logic gates.
  arXiv  Detail & Related papers  (2023-04-28T17:51:35Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Decoding the Projective Transverse Field Ising Model [0.0]
  We study a projective transverse field Ising model with a focus on its capabilities as a quantum error correction code. We demonstrate that there is a finite threshold below which quantum information encoded in an initially entangled state can be retrieved reliably. This implies that there is a finite regime where quantum information is protected by the projective dynamics, but cannot be retrieved by using syndrome measurements.
  arXiv  Detail & Related papers  (2023-03-06T12:45:11Z)
• Topological Quantum Gates in Homotopy Type Theory [0.0]
  We explain how the specification of realistic topological quantum gates has a surprisingly slick formulation in parameterized point-set topology. We propose that this confluence of concepts may jointly kickstart the development of topological quantum programming proper. In a companion article, we will explain how further passage to "dependent linear" homotopy data types naturally extends this scheme to a full-blown quantum programming/certification language.
  arXiv  Detail & Related papers  (2023-03-04T11:25:49Z)
• Verification of Nondeterministic Quantum Programs [1.9302781323430196]
  Nondeterministic choice is a useful program construct that provides a way to describe the behaviour of a program without specifying the details of possible implementations. Nondeterminism has also been introduced in quantum programming, and the termination of nondeterministic quantum programs has been extensively analysed.
  arXiv  Detail & Related papers  (2023-02-15T22:37:23Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.