Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.23137

Reasoning about Continuous-Variable Quantum Systems

Tianshi Yu, Gilles Barthe, Minbo Gao, Mingsheng Ying, Li Zhou

cs.LOcs.PLmath.FAquant-phSubmitted Jul 25, 2026• Announced Jul 28, 2026• 0 citations• Revised Oct 19, 2026 (v2)
v1 · Jul 25, 2026v2 · Oct 19, 2026
arXivHTMLPDF

Abstract

Continuous-variable quantum computing (CVQC) is a computing paradigm in which measurements yield values over a continuous domain. CVQC is both a convenient computational 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.

Comments
119 pages,2 figures

Related papers

Formal Verification of Continuous-Variable Quantum Programs

Stefanie Muroya, Thomas A. Henzinger

We provide a formal framework for Continuous-Variable Quantum Computing (CQC). While CQC is supported by photonic quantum hardware, we are not aware of a formal semantics for continuous-variable quantum programs nor of a unary Hoare logic for their verification. There are several technical obstacles to extending to CQC any of the formal frameworks available for Discrete-Variable Quantum Computing (DQC). Most importantly, continuous-variable quantum programs act on {\em infinite-dimensional} Hilbert spaces; their measurement outcomes are often {\em unbounded} and have expected values that are defined by an improper integral (or an infinite series), which may not converge. We overcome these challenges to give a formal semantics to a universal programming language for CQC and to provide the first Hoare logic for CQC. The assertions of our logic are built from polynomials over canonical observables. Besides proving relative completeness, we implement a symbolic weakest-precondition calculator for CQC based on our logic. Our tool has successfully verified CQC algorithms from textbooks and calculated their approximation errors for physically realizable implementations, proved the correctness (i.e., equivalence) of gate decompositions for CQC hardware, and computed the resource requirements (i.e., number of photon-number states) for achieving a desired accuracy in the classical simulation of continuous-variable quantum programs.

quant-pharXiv:2607.17714•Jul 21, 2026•0 citations

The Focked-up ZX Calculus: Picturing Continuous-Variable Quantum Computation

Razin Abdulrauf Shaikh, Lia Yeh, Stefano Gogioso

While the ZX and ZW calculi have been effective as graphical reasoning tools for finite-dimensional quantum computation, the possibilities for continuous-variable quantum computation (CVQC) in infinite-dimensional Hilbert space are only beginning to be explored. In this work, we formulate a graphical language for CVQC. Each diagram is an undirected graph made of two types of spiders: the Z spider from the ZX calculus defined on the reals, and the newly introduced Fock spider defined on the natural numbers. The Z and X spiders represent functions in position and momentum space respectively, while the Fock spider represents functions in the discrete Fock basis. In addition to the Fourier transform between Z and X, and the Hermite transform between Z and Fock, we present exciting new graphical rules capturing heftier CVQC interactions. We ensure this calculus is complete for all of Gaussian CVQC interpreted in infinite-dimensional Hilbert space, by translating the completeness in affine Lagrangian relations by Booth, Carette, and Comfort. Applying our calculus for quantum error correction, we derive graphical representations of the Gottesman-Kitaev-Preskill (GKP) code encoder, syndrome measurement, and magic state distillation of Hadamard eigenstates. Finally, we elucidate Gaussian boson sampling by providing a fully graphical proof that its circuit samples submatrix hafnians.

arXiv:2406.02905•Jun 5, 2024•10 citations

A formal language for expressing quantum predicates

Umut Yiğit Dural

We develop a formal language, a syntax, for specifying quantum predicates, which are yes/no properties of quantum systems. Specifically we study classical-quantum predicates using projector-based Birkhoff-von Neumann quantum logic. We give an extensional definition of a weakest precondition calculus that preserves projector-based predicates fora simple loop-free classical-quantum programming language. We prove that our weakest precondition calculus is relatively complete in the sense of Cook for the classical-quantum programming language we specify. To achieve this, we show that for any post condition expressible in our formal language, the corresponding weakest precondition with respect to any program is also expressible in our formal language. This result establishes a foundation for reasoning about classical-quantum programs using an intensional approach.

•Jan 1, 2025•0 citations

CoqQ: Foundational Verification of Quantum Programs

Li Zhou, Gilles Barthe, Pierre-Yves Strub +2 more

CoqQ is a framework for reasoning about quantum programs in the Coq proof assistant. Its main components are: a deeply embedded quantum programming language, in which classic quantum algorithms are easily expressed, and an expressive program logic for proving properties of programs. CoqQ is foundational: the program logic is formally proved sound with respect to a denotational semantics based on state-of-art mathematical libraries (MathComp and MathComp Analysis). CoqQ is also practical: assertions can use Dirac expressions, which eases concise specifications, and proofs can exploit local and parallel reasoning, which minimizes verification effort. We illustrate the applicability of CoqQ with many examples from the literature.

arXiv:2207.11350•Proceedings of the ACM on Programming Languages•Jan 9, 2023•63 citations

Continuous-variable quantum computing on a trapped ion: neural network applications

Alexandre C. Ricardo, Gubio Gomes de Lima, Amanda G. Valério +2 more

Abstract Continuous-variable quantum computing (CVQC) uses quantum states with continuous degrees of freedom, such as the quadratures of bosonic modes, to encode information, promising efficient solutions to complex problems. Trapped-ion systems provide a robust platform with long coherence times and precise qubit control, enabling the manipulation of quantum information through its motional and electronic degrees of freedom. In this theoretical work, we quantitatively analyze the fidelity of a Kerr operation in a single trapped-ion system, calibrating the interaction time using a motional-state Rabi frequency correction. Through numerical simulations, we validate Gaussian and non-Gaussian CVQC operations, achieving fidelities exceeding 99% in all cases, including non-Gaussian operations. Furthermore, we demonstrate two key applications: first, the implementation of a continuous-variable quantum neural network for regression problems, which exhibits low error rates; and second, its application to state preparation tasks, achieving a fidelity of 90% for the given example. These results open new opportunities to execute quantum computing algorithms on continuous variables with trapped ions, such as quantum machine learning algorithms.

arXiv:2412.15025•Physica Scripta•Nov 19, 2025•3 citations

Motional state engineering for continuous-variable quantum computation

Gabriel Mintzer

The standard approach to quantum computation uses qubits, which are well-described as a two-level system. An alternative approach to quantum computation is continuous-variable quantum computation (CVQC), which uses physical observables, such as the strength of an electromagnetic field or the position of a particle in space, whose numerical values belong to continuous intervals. Trapped ions are well-developed for quantum computation, and they possess both qubit and continuous degrees of freedom that can be precisely controlled, making them a good candidate for a realization of CVQC. Although there exist software frameworks capable of simulating CVQC experiments, these frameworks do not incorporate realistic noise sources and cannot be tailored to a specific trapped-ion setup. In this work, we develop a computational framework for simulating CVQC operations using trapped ions in a realistic system with realistic noise sources. We do so first with ideal Hamiltonians and then with Hamiltonians generated directly from the electric potential and fields that can be applied to the trapped ion in a representative Paul trap. This allows for the direct simulation of a squeezing operation that can be implemented through application of voltages in trapped-ion experiments. These methods can be applied to other CVQC operations in order to allow for their direct simulation as well. We package these tools into a usable application with which we can load information about an experimental configuration and then use this simulation procedure to design and test experiments in CVQC achievable with an ion-trap setup, thus facilitating the experimental design process and eventually allowing for prediction of system behavior and comparison with experimental results.

•Jan 1, 2021•0 citations
Continuous-variable quantum computing (CVQC) is a computing paradigm in which measurements yield values over a continuous domain. CVQC is both a convenient computational 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.
We provide a formal framework for Continuous-Variable Quantum Computing (CQC). While CQC is supported by photonic quantum hardware, we are not aware of a formal semantics for continuous-variable quantum programs nor of a unary Hoare logic for their verification. There are several technical obstacles to extending to CQC any of the formal frameworks available for Discrete-Variable Quantum Computing (DQC). Most importantly, continuous-variable quantum programs act on {\em infinite-dimensional} Hilbert spaces; their measurement outcomes are often {\em unbounded} and have expected values that are defined by an improper integral (or an infinite series), which may not converge. We overcome these challenges to give a formal semantics to a universal programming language for CQC and to provide the first Hoare logic for CQC. The assertions of our logic are built from polynomials over canonical observables. Besides proving relative completeness, we implement a symbolic weakest-precondition calculator for CQC based on our logic. Our tool has successfully verified CQC algorithms from textbooks and calculated their approximation errors for physically realizable implementations, proved the correctness (i.e., equivalence) of gate decompositions for CQC hardware, and computed the resource requirements (i.e., number of photon-number states) for achieving a desired accuracy in the classical simulation of continuous-variable quantum programs.
While the ZX and ZW calculi have been effective as graphical reasoning tools for finite-dimensional quantum computation, the possibilities for continuous-variable quantum computation (CVQC) in infinite-dimensional Hilbert space are only beginning to be explored. In this work, we formulate a graphical language for CVQC. Each diagram is an undirected graph made of two types of spiders: the Z spider from the ZX calculus defined on the reals, and the newly introduced Fock spider defined on the natural numbers. The Z and X spiders represent functions in position and momentum space respectively, while the Fock spider represents functions in the discrete Fock basis. In addition to the Fourier transform between Z and X, and the Hermite transform between Z and Fock, we present exciting new graphical rules capturing heftier CVQC interactions. We ensure this calculus is complete for all of Gaussian CVQC interpreted in infinite-dimensional Hilbert space, by translating the completeness in affine Lagrangian relations by Booth, Carette, and Comfort. Applying our calculus for quantum error correction, we derive graphical representations of the Gottesman-Kitaev-Preskill (GKP) code encoder, syndrome measurement, and magic state distillation of Hadamard eigenstates. Finally, we elucidate Gaussian boson sampling by providing a fully graphical proof that its circuit samples submatrix hafnians.
We develop a formal language, a syntax, for specifying quantum predicates, which are yes/no properties of quantum systems. Specifically we study classical-quantum predicates using projector-based Birkhoff-von Neumann quantum logic. We give an extensional definition of a weakest precondition calculus that preserves projector-based predicates fora simple loop-free classical-quantum programming language. We prove that our weakest precondition calculus is relatively complete in the sense of Cook for the classical-quantum programming language we specify. To achieve this, we show that for any post condition expressible in our formal language, the corresponding weakest precondition with respect to any program is also expressible in our formal language. This result establishes a foundation for reasoning about classical-quantum programs using an intensional approach.
CoqQ is a framework for reasoning about quantum programs in the Coq proof assistant. Its main components are: a deeply embedded quantum programming language, in which classic quantum algorithms are easily expressed, and an expressive program logic for proving properties of programs. CoqQ is foundational: the program logic is formally proved sound with respect to a denotational semantics based on state-of-art mathematical libraries (MathComp and MathComp Analysis). CoqQ is also practical: assertions can use Dirac expressions, which eases concise specifications, and proofs can exploit local and parallel reasoning, which minimizes verification effort. We illustrate the applicability of CoqQ with many examples from the literature.
Abstract Continuous-variable quantum computing (CVQC) uses quantum states with continuous degrees of freedom, such as the quadratures of bosonic modes, to encode information, promising efficient solutions to complex problems. Trapped-ion systems provide a robust platform with long coherence times and precise qubit control, enabling the manipulation of quantum information through its motional and electronic degrees of freedom. In this theoretical work, we quantitatively analyze the fidelity of a Kerr operation in a single trapped-ion system, calibrating the interaction time using a motional-state Rabi frequency correction. Through numerical simulations, we validate Gaussian and non-Gaussian CVQC operations, achieving fidelities exceeding 99% in all cases, including non-Gaussian operations. Furthermore, we demonstrate two key applications: first, the implementation of a continuous-variable quantum neural network for regression problems, which exhibits low error rates; and second, its application to state preparation tasks, achieving a fidelity of 90% for the given example. These results open new opportunities to execute quantum computing algorithms on continuous variables with trapped ions, such as quantum machine learning algorithms.
The standard approach to quantum computation uses qubits, which are well-described as a two-level system. An alternative approach to quantum computation is continuous-variable quantum computation (CVQC), which uses physical observables, such as the strength of an electromagnetic field or the position of a particle in space, whose numerical values belong to continuous intervals. Trapped ions are well-developed for quantum computation, and they possess both qubit and continuous degrees of freedom that can be precisely controlled, making them a good candidate for a realization of CVQC. Although there exist software frameworks capable of simulating CVQC experiments, these frameworks do not incorporate realistic noise sources and cannot be tailored to a specific trapped-ion setup. In this work, we develop a computational framework for simulating CVQC operations using trapped ions in a realistic system with realistic noise sources. We do so first with ideal Hamiltonians and then with Hamiltonians generated directly from the electric potential and fields that can be applied to the trapped ion in a representative Paul trap. This allows for the direct simulation of a squeezing operation that can be implemented through application of voltages in trapped-ion experiments. These methods can be applied to other CVQC operations in order to allow for their direct simulation as well. We package these tools into a usable application with which we can load information about an experimental configuration and then use this simulation procedure to design and test experiments in CVQC achievable with an ion-trap setup, thus facilitating the experimental design process and eventually allowing for prediction of system behavior and comparison with experimental results.