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:1708.06375 · Quantum Information Processing

Generalization and demonstration of an entanglement-based Deutsch–Jozsa-like algorithm using a 5-qubit quantum computer

Sayan Gangopadhyay, Manabputra, Bikash K. Behera, Prasanta K. Panigrahi

Published May 18, 2018• 30 citations
arXivHTMLPDF
DOI
10.1007/s11128-018-1932-8

Related papers

Generalization and demonstration of an entanglement-based Deutsch-Jozsa-like algorithm using a 5-qubit quantum computer

Sayan Gangopadhyay, Manabputra,, Bikash K. Behera +1 more

•Jul 1, 2018•37 citations

An implementation of the Deutsch–Jozsa algorithm on a three-qubit NMR quantum computer

Noah Linden, Hervé Barjat, Ray Freeman

Chemical Physics Letters•Oct 1, 1998•137 citations

Three-qubit Deutsch–Jozsa in measurement-based quantum computing

Maximilian Schwetz, R. M. Noack

Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a quantum algorithm. Using the graph-theoretical ZX-calculus, we describe and apply a general scheme for reformulating quantum circuits as MBQC implementations. After illustrating the method using the two-qubit Deutsch–Jozsa algorithm, we derive a ZX graph-diagram that encodes a general MBQC implementation for the three-qubit Deutsch–Jozsa algorithm. This graph describes an 11-qubit cluster state on which single-qubit measurements are used to execute the algorithm. Particular sets of choices of the axes for the measurements can be used to implement any realization of the oracle. In addition, we derive an equivalent lattice cluster state for the algorithm.

arXiv:2306.13372•International Journal of Quantum Information•Dec 4, 2023•0 citations

Implementation of a three-qubit refined Deutsch–Jozsa algorithm using SFG quantum logic gates

Andrea Del Duce, Seb J. Savory, Polina Bayvel

In this paper we present a quantum logic circuit which can be used for the experimental demonstration of a three-qubit solid state quantum computer based on a recent proposal of optically driven quantum logic gates. In these gates, the entanglement of randomly placed electron spin qubits is manipulated by optical excitation of control electrons. The circuit we describe solves the Deutsch problem with an improved algorithm called the refined Deutsch-Jozsa algorithm. We show that it is possible to select optical pulses that solve the Deutsch problem correctly, and do so without losing quantum information to the control electrons, even though the gate parameters vary substantially from one gate to another. © 2006 IOP Publishing Ltd.

Journal of Physics Condensed Matter•May 12, 2006•2 citations

Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm

He-Liang Huang, Ashutosh Goswami, Wan‐Su Bao +1 more

Science China Physics Mechanics and Astronomy•Mar 7, 2018•22 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
Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a quantum algorithm. Using the graph-theoretical ZX-calculus, we describe and apply a general scheme for reformulating quantum circuits as MBQC implementations. After illustrating the method using the two-qubit Deutsch–Jozsa algorithm, we derive a ZX graph-diagram that encodes a general MBQC implementation for the three-qubit Deutsch–Jozsa algorithm. This graph describes an 11-qubit cluster state on which single-qubit measurements are used to execute the algorithm. Particular sets of choices of the axes for the measurements can be used to implement any realization of the oracle. In addition, we derive an equivalent lattice cluster state for the algorithm.
In this paper we present a quantum logic circuit which can be used for the experimental demonstration of a three-qubit solid state quantum computer based on a recent proposal of optically driven quantum logic gates. In these gates, the entanglement of randomly placed electron spin qubits is manipulated by optical excitation of control electrons. The circuit we describe solves the Deutsch problem with an improved algorithm called the refined Deutsch-Jozsa algorithm. We show that it is possible to select optical pulses that solve the Deutsch problem correctly, and do so without losing quantum information to the control electrons, even though the gate parameters vary substantially from one gate to another. © 2006 IOP Publishing Ltd.