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/0410188Oct 23, 20041 citation

The Journal of Supercomputing

Distributed Deutsch–Jozsa algorithm

Hao Li, Daowen Qiu, Le Luo

Published Aug 9, 2025• 15 citations

Publisher

DOI: 10.1007/s11227-025-07683-z

Related papers

Distributed Generalized Deutsch-Jozsa Algorithm

Hao Li, Daowen Qiu, Le Luo

Lecture notes in computer scienceJan 1, 20252 citations

Non-local quantum functions and the distributed Deutsch-Jozsa algorithm

Andrei Tănăsescu, Mihai-Zicu Mina, Pantelimon George Popescu

Physics Letters AApr 16, 20194 citations

Distributed exact quantum algorithms for Deutsch-Jozsa problem

Hao Li, Daowen Qiu, Le Luo

Deutsch-Jozsa (DJ) problem is one of the most important problems demonstrating the power of quantum algorithm. DJ problem can be described as a Boolean function $f$ : $\{0,1\}^n\rightarrow \{0,1\}$ with promising it is either constant or balanced, and the purpose is to determine which type it is. DJ algorithm can solve it exactly with one query. In this paper, we first discover the inherent structure of DJ problem in distributed scenario by giving a number of equivalence characterizations between $f$ being constant (balanced) and some properties of $f$ 's subfunctions, and then we propose three distributed exact quantum algorithms for solving DJ problem. Our algorithms have essential acceleration over distributed classical deterministic algorithm, and can be extended to the case of multiple computing nodes. Compared with DJ algorithm, our algorithms can reduce the number of qubits and the depth of circuit implementing a single query operator. Therefore, we find that the structure of problem should be clarified for designing distributed quantum algorithm to solve it.Deutsch-Jozsa (DJ) problem is one of the most important problems demonstrating the power of quantum algorithm. DJ problem can be described as a Boolean function $f$: $\{0,1\}^n\rightarrow \{0,1\}$ with promising it is either constant or balanced, and the purpose is to determine which type it is. DJ algorithm can solve it exactly with one query. In this paper, we first discover the inherent structure of DJ problem in distributed scenario by giving a number of equivalence characterizations between $f$ being constant (balanced) and some properties of $f$'s subfunctions, and then we propose three distributed exact quantum algorithms for solving DJ problem. Our algorithms have essential acceleration over distributed classical deterministic algorithm, and can be extended to the case of multiple computing nodes. Compared with DJ algorithm, our algorithms can reduce the number of qubits and the depth of circuit implementing a single query operator. Therefore, we find that the structure of problem should be clarified for designing distributed quantum algorithm to solve it.

arXiv:2303.10663Mar 19, 20235 citations

Deutsch–Jozsa Algorithm

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooksJan 1, 20231 citation

The Deutsch-Jozsa Algorithm Can Be Used for Quantum Key Distribution

Koji Nagata, Tadao Nakamura

We review the new type of Deutsch-Jozsa algorithm proposed in [K.Nagata and T.

OALibJan 1, 201520 citations

A Cavity QED Implementation of Deutsch-Jozsa Algorithm

E. S. Guerra

arXiv:quant-ph/0410188Oct 23, 20041 citation

Deutsch-Jozsa (DJ) problem is one of the most important problems demonstrating the power of quantum algorithm. DJ problem can be described as a Boolean function

f

\{0,1\}^n\rightarrow \{0,1\}

with promising it is either constant or balanced, and the purpose is to determine which type it is. DJ algorithm can solve it exactly with one query. In this paper, we first discover the inherent structure of DJ problem in distributed scenario by giving a number of equivalence characterizations between

f

being constant (balanced) and some properties of

f

's subfunctions, and then we propose three distributed exact quantum algorithms for solving DJ problem. Our algorithms have essential acceleration over distributed classical deterministic algorithm, and can be extended to the case of multiple computing nodes. Compared with DJ algorithm, our algorithms can reduce the number of qubits and the depth of circuit implementing a single query operator. Therefore, we find that the structure of problem should be clarified for designing distributed quantum algorithm to solve it.