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

arXiv:1001.0187

Hybrid and optical implementation of the Deutsch-Jozsa algorithm

Garcia, Luis A., Jagdish R. Luthra

Published Dec 31, 2009• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1001.0187

Related papers

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

Continuous-Variable Quantum Computation of Oracle Decision Problems

Mark Adcock

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.

•Jan 1, 2012•1 citation

Quantum computation with continuous variables

Pieter Kok, Brendon W. Lovett

In the previous chapter we have discussed some important quantum information processing techniques based on continuous variables, or ‘qunats’. In this chapter, we describe methods for extending these techniques to quantum computation with optical qunats. We will first show in Section 9.1 how the optical qunat states are initialized using single-mode squeezing, and we give optical implementations of some of the most important single-qunat gates, such as the Heisenberg-Weyl operators and the Fourier transform. In Section 9.2, we study the theory of two-mode Gaussian operations, and we construct a general optical circuit that can implement any two-mode Gaussian operation. In Section 9.3, we introduce the stabilizer formalism for qunats, and use it to derive a Gottesman-Knill theorem. This leads to the general requirement of nonlinear gates for qunats, and their optical implementation will be discussed in Section 9.4. Having thus established the optical implementation of universal quantum computing with continuous variables, we extend this to the one-way model in Section 9.5, where we introduce cluster states for continuous variables. Finally, in Section 9.6, we discuss various quantum error-correction techniques for qunat quantum computing. Single-mode optical qunat gates We have already seen in Chapter 2 that the single qunat gates are fundamentally different from qubit gates. In the context of optical implementations, this difference arises due to the complementary nature of qubits and qunats: qubits that are represented by single photons can be considered particles, whereas qunats are encoded in the wave properties of the optical field.

Cambridge University Press eBooks•Apr 22, 2010•4 citations

Implementation of the quantum full-adder algorithm using integrated optics

Sahar Armaghani, Ali Rostami

One of the main challenges in quantum computing is implementing algorithms within quantum optical free-space and integrated circuits. This research focuses on the quantum addition algorithm, derived from the Deutsch-Jozsa algorithm, to advance quantum computing using optical technologies. The developed quantum optical integrated circuit is built on a hybrid substrate with interconnected components on a silicon dioxide base. Qubits and their states are arranged according to the requirements of each quantum algorithm. In the Fourier transform section, qubits act as propagation modes within silicon waveguides, with emitted photons representing the Fourier transform after traveling a distance of π/2. The phase-shifting section consists of two parts: one shifts the phase of incoming photons by π, while the other modulates this shift based on the quantum full adder algorithm. The first employs a photonic crystal for short phase shifts, which are adjusted via impurities in the silicon substrate and controlled by an electro-optic circuit. Additionally, single-mode waveguides made of silicon dioxide and air serve as qubits. By coupling photon amplitudes, a comparator circuit is triggered based on the generated output. Through these integrations, the sum of two quantum numbers can be represented at the output. This underscores the importance of designing and simulating a full adder within quantum optical integrated circuits to address the complexities inherent in quantum computing.

Optics Express•May 19, 2025•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

Two-bit Deutsch-Jozsa algorithm using an atomic ensemble

Shubhrangshu Dasgupta, G. S. Agarwal

The first optical proposal for the realization of the two-bit version of the Deutsch-Jozsa algorithm [D. Deutsch and R. Jozsa, Proc. R. Soc. London A {\bf 493}, 553 (1992)] is presented. The proposal uses Stark shifts in an ensemble of atoms and degenerate sources of photons. The photons interact dispersively with an atomic ensemble, leading to an effective Hamiltonian in atom-field basis, which is useful for performing the required two-qubit operations. Combining these with a set of one-qubit operations, the algorithm can be implemented. A discussion of the experimental feasibility of the proposal is given.

arXiv:quant-ph/0601105•Jan 16, 2006•0 citations
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.
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'.
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.
In the previous chapter we have discussed some important quantum information processing techniques based on continuous variables, or ‘qunats’. In this chapter, we describe methods for extending these techniques to quantum computation with optical qunats. We will first show in Section 9.1 how the optical qunat states are initialized using single-mode squeezing, and we give optical implementations of some of the most important single-qunat gates, such as the Heisenberg-Weyl operators and the Fourier transform. In Section 9.2, we study the theory of two-mode Gaussian operations, and we construct a general optical circuit that can implement any two-mode Gaussian operation. In Section 9.3, we introduce the stabilizer formalism for qunats, and use it to derive a Gottesman-Knill theorem. This leads to the general requirement of nonlinear gates for qunats, and their optical implementation will be discussed in Section 9.4. Having thus established the optical implementation of universal quantum computing with continuous variables, we extend this to the one-way model in Section 9.5, where we introduce cluster states for continuous variables. Finally, in Section 9.6, we discuss various quantum error-correction techniques for qunat quantum computing. Single-mode optical qunat gates We have already seen in Chapter 2 that the single qunat gates are fundamentally different from qubit gates. In the context of optical implementations, this difference arises due to the complementary nature of qubits and qunats: qubits that are represented by single photons can be considered particles, whereas qunats are encoded in the wave properties of the optical field.
One of the main challenges in quantum computing is implementing algorithms within quantum optical free-space and integrated circuits. This research focuses on the quantum addition algorithm, derived from the Deutsch-Jozsa algorithm, to advance quantum computing using optical technologies. The developed quantum optical integrated circuit is built on a hybrid substrate with interconnected components on a silicon dioxide base. Qubits and their states are arranged according to the requirements of each quantum algorithm. In the Fourier transform section, qubits act as propagation modes within silicon waveguides, with emitted photons representing the Fourier transform after traveling a distance of π/2. The phase-shifting section consists of two parts: one shifts the phase of incoming photons by π, while the other modulates this shift based on the quantum full adder algorithm. The first employs a photonic crystal for short phase shifts, which are adjusted via impurities in the silicon substrate and controlled by an electro-optic circuit. Additionally, single-mode waveguides made of silicon dioxide and air serve as qubits. By coupling photon amplitudes, a comparator circuit is triggered based on the generated output. Through these integrations, the sum of two quantum numbers can be represented at the output. This underscores the importance of designing and simulating a full adder within quantum optical integrated circuits to address the complexities inherent in quantum computing.
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.
The first optical proposal for the realization of the two-bit version of the Deutsch-Jozsa algorithm [D. Deutsch and R. Jozsa, Proc. R. Soc. London A {\bf 493}, 553 (1992)] is presented. The proposal uses Stark shifts in an ensemble of atoms and degenerate sources of photons. The photons interact dispersively with an atomic ensemble, leading to an effective Hamiltonian in atom-field basis, which is useful for performing the required two-qubit operations. Combining these with a set of one-qubit operations, the algorithm can be implemented. A discussion of the experimental feasibility of the proposal is given.