Reasoning about Continuous-Variable Quantum Systems

• URL: http://arxiv.org/abs/2607.23137v1
• Date: Sat, 25 Jul 2026 10:36:34 GMT
• Title: Reasoning about Continuous-Variable Quantum Systems
• Abstract summary: Continuous-variable quantum computing (CVQC) is a computing paradigm in which measurements yield values over a continuous domain.<n>CVQC is both a convenient omputational framework for modeling physical quantum systems, and a good abstraction for hardware platforms based on quantum optics.<n>We develop a formal semantics for a core CV quantum programming language, and sound verification methods for program correctness.
• Score: 10.113921654362638
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Continuous-variable quantum computing (CVQC) is a computing paradigm in which measurements yield values over a continuous domain. CVQC is both a convenient omputational framework for modeling physical quantum systems, and a good abstraction for hardware platforms based on quantum optics. Yet, the semantic foundations of CVQC remain underdeveloped. To address this gap, we develop a formal semantics for a core CV quantum programming language, and sound verification methods for program correctness. A main contribution of this work is to isolate a well-behaved quantitative predicate domain that achieves sufficient expressiveness to accommodate unbounded values as they arise in the infinite-dimensional, continuous setting. Specifically, we choose closed positive quadratic forms as semantic predicates, representing finite expectations, domains of finiteness, and infinite penalties in one ordered object. We validate our choice by establishing that our semantic predicates satisfy desirable closure properties including the definition of weakest preconditions. We validate our design with two case studies, including an example based on the celebrated GKP error-correcting code, for which we establish a second moment bound.

Related papers

• Quantization-Triggered Backdoors in Language Models: Cross-Quantizer Transferability and the Validation--Deployment Gap [0.0]
  Post-training quantization is often treated as a semantically neutral optimization for edge deployment of Large Language Models.<n>We show that backdoored translation models move from zero measured friend--foe corruption at repaired FP16 to up to 85.02% inversion after quantization.<n>We formalize this gap through Quantization Behavioral Equivalence Classes (QBECs) and prove that QBEC membership does not imply behavioral equivalence.
  arXiv  Detail & Related papers  (2026-08-27T08:34:10Z)
• Detecting quantum phase transitions via shallow variational quantum circuits [0.0]
  A variational quantum eigensolver (VQE) determines critical points by contrasting variational energies optimized from reference states of distinct phases.<n>We demonstrate that, whenever dual anstze are employed, Delta-VQE invariably detects the self-dual points rather than the true criticality.<n>Our results establish that, while Delta-VQE provides a resource-efficient probe of quantum criticality without requiring precise ground-state preparation, its diagnostic power is fundamentally contingent upon the judicious selection of physically representative anstze.
  arXiv  Detail & Related papers  (2026-07-28T06:47:35Z)
• Formal Verification of Continuous-Variable Quantum Programs [6.925649240526206]
  We provide a formal framework for Continuous-Variable Quantum Computing (CQC)<n>While CQC is supported by photonic quantum hardware, we are not aware of a formal semantics for CQC.<n>We implement a symbolic weakest-precondition CQC based on our logic.
  arXiv  Detail & Related papers  (2026-07-20T09:09:20Z)
• Projected Dynamic Programming for Sequential Quantum State Discrimination [0.0]
  Sequential Quantum State Discrimination (SQSD) can be naturally framed as a sequential decision-making problem.<n>In this paper, we cast SQSD into a static-hidden-state Partially Observable Markov Decision Process framework.<n>Our analysis confirms that the inherent trade-off between accuracy and complexity, as well as the curse of dimensionality regarding the number of hypotheses, are also prominently observed in the quantum regime.
  arXiv  Detail & Related papers  (2026-04-16T08:21:40Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• 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)
• Modular Quantum Amplitude Estimation: A Scalable and Adaptive Framework [0.0]
  We introduce the Adaptive Windowed Quantum Amplitude Estimation (AWQAE) framework.<n>It is a modular, scalable and adaptive approach that decouples estimation precision from the number of physical qubits required in a single circuit.<n>AWQAE offers a powerful and flexible solution for performing high-precision QAE on resource-constrained quantum hardware.
  arXiv  Detail & Related papers  (2025-08-07T19:19:11Z)
• Refinement calculus of quantum programs with projective assertions [5.151896714190243]
  This paper introduces a refinement calculus tailored for quantum programs. We first study the partial correctness of nondeterministic programs within a quantum. We also present their semantics in transforming a postcondition to the weakest liberal postconditions.
  arXiv  Detail & Related papers  (2023-11-23T22:12:57Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

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.