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

Continuous-Variable Quantum Computation of Oracle Decision Problems

Mark Adcock

Published Jan 1, 2012• 1 citation
Publisher

Abstract

Quantum information processing is appealing due its ability to solve certain problems quantitatively faster than classical information processing. Most quantum algorithms have been studied in discretely parameterized systems, but many quantum systems are continuously parameterized. The field of quantum optics in particular has sophisticated techniques for manipulating continuously parameterized quantum states of light, but the lack of a code-state formalism has hindered the study of quantum algorithms in these systems. To address this situation, a code-state formalism for the solution of oracle decision problems in continuously-parameterized quantum systems is developed. In discrete-variable quantum computation, oracle decision problems exploit quantum parallelism through the use of the Hadamard transform. The challenge in continuous-variable quantum computation is to exploit similar quantum parallelism by generalizing the Hadamard transform to the continuous Fourier transform while avoiding non-renormalizable states. This straightforward relationship between the operators in the discrete and continuous settings make oracle decision problems the ideal test-bed. However, as the formalism results in a representation of discrete information strings as proper code states, the approach also allows for the study of a wider range of quantum algorithms in continuously-parameterized quantum systems having both finite- and infinite-dimensional Hilbert spaces. In the infinite-dimensional case, we study continuous-variable quantum algorithms for the solution of the Deutsch--Jozsa oracle decision problem implemented within a single harmonic-oscillator. Orthogonal states are used as the computational bases, and we show that, contrary to a previous claim in the literature, this implementation of quantum information processing has limitations due to a position-momentum trade-off of the Fourier transform. We further demonstrate that orthogonal encoding bases are not unique, and using the coherent states of the harmonic oscillator as the computational bases, our formalism enables quantifying the relative performances of different choices of the encoding bases. We extend our formalism to include quantum algorithms in the continuously parameterized yet finite-dimensional Hilbert space of a coherent spin system. We show that the highest-squeezed spin state possible can be approximated by a superposition of two states thus transcending the usual model of using a single basis state as algorithm input. As a particular example, we show that the close Hadamard oracle-decision problem, which is related to the Hadamard codewords of digital communications theory, can be solved quantitatively more efficiently using this computational model than by any known classical algorithm.

DOI
10.11575/prism/25442

Related papers

Limitations on continuous variable quantum algorithms with Fourier transforms

Mark Adcock, Peter Høyer, Barry C. Sanders

We study quantum algorithms implemented within a single harmonic oscillator, or equivalently within a single mode of the electromagnetic field. Logical states correspond to functions of the canonical position, and the Fourier transform to canonical momentum serves as the analogue of the Hadamard transform for this implementation. This continuous variable version of quantum information processing has widespread appeal because of advanced quantum optics technology that can create, manipulate and read Gaussian states of light. We show that, contrary to a previous claim, this implementation of quantum information processing has limitations due to a position–momentum trade-off of the Fourier transform, analogous to the famous time-bandwidth theorem of signal processing.

arXiv:0812.3694•New Journal of Physics•Oct 21, 2009•37 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

Hybrid and optical implementation of the Deutsch-Jozsa algorithm

Garcia, Luis A., Jagdish R. Luthra

A hybrid model of the Deutsch-Jozsa algorithm is presented, inspired by the proposals of hybrid computation by S. Lloyd and P. van Loock et. al. The model is based on two observations made about both the discrete and continuous algorithms already available. First, the Fourier transform is a single-step operation in a continuous-variable (CV) setting. Additionally, any implementation of the oracle is nontrivial in both schemes. The steps of the computation are very similar to those in the CV algorithm, with the main difference being the way in which the qunats, or quantum units of analogic information, and the qubits interact in the oracle. Using both discrete and continuous states of light, linear devices, and photo-detection, an optical implementation of the oracle is proposed. For simplicity, infinitely squeezed states are used in the continuous register, whereas the optical qubit is encoded in the dual-rail logic of the KLM protocol. The initial assumption of ideal states as qunats will be dropped to study the effects of finite squeezing in the quality of the computation.

arXiv:1001.0187•Dec 31, 2009•0 citations

Efficient Qubit Simulation of Hybrid Oscillator-Qubit Quantum Computation

Xi Lu, Bojko N. Bakalov, Yuan Liu

We introduce a framework for simulating hybrid oscillator-qubit quantum processors on qubit-only systems through position encoding. By encoding continuous-variable position and momentum wave functions into qubit amplitudes, our method efficiently simulates all Gaussian and conditional Gaussian operations -- encompassing the phase-space instruction set (beam splitter, single-qubit rotation, conditional displacement) and extending to squeezing, conditional squeezing, conditional rotation, and conditional beam splitter -- using $O\!\left(\log^2\!\left(Γ+ \log(1/ε)\right)\right)$ qubit gates per hybrid gate, where $Γ$ is the Fock-level bound and $ε$ is the target precision. This polylogarithmic per-gate complexity represents an exponential improvement over Fock basis encoding approaches, which require exponential quantum or classical resources in the number of qubits per mode. We provide rigorous numerical characterization of quantum Fourier transform errors for Fock-bounded states, enabling precise resource estimation for practical implementations. This work establishes that hybrid oscillator-qubit algorithms can be implemented on qubit processors with polynomial overhead, providing new insights into the computational power trade-offs between discrete-variable and hybrid continuous-discrete-variable quantum computing.

quant-pharXiv:2603.09233•Mar 11, 2026•0 citations

The continuous-variable Deutsch–Jozsa algorithm using realistic quantum systems

Rob C. Wagner, Viv M. Kendon

This paper is a study of the continuous-variable Deutsch–Jozsa algorithm. First, we review an existing version of the algorithm for qunat states (Pati and Braunstein 2002 arXiv:0207108v1), and then, we present a realistic version of the Deutsch–Jozsa algorithm for continuous variables, which can be implemented in a physical quantum system given the appropriate oracle. Under these conditions, we have a probabilistic algorithm for deciding the function with a very high success rate with a single call to the oracle. Finally, we look at the effects of errors in both of these continuous-variable algorithms and how they affect the chances of success. We find that the algorithm is generally robust for errors in initialization and the oracle, but less so for errors in the measurement apparatus and the Fourier transform. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to 'Coherent states: mathematical and physical aspects'.

Journal of Physics A Mathematical and Theoretical•May 30, 2012•4 citations

Quantum computation with harmonic oscillators

Stephen D. Bartlett, Barry C. Sanders, Hubert de Guise

Summary form only given. The use of continuous-variable (CV) quantum computing allows information to be encoded and processed much more compactly and efficiently than with discrete-variable (qubit) computing. That is, with CV realizations, one can perform quantum information processes using fewer coupled quantum systems: a considerable advantage for the experimental realization of quantum computing. As a result, CV quantum information theory is of interest in quantum error correction, quantum cryptography and quantum teleportation. For example, quantum teleportation has recently been tested experimentally in the CV domain. The current proposed realization of CV quantum computation employs position eigenstates as a computational basis; these states are approximated in experiment using highly squeezed states. We introduce new CV representations, where the generalized Pauli group is generated by the number and phase operators for harmonic oscillators, and the computational basis is given by either harmonic oscillator energy eigenstates or phase eigenstates.

Quantum Electronics and Laser Science Conference•Nov 13, 2002•3 citations
Quantum information processing is appealing due its ability to solve certain problems quantitatively faster than classical information processing. Most quantum algorithms have been studied in discretely parameterized systems, but many quantum systems are continuously parameterized. The field of quantum optics in particular has sophisticated techniques for manipulating continuously parameterized quantum states of light, but the lack of a code-state formalism has hindered the study of quantum algorithms in these systems. To address this situation, a code-state formalism for the solution of oracle decision problems in continuously-parameterized quantum systems is developed. In discrete-variable quantum computation, oracle decision problems exploit quantum parallelism through the use of the Hadamard transform. The challenge in continuous-variable quantum computation is to exploit similar quantum parallelism by generalizing the Hadamard transform to the continuous Fourier transform while avoiding non-renormalizable states. This straightforward relationship between the operators in the discrete and continuous settings make oracle decision problems the ideal test-bed. However, as the formalism results in a representation of discrete information strings as proper code states, the approach also allows for the study of a wider range of quantum algorithms in continuously-parameterized quantum systems having both finite- and infinite-dimensional Hilbert spaces. In the infinite-dimensional case, we study continuous-variable quantum algorithms for the solution of the Deutsch--Jozsa oracle decision problem implemented within a single harmonic-oscillator. Orthogonal states are used as the computational bases, and we show that, contrary to a previous claim in the literature, this implementation of quantum information processing has limitations due to a position-momentum trade-off of the Fourier transform. We further demonstrate that orthogonal encoding bases are not unique, and using the coherent states of the harmonic oscillator as the computational bases, our formalism enables quantifying the relative performances of different choices of the encoding bases. We extend our formalism to include quantum algorithms in the continuously parameterized yet finite-dimensional Hilbert space of a coherent spin system. We show that the highest-squeezed spin state possible can be approximated by a superposition of two states thus transcending the usual model of using a single basis state as algorithm input. As a particular example, we show that the close Hadamard oracle-decision problem, which is related to the Hadamard codewords of digital communications theory, can be solved quantitatively more efficiently using this computational model than by any known classical algorithm.
We study quantum algorithms implemented within a single harmonic oscillator, or equivalently within a single mode of the electromagnetic field. Logical states correspond to functions of the canonical position, and the Fourier transform to canonical momentum serves as the analogue of the Hadamard transform for this implementation. This continuous variable version of quantum information processing has widespread appeal because of advanced quantum optics technology that can create, manipulate and read Gaussian states of light. We show that, contrary to a previous claim, this implementation of quantum information processing has limitations due to a position–momentum trade-off of the Fourier transform, analogous to the famous time-bandwidth theorem of signal processing.
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.
A hybrid model of the Deutsch-Jozsa algorithm is presented, inspired by the proposals of hybrid computation by S. Lloyd and P. van Loock et. al. The model is based on two observations made about both the discrete and continuous algorithms already available. First, the Fourier transform is a single-step operation in a continuous-variable (CV) setting. Additionally, any implementation of the oracle is nontrivial in both schemes. The steps of the computation are very similar to those in the CV algorithm, with the main difference being the way in which the qunats, or quantum units of analogic information, and the qubits interact in the oracle. Using both discrete and continuous states of light, linear devices, and photo-detection, an optical implementation of the oracle is proposed. For simplicity, infinitely squeezed states are used in the continuous register, whereas the optical qubit is encoded in the dual-rail logic of the KLM protocol. The initial assumption of ideal states as qunats will be dropped to study the effects of finite squeezing in the quality of the computation.
We introduce a framework for simulating hybrid oscillator-qubit quantum processors on qubit-only systems through position encoding. By encoding continuous-variable position and momentum wave functions into qubit amplitudes, our method efficiently simulates all Gaussian and conditional Gaussian operations -- encompassing the phase-space instruction set (beam splitter, single-qubit rotation, conditional displacement) and extending to squeezing, conditional squeezing, conditional rotation, and conditional beam splitter -- using O ⁣(log⁡2 ⁣(Γ+log⁡(1/ε)))O\!\left(\log^2\!\left(Γ+ \log(1/ε)\right)\right)O(log2(Γ+log(1/ε))) qubit gates per hybrid gate, where ΓΓΓ is the Fock-level bound and εεε is the target precision. This polylogarithmic per-gate complexity represents an exponential improvement over Fock basis encoding approaches, which require exponential quantum or classical resources in the number of qubits per mode. We provide rigorous numerical characterization of quantum Fourier transform errors for Fock-bounded states, enabling precise resource estimation for practical implementations. This work establishes that hybrid oscillator-qubit algorithms can be implemented on qubit processors with polynomial overhead, providing new insights into the computational power trade-offs between discrete-variable and hybrid continuous-discrete-variable quantum computing.
This paper is a study of the continuous-variable Deutsch–Jozsa algorithm. First, we review an existing version of the algorithm for qunat states (Pati and Braunstein 2002 arXiv:0207108v1), and then, we present a realistic version of the Deutsch–Jozsa algorithm for continuous variables, which can be implemented in a physical quantum system given the appropriate oracle. Under these conditions, we have a probabilistic algorithm for deciding the function with a very high success rate with a single call to the oracle. Finally, we look at the effects of errors in both of these continuous-variable algorithms and how they affect the chances of success. We find that the algorithm is generally robust for errors in initialization and the oracle, but less so for errors in the measurement apparatus and the Fourier transform. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to 'Coherent states: mathematical and physical aspects'.
Summary form only given. The use of continuous-variable (CV) quantum computing allows information to be encoded and processed much more compactly and efficiently than with discrete-variable (qubit) computing. That is, with CV realizations, one can perform quantum information processes using fewer coupled quantum systems: a considerable advantage for the experimental realization of quantum computing. As a result, CV quantum information theory is of interest in quantum error correction, quantum cryptography and quantum teleportation. For example, quantum teleportation has recently been tested experimentally in the CV domain. The current proposed realization of CV quantum computation employs position eigenstates as a computational basis; these states are approximated in experiment using highly squeezed states. We introduce new CV representations, where the generalized Pauli group is generated by the number and phase operators for harmonic oscillators, and the computational basis is given by either harmonic oscillator energy eigenstates or phase eigenstates.