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

Quantum 2.0 Conference and Exhibition

Towards a Continuous Variable Quantum Compiler

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

Published Jan 1, 2023• 0 citations
Publisher

Abstract

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.
DOI
10.1364/quantum.2023.qth4b.5

Related papers

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

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

Dissipative Continuous-Variable Quantum Compiler Engine using Laplace-Legendre Encodings and Machine Learning Error Refinemen

Sri Kaleeswarar S

•Aug 29, 2026•0 citations

Variational Optical Phase Learning on a Continuous-Variable Quantum Compiler

Matthew A. Feldman, Tyler J. Volkoff, Seongjin Hong +5 more

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.

arXiv:2502.10242•PRX Quantum•Jan 26, 2026•0 citations

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

Resources for continuous-variable quantum computation: theory and experimental proposals

Yu Chuan Zheng, Oliver Hahn, Pascal Stadler +4 more

Bulletin of the American Physical Society•Jun 2, 2021•0 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.