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:2502.10242 · PRX Quantum

Variational Optical Phase Learning on a Continuous-Variable Quantum Compiler

Matthew A. Feldman, Tyler J. Volkoff, Seongjin Hong, Claire E. Marvinney, Zoë Holmes, Raphael C. Pooser, Andrew T. Sornborger, Alberto M. Marino

Published Jan 26, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum process learning is a fundamental primitive that draws inspiration from machine learning with the goal of better studying the dynamics of quantum systems. One approach to quantum process learning is quantum compilation, whereby an analog quantum operation is digitized by compiling it into a series of basic gates. While there has been significant focus on quantum compiling for discrete-variable systems, the continuous-variable (CV) framework has received comparatively less attention. We present an experimental implementation of a CV quantum compiler that uses two-mode squeezed light to learn a Gaussian unitary operation. We demonstrate the compiler by learning a parameterized linear phase unitary through the use of target and control phase unitaries to demonstrate a factor of 5.4 increase in the precision of the phase estimation and a 3.6-fold acceleration in the time-to-solution metric when leveraging quantum resources. We further show how our approach can be extended to higher-dimensional compilation tasks. Our results are enabled by the tunable control of our cost landscape via variable squeezing, thus providing a critical framework to simultaneously increase precision and reduce time-to-solution.

DOI
10.1103/7l8z-zn2m

Related papers

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Tyler J. Volkoff, Zoë Holmes, Andrew T. Sornborger

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system.While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuousvariable paradigm.Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation.We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities.We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems.These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

arXiv:2105.01049•PRX Quantum•Nov 8, 2021•39 citations

Quantum Advantage in Phase Unitary Learning with a Continuous-Variable Quantum Compiler

Matthew Feldman, Tyler J. Volkoff, Zoë Holmes +5 more

We demonstrate a continuous-variable quantum compiler with 3.6-fold faster convergence and 5.4-fold enhanced precision for optical phase unitary learning, highlighting the advantages of squeezing in learning the dynamics of quantum systems.

Quantum 2.0 Conference and Exhibition•Jan 1, 2025•0 citations

A Continuous Variable Quantum Compiler

Matthew Feldman, Tyler J. Volkoff, Zoë Holmes +5 more

We implement a continuous-variable quantum compiler that can learn a linear phase operation with a fourfold increase in precision and a factor of 80 reduction in time to solution when quantum resources are used.

Conference on Lasers and Electro-Optics•Jan 1, 2024•1 citation

Towards a Continuous Variable Quantum Compiler

Matthew Feldman, Tyler J. Volkoff, Zoë Holmes +5 more

We present initial work towards an experimental implementation of a nonuniversal continuous variable quantum compiler capable of learning a linear phase operation with increased precision when quantum resources are used.

Quantum 2.0 Conference and Exhibition•Jan 1, 2023•0 citations

Hardware-inspired Continuous Variables Quantum Optical Neural Networks

Todor Krasimirov-Ivanov, Alba Cervera-Lierta, Paolo Stornati +1 more

Continuous-variables (CV) quantum optics is a natural formalism for neural networks (NNs) due to its ability to reproduce the information processing of such trainable interconnected systems. In quantum optics, Gaussian operators induce affine mappings on the quadratures of optical modes while non-Gaussian resources (the challenging piece for physical implementation) originate the nonlinear effects, unlocking quantum analogs of an artificial neuron. This work presents a novel experimentally-feasible framework for continuous-variable quantum optical neural networks (QONNs) developed with available photonic components: coherent states as input encoding, a general Gaussian transformation followed by multi-mode photon subtractions as the processing layer, and homodyne detection as outputs readout. The closed-form expressions of such architecture are derived demonstrating the family of adaptive activations and the quantum-optical neurons that emerge from the amount of photon-subtracted modes, proving that the proposed design satisfies the Universal Approximation Theorem within a single layer. To classically simulate the QONN training, the high-performance QuaNNTO library has been developed based on Wick-Isserlis expansion and Bogoliubov transformations, allowing multi-layer exact expectation values of non-Gaussian states without truncating the infinite-dimensional Hilbert space. Experiments on supervised learning and state-preparation tasks show balanced-resource efficiency with strong expressivity and generalization capabilities, illustrating the potential of the architecture for scalable photonic quantum machine learning and for quantum applications such as complex non-Gaussian gate synthesis.

quant-pharXiv:2512.05204•Dec 8, 2025•1 citation

Scalable quantum dynamics compilation via quantum machine learning

Yuxuan Zhang, Roeland Wiersema, Juan Carrasquilla +2 more

Quantum dynamics compilation is an important task for improving quantum simulation efficiency: It aims to synthesize multiqubit target dynamics into a circuit consisting of as few elementary gates as possible. Compared to deterministic methods such as Trotterization, variational quantum compilation (VQC) methods employ variational optimization to reduce gate costs while maintaining high accuracy. In this work, we make a paradigm shift in VQC’s framework design. First, we use a cost function from recently established out-of-distribution generalization results in quantum machine learning: By learning the action of a given many-body dynamics on a small dataset of product states, we can obtain a unitary circuit that generalizes to highly entangled states such as the Haar random states. Moreover, a key observation is that the low complexity in the data states allows us to use tensor-network methods to compress such time-evolved product states by exploiting their low entanglement features. Utilizing warm start methods, our approach exceeds state-of-the-art compilation results in both system size and accuracy in one dimension. For the first time, we extend VQC to systems to two-dimensional systems, demonstrating a significant resource advantage over standard Trotterization methods. The flexibility of our framework highlights the method's promise for advancing quantum simulation tasks on near-term quantum processors.

arXiv:2409.16346•Physical Review Research•Feb 4, 2026•22 citations
Quantum process learning is a fundamental primitive that draws inspiration from machine learning with the goal of better studying the dynamics of quantum systems. One approach to quantum process learning is quantum compilation, whereby an analog quantum operation is digitized by compiling it into a series of basic gates. While there has been significant focus on quantum compiling for discrete-variable systems, the continuous-variable (CV) framework has received comparatively less attention. We present an experimental implementation of a CV quantum compiler that uses two-mode squeezed light to learn a Gaussian unitary operation. We demonstrate the compiler by learning a parameterized linear phase unitary through the use of target and control phase unitaries to demonstrate a factor of 5.4 increase in the precision of the phase estimation and a 3.6-fold acceleration in the time-to-solution metric when leveraging quantum resources. We further show how our approach can be extended to higher-dimensional compilation tasks. Our results are enabled by the tunable control of our cost landscape via variable squeezing, thus providing a critical framework to simultaneously increase precision and reduce time-to-solution.
Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system.While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuousvariable paradigm.Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation.We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities.We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems.These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.
Continuous-variables (CV) quantum optics is a natural formalism for neural networks (NNs) due to its ability to reproduce the information processing of such trainable interconnected systems. In quantum optics, Gaussian operators induce affine mappings on the quadratures of optical modes while non-Gaussian resources (the challenging piece for physical implementation) originate the nonlinear effects, unlocking quantum analogs of an artificial neuron. This work presents a novel experimentally-feasible framework for continuous-variable quantum optical neural networks (QONNs) developed with available photonic components: coherent states as input encoding, a general Gaussian transformation followed by multi-mode photon subtractions as the processing layer, and homodyne detection as outputs readout. The closed-form expressions of such architecture are derived demonstrating the family of adaptive activations and the quantum-optical neurons that emerge from the amount of photon-subtracted modes, proving that the proposed design satisfies the Universal Approximation Theorem within a single layer. To classically simulate the QONN training, the high-performance QuaNNTO library has been developed based on Wick-Isserlis expansion and Bogoliubov transformations, allowing multi-layer exact expectation values of non-Gaussian states without truncating the infinite-dimensional Hilbert space. Experiments on supervised learning and state-preparation tasks show balanced-resource efficiency with strong expressivity and generalization capabilities, illustrating the potential of the architecture for scalable photonic quantum machine learning and for quantum applications such as complex non-Gaussian gate synthesis.
Quantum dynamics compilation is an important task for improving quantum simulation efficiency: It aims to synthesize multiqubit target dynamics into a circuit consisting of as few elementary gates as possible. Compared to deterministic methods such as Trotterization, variational quantum compilation (VQC) methods employ variational optimization to reduce gate costs while maintaining high accuracy. In this work, we make a paradigm shift in VQC’s framework design. First, we use a cost function from recently established out-of-distribution generalization results in quantum machine learning: By learning the action of a given many-body dynamics on a small dataset of product states, we can obtain a unitary circuit that generalizes to highly entangled states such as the Haar random states. Moreover, a key observation is that the low complexity in the data states allows us to use tensor-network methods to compress such time-evolved product states by exploiting their low entanglement features. Utilizing warm start methods, our approach exceeds state-of-the-art compilation results in both system size and accuracy in one dimension. For the first time, we extend VQC to systems to two-dimensional systems, demonstrating a significant resource advantage over standard Trotterization methods. The flexibility of our framework highlights the method's promise for advancing quantum simulation tasks on near-term quantum processors.