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

Realization of elementary operations for continuous-variable quantum computers

Freyja Ullinger, Rudi B. P. Pietsch, Alexander Sauer, Matthias Zimmermann

Published Jan 17, 2024• 0 citations
OpenAlex

Abstract

Continuous-variable quantum computers encode information and perform calculations based on continuous degrees of freedoms, such as e.g. position or momentum. In this case, the elementary logical gates are characterized by continuous transformations such as displacement, rotation and shearing[1,2]. However, the implementation of these gates is limited to the experimentally available operations to manipulate continuous quantum states. Therefore, it is necessary to develop schemes that are applicable in a variety of physical systems. In this poster, we present a representation-free theory to realize the displacement, rotation and shearing operator for particles with non-vanishing mass. Our method is solely based on the application of linear and quadratic potentials that either act instantaneously or for a finite period of time, which makes our approach versatile for various continuous quantum systems. [1] S. L. Braunstein and A. K. Pati, Quantum Information with Continuous Variables (Kluwer Academic Publishers, Dordrecht, The Netherlands, 2003). [2] S. L. Braunstein and P. van Loock, Rev. Mod. Phys. 77, 513 (2005).

Related papers

Quantum computation using q-deformedcoherent states

Aswathy Raj

Continuous variables have played an important role in quantum information processing and communication (QIPC) with light, due to the highly efficient method of Homodyne detection. This provides a method to directly access the canonical variables of light. Here we have reviewed the paper Quantum computation with optical coherent states [T. C. Ralph, A. Gilchrist, and G. J. Milburn, Phys. Rev. A 68, 042319 (2003)], where coherent states |α> and |-α> is considered as logical qubits. Using these coherent states, they have implemented the universal logic gates by the techniques of linear optics. By following their method, we have now obtained the Bit-flip operator for more generalized q-deformed coherent states, where we have considered |α>q and |-α>q as logical qubits. Thus coherent state will be a limiting case of q-deformed coherent state and we can recover it in the limit when q tends to one. q-deformed phase rotation gate using the technique of q-deformed displacement operator is on progress because we need to understand the properties of the non-commutative quantum plane to proceed it further. We will be looking forward to finding the other q-deformed logic gates and we have to understand the advantage of q-deformed logic gates over the logic gates for coherent states.

•Apr 1, 2018•0 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

Universal Quantum Computing with Arbitrary Continuous-Variable Encoding

Hoi-Kwan Lau, Martin Bodo Plenio

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap tests. Our formalism inherits the advantages that the quantum information is decoupled from collective noise, and logical qubits with different encodings can be brought to interact without decoding. We also propose a possible implementation of the required operations by using interactions that are available in a variety of continuous-variable systems. Our work separates the "hardware" problem of engineering quantum-computing-universal interactions, from the "software" problem of designing encodings for specific purposes. The development of quantum computer architecture could hence be simplified.

arXiv:1605.09278•Physical Review Letters•Aug 31, 2016•62 citations

The Quantum Fourier Transform for Continuous Variables

Gianfranco Cariolaro, Edi Ruffa, Amir Mohammad Yaghoobianzadeh +1 more

The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two elementary components: the Hadamard gate and the controlled--phase gate. In this paper, the quantum Fourier transform operating with continuous variables (cvQFT) is considered. Thus, the environment becomes the Hilbert space, where the natural definition of the cvQFT will be related to rotation operators, which in the $N$--mode are completely specified by unitary matrices of order $N$. Then the cvQFT is defined as the rotation operator whose rotation matrix is given by the discrete Fourier transform (DFT) matrix. For the implementation of rotation operators with primitive components (single--mode rotations and beam splitters), we follow the well known Murnaghan procedure, with appropriate modifications. Moreover, algorithms related to the fast Fourier transform (FFT) are applied to reduce drastically the implementation complexity. The final part is concerned with the application of the cvQFT to general Gaussian states. In particular, we show that cvQFT has the simple effect of transforming the displacement vector by a one-dimensional DFT, the squeeze matrix by a two-dimensional DFT, and the rotation matrix by a Fourier-like similarity transform.

quant-pharXiv:2512.12771•Dec 16, 2025•0 citations

Solving Differential Equations via Continuous-Variable Quantum Computers

Knudsen, Martin, Christian B. Mendl

We explore how a continuous-variable (CV) quantum computer could solve a classic differential equation, making use of its innate capability to represent real numbers in qumodes. Specifically, we construct variational CV quantum circuits [Killoran et al., Phys.~Rev.~Research 1, 033063 (2019)] to approximate the solution of one-dimensional ordinary differential equations (ODEs), with input encoding based on displacement gates and output via measurement averages. Our simulations and parameter optimization using the PennyLane / Strawberry Fields framework demonstrate good convergence for both linear and non-linear ODEs.

arXiv:2012.12220•Dec 22, 2020•19 citations

Charakterisierung und Messung der Eigenschaften von Quantenzuständen mit kontinuierlichen Variablen

Matthias Ohliger

We investigate properties of quantum mechanical systems in the light of quantum information theory. We put an emphasize on systems with infinite-dimensional Hilbert spaces, so-called continuous-variable systems'', which are needed to describe quantum optics beyond the single photon regime and other Bosonic quantum systems. We present methods to obtain a description of such systems from a series of measurements in an efficient manner and demonstrate the performance in realistic situations by means of numerical simulations. We consider both unconditional quantum state tomography, which is applicable to arbitrary systems, and tomography of matrix product states. The latter allows for the tomography of many-body systems because the necessary number of measurements scales merely polynomially with the particle number, compared to an exponential scaling in the generic case. We also present a method to realize such a tomography scheme for a system of ultra-cold atoms in optical lattices. Furthermore, we discuss in detail the possibilities and limitations of using continuous-variable systems for measurement-based quantum computing. We will see that the distinction between Gaussian and non-Gaussian quantum states and measurements plays an crucial role. We also provide an algorithm to solve the large and interesting class of naturally occurring Hamiltonians, namely frustration free ones, efficiently and use this insight to obtain a simple approximation method for slightly frustrated systems. To achieve this goals, we make use of, among various other techniques, the well developed theory of matrix product states, tensor networks, semi-definite programming, and matrix analysis.

•Dec 17, 2012•0 citations
Continuous-variable quantum computers encode information and perform calculations based on continuous degrees of freedoms, such as e.g. position or momentum. In this case, the elementary logical gates are characterized by continuous transformations such as displacement, rotation and shearing[1,2]. However, the implementation of these gates is limited to the experimentally available operations to manipulate continuous quantum states. Therefore, it is necessary to develop schemes that are applicable in a variety of physical systems. In this poster, we present a representation-free theory to realize the displacement, rotation and shearing operator for particles with non-vanishing mass. Our method is solely based on the application of linear and quadratic potentials that either act instantaneously or for a finite period of time, which makes our approach versatile for various continuous quantum systems. [1] S. L. Braunstein and A. K. Pati, Quantum Information with Continuous Variables (Kluwer Academic Publishers, Dordrecht, The Netherlands, 2003). [2] S. L. Braunstein and P. van Loock, Rev. Mod. Phys. 77, 513 (2005).
Continuous variables have played an important role in quantum information processing and communication (QIPC) with light, due to the highly efficient method of Homodyne detection. This provides a method to directly access the canonical variables of light. Here we have reviewed the paper Quantum computation with optical coherent states [T. C. Ralph, A. Gilchrist, and G. J. Milburn, Phys. Rev. A 68, 042319 (2003)], where coherent states |α> and |-α> is considered as logical qubits. Using these coherent states, they have implemented the universal logic gates by the techniques of linear optics. By following their method, we have now obtained the Bit-flip operator for more generalized q-deformed coherent states, where we have considered |α>q and |-α>q as logical qubits. Thus coherent state will be a limiting case of q-deformed coherent state and we can recover it in the limit when q tends to one. q-deformed phase rotation gate using the technique of q-deformed displacement operator is on progress because we need to understand the properties of the non-commutative quantum plane to proceed it further. We will be looking forward to finding the other q-deformed logic gates and we have to understand the advantage of q-deformed logic gates over the logic gates for coherent states.
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.
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap tests. Our formalism inherits the advantages that the quantum information is decoupled from collective noise, and logical qubits with different encodings can be brought to interact without decoding. We also propose a possible implementation of the required operations by using interactions that are available in a variety of continuous-variable systems. Our work separates the "hardware" problem of engineering quantum-computing-universal interactions, from the "software" problem of designing encodings for specific purposes. The development of quantum computer architecture could hence be simplified.
The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two elementary components: the Hadamard gate and the controlled--phase gate. In this paper, the quantum Fourier transform operating with continuous variables (cvQFT) is considered. Thus, the environment becomes the Hilbert space, where the natural definition of the cvQFT will be related to rotation operators, which in the NNN--mode are completely specified by unitary matrices of order NNN. Then the cvQFT is defined as the rotation operator whose rotation matrix is given by the discrete Fourier transform (DFT) matrix. For the implementation of rotation operators with primitive components (single--mode rotations and beam splitters), we follow the well known Murnaghan procedure, with appropriate modifications. Moreover, algorithms related to the fast Fourier transform (FFT) are applied to reduce drastically the implementation complexity. The final part is concerned with the application of the cvQFT to general Gaussian states. In particular, we show that cvQFT has the simple effect of transforming the displacement vector by a one-dimensional DFT, the squeeze matrix by a two-dimensional DFT, and the rotation matrix by a Fourier-like similarity transform.
We explore how a continuous-variable (CV) quantum computer could solve a classic differential equation, making use of its innate capability to represent real numbers in qumodes. Specifically, we construct variational CV quantum circuits [Killoran et al., Phys.~Rev.~Research 1, 033063 (2019)] to approximate the solution of one-dimensional ordinary differential equations (ODEs), with input encoding based on displacement gates and output via measurement averages. Our simulations and parameter optimization using the PennyLane / Strawberry Fields framework demonstrate good convergence for both linear and non-linear ODEs.
We investigate properties of quantum mechanical systems in the light of quantum information theory. We put an emphasize on systems with infinite-dimensional Hilbert spaces, so-called continuous-variable systems'', which are needed to describe quantum optics beyond the single photon regime and other Bosonic quantum systems. We present methods to obtain a description of such systems from a series of measurements in an efficient manner and demonstrate the performance in realistic situations by means of numerical simulations. We consider both unconditional quantum state tomography, which is applicable to arbitrary systems, and tomography of matrix product states. The latter allows for the tomography of many-body systems because the necessary number of measurements scales merely polynomially with the particle number, compared to an exponential scaling in the generic case. We also present a method to realize such a tomography scheme for a system of ultra-cold atoms in optical lattices. Furthermore, we discuss in detail the possibilities and limitations of using continuous-variable systems for measurement-based quantum computing. We will see that the distinction between Gaussian and non-Gaussian quantum states and measurements plays an crucial role. We also provide an algorithm to solve the large and interesting class of naturally occurring Hamiltonians, namely frustration free ones, efficiently and use this insight to obtain a simple approximation method for slightly frustrated systems. To achieve this goals, we make use of, among various other techniques, the well developed theory of matrix product states, tensor networks, semi-definite programming, and matrix analysis.