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

Bulletin of the American Physical Society

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

Yu Chuan Zheng, Oliver Hahn, Pascal Stadler, Patric Holmvall, Isaac Quijandria Diaz, Alessandro Ferraro, Giulia Ferrini

Published Jun 2, 2021• 0 citations
OpenAlex

Related papers

Interplay of resources for universal continuous-variable quantum computing

Varun Upreti, Ulysse Chabaud

Quantum resource theories identify the features of quantum computers that provide their computational advantage over classical systems. We investigate the resources driving the complexity of classical simulation in the standard model of continuous-variable quantum computing, and their interplay enabling computational universality. Specifically, we uncover a new property in continuous-variable circuits, analogous to coherence in discrete-variable systems, termed , defined as the ability of Gaussian gates to mix position and momentum operators. Using quadrature propagation across multiple computational paths, we develop an efficient classical simulation algorithm for continuous-variable computations with symplectic coherence constant in the size of the circuit. This establishes symplectic coherence as a necessary resource for universality in continuous-variable quantum computing, alongside non-Gaussianity and entanglement. Via the Gottesman-Kitaev-Preskill encoding, we show that the interplay of these three continuous-variable quantum resources mirrors the discrete-variable relationship between coherence, magic, and entanglement.

arXiv:2502.07670•Physical Review Research•Jun 26, 2026•13 citations

Quantum Computation with Continuous-Variable Systems

Takaya Matsuura

Springer theses•Jan 1, 2023•0 citations

A continuous variable Born machine

Ieva Čepaitė, Brian Coyle, Elham Kashefi

Abstract Generative modelling has become a promising use case for near-term quantum computers. Due to the fundamentally probabilistic nature of quantum mechanics, quantum computers naturally model and learn probability distributions, perhaps more efficiently than can be achieved classically. The quantum circuit Born machine is an example of such a model, easily implemented on near-term quantum computers. However, the Born machine was originally defined to naturally represent discrete distributions. Since probability distributions of a continuous nature are commonplace in the world, it is essential to have a model which can efficiently represent them. Some proposals have been made in the literature to supplement the discrete Born machine with extra features to more easily learn continuous distributions; however, all invariably increase the resources required. In this work, we discuss the continuous variable Born machine, built on the alternative architecture of continuous variable quantum computing, which is much more suitable for modelling such distributions in a resource-minimal way. We provide numerical results indicating the model’s ability to learn both quantum and classical continuous distributions, including in the presence of noise.

arXiv:2011.00904•Quantum Machine Intelligence•Mar 15, 2022•18 citations

Continuous-Variable Quantum Computing and its Applications to Cryptography

Do Ngoc Diep, Koji Nagata, Renata Wong

International Journal of Theoretical Physics•Aug 22, 2020•8 citations

Continuous-variable quantum computing and its applications to cryptography

Koji Nagata, Do Ngoc Diep, Ahmed Farouk +1 more

Institute of Physics eBooks•Jul 1, 2022•0 citations

Continuous-variable quantum computing: scalable designs and fault tolerance

Nicolas C. Menicucci

One of the biggest challenges to a viable quantum computer with real-world impact is scaling it up to handle large computations. Continuous-variable (CV) cluster states, which are resource states for measurement-based quantum computation, can be made on a vast scale with minimal experimental resources. I will present recent experimental breakthroughs in producing large-scale CV cluster states, and I will illustrate how to use these states for fault-tolerant quantum computation.

Photonics for Quantum (PfQ)•Aug 27, 2021•0 citations
Quantum resource theories identify the features of quantum computers that provide their computational advantage over classical systems. We investigate the resources driving the complexity of classical simulation in the standard model of continuous-variable quantum computing, and their interplay enabling computational universality. Specifically, we uncover a new property in continuous-variable circuits, analogous to coherence in discrete-variable systems, termed , defined as the ability of Gaussian gates to mix position and momentum operators. Using quadrature propagation across multiple computational paths, we develop an efficient classical simulation algorithm for continuous-variable computations with symplectic coherence constant in the size of the circuit. This establishes symplectic coherence as a necessary resource for universality in continuous-variable quantum computing, alongside non-Gaussianity and entanglement. Via the Gottesman-Kitaev-Preskill encoding, we show that the interplay of these three continuous-variable quantum resources mirrors the discrete-variable relationship between coherence, magic, and entanglement.
Abstract Generative modelling has become a promising use case for near-term quantum computers. Due to the fundamentally probabilistic nature of quantum mechanics, quantum computers naturally model and learn probability distributions, perhaps more efficiently than can be achieved classically. The quantum circuit Born machine is an example of such a model, easily implemented on near-term quantum computers. However, the Born machine was originally defined to naturally represent discrete distributions. Since probability distributions of a continuous nature are commonplace in the world, it is essential to have a model which can efficiently represent them. Some proposals have been made in the literature to supplement the discrete Born machine with extra features to more easily learn continuous distributions; however, all invariably increase the resources required. In this work, we discuss the continuous variable Born machine, built on the alternative architecture of continuous variable quantum computing, which is much more suitable for modelling such distributions in a resource-minimal way. We provide numerical results indicating the model’s ability to learn both quantum and classical continuous distributions, including in the presence of noise.