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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Implementation of Deutsch and Deutsch-Jozsa algorithms with classical light

Benjamin Perez-García, Jason Francis, Melanie G. McLaren, Sandeep K. Goyal, Raúl I. Hernández-Aranda, Andrew Forbes, Thomas Konrad

Published Sep 27, 2016• 0 citations
Publisher

Abstract

We study the realization of quantum algorithms using classical optical elements and a coherent laser source. The encoded qubits are present in form of path qubits, polarization and orbital angular momentum. In particular, we propose an implementation for the Deutsch Algorithm in a Sagnac interferometer and the Deutsch-Jozsa Algorithm in a ring cavity.

DOI
10.1117/12.2238271

Related papers

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 Cavity QED Implementation of Deutsch-Jozsa Algorithm

E. S. Guerra

The Deutsch-Jozsa algorithm is a generalization of the Deutsch algorithm which was the first algorithm written. We present schemes to implement the Deutsch algorithm and the Deutsch-Jozsa algorithm via cavity QED.

arXiv:quant-ph/0410188•Oct 23, 2004•2 citations

Fiber-Optics Implementation of the Deutsch-Jozsa and Bernstein-Vazirani Quantum Algorithms with Three Qubits

Edouard Brainis, L.-P. Lamoureux, Nicolas J. Cerf +3 more

We report on a fiber-optics implementation of the Deutsch-Jozsa and Bernstein-Vazirani quantum algorithms for 8-point functions. The measured visibility of the 8-path interferometer is about 97.5%. Potential applications of our setup to quantum communication or cryptographic protocols using several qubits are discussed.

arXiv:quant-ph/0212142•Physical Review Letters•Apr 16, 2003•52 citations

Scheme for the implementation of a D-J quantum algorithm

Zhuo‐Liang Cao

We propose two physical schemes for implementing the simplest version of Deutsch-Jozsa algorithm(D-J) based on cavity QED technique.One is a perfect scheme,which can be generalized to multi-qubit inputs Deutsch-Jozsa algorithm.It can be realized with the help of controlled-NOT gates and single-qubit operations.The detailed process in cavity QED is discussed in the scheme.The other is a simpler scheme without controlled-NOT gates,which is only suit for the simplest version of Deutsch-Jozsa algorithm.The scheme only requires single-qubit operation.Thus the scheme can be realized easier than the former one.Our schemes would be an important step for quantum computer.

Journal of Atomic and Molecular Physics•Jan 1, 2006•0 citations

Implementation of the Deutsch-Jozsa algorithm with Josephson charge qubits

Jens Siewert, Rosario Fazio

We investigate the realization of a simple solid-state quantum computer by implementing the Deutsch-Jozsa algorithm in a system of Josephson charge qubits. Starting from a procedure to carry out the one-qubit Deutsch-Jozsa algorithm we show how the N -qubit version of the Bernstein-Vazirani algorithm can be realized. For the implementation of the three-qubit Deutsch-Jozsa algorithm we study in detail a set-up which allows us to produce entangled states.

arXiv:quant-ph/0112135•Journal of Modern Optics•Jul 1, 2002•7 citations

Implementing the Deutsch-Jozsa algorithm with macroscopic ensembles

Henry Semenenko, Tim Byrnes

Quantum computing implementations under consideration today typically deal with systems with microscopic degrees of freedom such as photons, ions, cold atoms, and superconducting circuits. The quantum information is stored typically in low-dimensional Hilbert spaces such as qubits, as quantum effects are strongest in such systems. It has, however, been demonstrated that quantum effects can be observed in mesoscopic and macroscopic systems, such as nanomechanical systems and gas ensembles. While few-qubit quantum information demonstrations have been performed with such macroscopic systems, a quantum algorithm showing exponential speedup over classical algorithms is yet to be shown. Here, we show that the Deutsch-Jozsa algorithm can be implemented with macroscopic ensembles. The encoding that we use avoids the detrimental effects of decoherence that normally plagues macroscopic implementations. We discuss two mapping procedures which can be chosen depending upon the constraints of the oracle and the experiment. Both methods have an exponential speedup over the classical case, and only require control of the ensembles at the level of the total spin of the ensembles. It is shown that both approaches reproduce the qubit Deutsch-Jozsa algorithm, and are robust under decoherence.

arXiv:1604.08688•Physical Review A•May 2, 2016•8 citations
We study the realization of quantum algorithms using classical optical elements and a coherent laser source. The encoded qubits are present in form of path qubits, polarization and orbital angular momentum. In particular, we propose an implementation for the Deutsch Algorithm in a Sagnac interferometer and the Deutsch-Jozsa Algorithm in a ring cavity.
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.
We propose two physical schemes for implementing the simplest version of Deutsch-Jozsa algorithm(D-J) based on cavity QED technique.One is a perfect scheme,which can be generalized to multi-qubit inputs Deutsch-Jozsa algorithm.It can be realized with the help of controlled-NOT gates and single-qubit operations.The detailed process in cavity QED is discussed in the scheme.The other is a simpler scheme without controlled-NOT gates,which is only suit for the simplest version of Deutsch-Jozsa algorithm.The scheme only requires single-qubit operation.Thus the scheme can be realized easier than the former one.Our schemes would be an important step for quantum computer.
Quantum computing implementations under consideration today typically deal with systems with microscopic degrees of freedom such as photons, ions, cold atoms, and superconducting circuits. The quantum information is stored typically in low-dimensional Hilbert spaces such as qubits, as quantum effects are strongest in such systems. It has, however, been demonstrated that quantum effects can be observed in mesoscopic and macroscopic systems, such as nanomechanical systems and gas ensembles. While few-qubit quantum information demonstrations have been performed with such macroscopic systems, a quantum algorithm showing exponential speedup over classical algorithms is yet to be shown. Here, we show that the Deutsch-Jozsa algorithm can be implemented with macroscopic ensembles. The encoding that we use avoids the detrimental effects of decoherence that normally plagues macroscopic implementations. We discuss two mapping procedures which can be chosen depending upon the constraints of the oracle and the experiment. Both methods have an exponential speedup over the classical case, and only require control of the ensembles at the level of the total spin of the ensembles. It is shown that both approaches reproduce the qubit Deutsch-Jozsa algorithm, and are robust under decoherence.