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

International Conference on Computational Science and Computational Intelligence (CSCI)

Continuous Variable Quantum Compilation

Federico Rueda, Sonia López Alarcón

Published Dec 1, 2021• 3 citations
Publisher

Abstract

In recent years quantum computing has evolved from a research concept subject to reality. Companies and scientists around the world are creating physical quantum systems using different quantum technologies to advance the field. Although most of this focus is on superconducting, qubit-based implementations, recently there has been work in the development of boson-based quantum computers. The basic processing unit for these devices are continuous variable (CV), multi-photonic modes in Gaussian states. Due to the novel nature of this technology there is a lack of work on analyzing the compilation process of current photonic devices. One of the leading companies in this field developed a cross-platform Python library for simulating and executing programs on quantum photonic hardware, Strawberry Fields (SF). This paper will focus on analyzing the SF compilers, and proposing an additional compilation step that will enable future, more flexible hardware implementations.

DOI
10.1109/csci54926.2021.00335

Related papers

Strawberry Fields: A Software Platform for Photonic Quantum Computing

Nathan Killoran, Josh Izaac, Nicolás Quesada +3 more

We introduce Strawberry Fields, an open-source quantum programming architecture for light-based quantum computers, and detail its key features. Built in Python, Strawberry Fields is a full-stack library for design, simulation, optimization, and quantum machine learning of continuous-variable circuits. The platform consists of three main components: (i) an API for quantum programming based on an easy-to-use language named Blackbird; (ii) a suite of three virtual quantum computer backends, built in NumPy and TensorFlow, each targeting specialized uses; and (iii) an engine which can compile Blackbird programs on various backends, including the three built-in simulators, and - in the near future - photonic quantum information processors. The library also contains examples of several paradigmatic algorithms, including teleportation, (Gaussian) boson sampling, instantaneous quantum polynomial, Hamiltonian simulation, and variational quantum circuit optimization.

arXiv:1804.03159•Quantum•Mar 11, 2019•395 citations

Continuous-Variable Quantum K-Means Clustering with Photonic Gaussian States

Abrar Ul Haque, Jinsung Cho, Hyundong Shin

This paper presents a novel approach to the K-Means clustering algorithm using continuous variable (CV) quantum computing, specifically leveraging Gaussian states on quantum photonic hardware. We implement the algorithm uti-lizing Strawberry Fields, a platform for simulating and executing photonic quantum computations. The theoretical framework integrates Gaussian state preparation, quantum interference, and homodyne detection to perform the clustering tasks. We evaluate the performance of the CV quantum K-Means algorithm on var-ious datasets, focusing on clustering accuracy and compactness compared to classical K-Means. Our findings provide valuable insights into the potential of using CV quantum methods for clustering and highlight the feasibility of CV quantum algorithms in machine learning. These results suggest promising directions for future research to further enhance their performance.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 16, 2024•1 citation

Compilation of Gaussian boson samplers for quantum computing

Sonia López Alarcón, Federico Rueda

Abstract Gaussian Boson Sampling is gaining relevance among the multiple technologies currently implementing quantum computing. The problem of sampling out of a boson distribution across multiple modes has a strong mathematical connection with combinatorics problems, with multiple practical applications that would classically be unfeasible to solve within reasonable time. The software stack that accompanies this GBS approach, and that takes the application from its high level description to the hardware implementation, is the main focus of this paper. The general compilation process of Gaussian Boson Samplers is described in detail. The specifics of the Strawberry Fields (Xanadu) compilation and simulation framework are discussed, along with its time profiling, and time implications on computationally significant problem sizes. Last, a compilation step to reduce the hardware description complexity is presented, demonstrating a linear reduction on the overall number of operators when the number of Gaussian operators increases.

The Journal of Supercomputing•Feb 10, 2023•1 citation

Quantum simulation with just-in-time compilation

Stavros Efthymiou, Marco Lazzarin, Andrea Pasquale +1 more

Quantum technologies are moving towards the development of novel hardware devices based on quantum bits (qubits). In parallel to the development of quantum devices, efficient simulation tools are needed in order to design and benchmark quantum algorithms and applications before deployment on quantum hardware. In this context, we present a first attempt to perform circuit-based quantum simulation using the just-in-time (JIT) compilation technique on multiple hardware architectures and configurations based on single-node central processing units (CPUs) and graphics processing units (GPUs). One of the major challenges in scientific code development is to balance the level of complexity between algorithms and programming techniques without losing performance or degrading code readability. In this context, we have developed qibojit : a new module for the Qibo quantum computing framework, which uses a just-in-time compilation approach through Python. We perform systematic performance benchmarks between our JIT approach and a subset of relevant publicly available libraries for quantum computing. We show that our novel approach simplifies the complex aspects of the implementation without deteriorating performance.

arXiv:2203.08826•Quantum•Sep 22, 2022•34 citations

Quantum Machine Learning: continuous-variable approach with application to Neural Networks

Valeria Encin

The work presented in this thesis is focused on quantum computing and in particular on the interplay between quantum devices and machine learning. This interaction gives birth to a relatively recent area of study, called Quantum Machine Learning (QML), which currently represents a hot research field. This work was carried out in collaboration with an important company with home in Turin, DATA Reply S.r.l., whose main focuses are Big Data, Artificial Intelligence, Machine Learning and Quantum Computing. We start by introducing the fundamental concepts of quantum mechanics, presenting the topic in a formal way from a mathematical point of view while keeping things as simple as possible, as long as they allow us to understand quantum computing basics. After an overview on motivations, possible employments of quantum devices and an analysis of risks and benefits of their development, we proceed to explain quantum computing main concepts, such as qubits and quantum gates. The introduced formalism is the so-called Discrete Variable (DV) formalism, which is the most prominent choice in literature for describing quantum systems. However, as extensively explained during the course of this work, this approach presents several drawbacks: one of the main goals of this thesis is to introduce the alternative formalism of Continuous Variables (CV) and investigate how it can contribute to improve this research area. Currently, one of the preferred tools for quantum machine learning algorithms are the Variational - or Parametrized - circuits: they allow to train the quantum devices in the same way as a classical neural network and allow to address ML problems, both supervised and unsupervised. After a detailed description of these tools, we proceed to introduce PennyLane, a Python library for QML which is very well suited for dealing with variational circuits. In the core part of this work, we concentrate on some QML examples, in particular we analyze some applications in which using the CV formalism turns out to be the most convenient choice. Integration, more specifically Monte Carlo integration, is one of those fields which the CV formalism suits best; in a similar way, Gaussian process regression in its continuous variables version provides a great advantage, namely an exponential speedup, as long as some hypothesis are satisfied. We only provide a brief overview of these applications, since we opted to leave more room to experiments involving variational classifiers and quantum neural networks. Three use cases are analyzed, all involving the CV formalism. The first one is a variational classifier, employed in a supervised setting for the classification of a simple dataset. The second one is a quantum neural network, used to solve a problem of function fitting. The results and the chosen hyperparameters are presented, together with a formal explanation of the theoretical concepts behind them. The last use case, the most complex and detailed one, focuses on a time series forecasting task, carried out with a quantum neural network, and also presents a comparison with the classical approach.

•Oct 6, 2020•2 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
In recent years quantum computing has evolved from a research concept subject to reality. Companies and scientists around the world are creating physical quantum systems using different quantum technologies to advance the field. Although most of this focus is on superconducting, qubit-based implementations, recently there has been work in the development of boson-based quantum computers. The basic processing unit for these devices are continuous variable (CV), multi-photonic modes in Gaussian states. Due to the novel nature of this technology there is a lack of work on analyzing the compilation process of current photonic devices. One of the leading companies in this field developed a cross-platform Python library for simulating and executing programs on quantum photonic hardware, Strawberry Fields (SF). This paper will focus on analyzing the SF compilers, and proposing an additional compilation step that will enable future, more flexible hardware implementations.
We introduce Strawberry Fields, an open-source quantum programming architecture for light-based quantum computers, and detail its key features. Built in Python, Strawberry Fields is a full-stack library for design, simulation, optimization, and quantum machine learning of continuous-variable circuits. The platform consists of three main components: (i) an API for quantum programming based on an easy-to-use language named Blackbird; (ii) a suite of three virtual quantum computer backends, built in NumPy and TensorFlow, each targeting specialized uses; and (iii) an engine which can compile Blackbird programs on various backends, including the three built-in simulators, and - in the near future - photonic quantum information processors. The library also contains examples of several paradigmatic algorithms, including teleportation, (Gaussian) boson sampling, instantaneous quantum polynomial, Hamiltonian simulation, and variational quantum circuit optimization.
This paper presents a novel approach to the K-Means clustering algorithm using continuous variable (CV) quantum computing, specifically leveraging Gaussian states on quantum photonic hardware. We implement the algorithm uti-lizing Strawberry Fields, a platform for simulating and executing photonic quantum computations. The theoretical framework integrates Gaussian state preparation, quantum interference, and homodyne detection to perform the clustering tasks. We evaluate the performance of the CV quantum K-Means algorithm on var-ious datasets, focusing on clustering accuracy and compactness compared to classical K-Means. Our findings provide valuable insights into the potential of using CV quantum methods for clustering and highlight the feasibility of CV quantum algorithms in machine learning. These results suggest promising directions for future research to further enhance their performance.
Abstract Gaussian Boson Sampling is gaining relevance among the multiple technologies currently implementing quantum computing. The problem of sampling out of a boson distribution across multiple modes has a strong mathematical connection with combinatorics problems, with multiple practical applications that would classically be unfeasible to solve within reasonable time. The software stack that accompanies this GBS approach, and that takes the application from its high level description to the hardware implementation, is the main focus of this paper. The general compilation process of Gaussian Boson Samplers is described in detail. The specifics of the Strawberry Fields (Xanadu) compilation and simulation framework are discussed, along with its time profiling, and time implications on computationally significant problem sizes. Last, a compilation step to reduce the hardware description complexity is presented, demonstrating a linear reduction on the overall number of operators when the number of Gaussian operators increases.
Quantum technologies are moving towards the development of novel hardware devices based on quantum bits (qubits). In parallel to the development of quantum devices, efficient simulation tools are needed in order to design and benchmark quantum algorithms and applications before deployment on quantum hardware. In this context, we present a first attempt to perform circuit-based quantum simulation using the just-in-time (JIT) compilation technique on multiple hardware architectures and configurations based on single-node central processing units (CPUs) and graphics processing units (GPUs). One of the major challenges in scientific code development is to balance the level of complexity between algorithms and programming techniques without losing performance or degrading code readability. In this context, we have developed qibojit : a new module for the Qibo quantum computing framework, which uses a just-in-time compilation approach through Python. We perform systematic performance benchmarks between our JIT approach and a subset of relevant publicly available libraries for quantum computing. We show that our novel approach simplifies the complex aspects of the implementation without deteriorating performance.
The work presented in this thesis is focused on quantum computing and in particular on the interplay between quantum devices and machine learning. This interaction gives birth to a relatively recent area of study, called Quantum Machine Learning (QML), which currently represents a hot research field. This work was carried out in collaboration with an important company with home in Turin, DATA Reply S.r.l., whose main focuses are Big Data, Artificial Intelligence, Machine Learning and Quantum Computing. We start by introducing the fundamental concepts of quantum mechanics, presenting the topic in a formal way from a mathematical point of view while keeping things as simple as possible, as long as they allow us to understand quantum computing basics. After an overview on motivations, possible employments of quantum devices and an analysis of risks and benefits of their development, we proceed to explain quantum computing main concepts, such as qubits and quantum gates. The introduced formalism is the so-called Discrete Variable (DV) formalism, which is the most prominent choice in literature for describing quantum systems. However, as extensively explained during the course of this work, this approach presents several drawbacks: one of the main goals of this thesis is to introduce the alternative formalism of Continuous Variables (CV) and investigate how it can contribute to improve this research area. Currently, one of the preferred tools for quantum machine learning algorithms are the Variational - or Parametrized - circuits: they allow to train the quantum devices in the same way as a classical neural network and allow to address ML problems, both supervised and unsupervised. After a detailed description of these tools, we proceed to introduce PennyLane, a Python library for QML which is very well suited for dealing with variational circuits. In the core part of this work, we concentrate on some QML examples, in particular we analyze some applications in which using the CV formalism turns out to be the most convenient choice. Integration, more specifically Monte Carlo integration, is one of those fields which the CV formalism suits best; in a similar way, Gaussian process regression in its continuous variables version provides a great advantage, namely an exponential speedup, as long as some hypothesis are satisfied. We only provide a brief overview of these applications, since we opted to leave more room to experiments involving variational classifiers and quantum neural networks. Three use cases are analyzed, all involving the CV formalism. The first one is a variational classifier, employed in a supervised setting for the classification of a simple dataset. The second one is a quantum neural network, used to solve a problem of function fitting. The results and the chosen hyperparameters are presented, together with a formal explanation of the theoretical concepts behind them. The last use case, the most complex and detailed one, focuses on a time series forecasting task, carried out with a quantum neural network, and also presents a comparison with the classical approach.
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.