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

Quantum Information Processing

Supersymmetric extension of Deutsch–Jozsa algorithm

Abdeslem Khemakhmia, H. Aissaoui

Published May 15, 2025• 1 citation
Publisher
DOI
10.1007/s11128-025-04753-2

Related papers

Revisiting Deutsch-Jozsa algorithm

Daowen Qiu, Shenggen Zheng

Information and Computation•Aug 6, 2020•40 citations

Deutsch–Jozsa Algorithm

Belal Ehsan Baaquie, L. C. Kwek

Springer eBooks•Jan 1, 2023•1 citation

Generalized Quantum Deutsch-Jozsa Algorithm

Tomasz Arodź

Lecture notes in computer science•Jan 1, 2020•1 citation

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

Deutsch-Jozsa Algorithm

Johnny Hooyberghs

In the previous chapter, you learned about Deutsch’s algorithm. David Deutsch introduced his paper, discussing this algorithm, in 1985 and made improvements with the help from Richard Jozsa, an Australian mathematician. Together, they proposed the Deutsch-Jozsa algorithm in 1992.

Apress eBooks•Dec 8, 2021•6 citations

Efficient Simulation of the Deutsch-Jozsa Algorithm

Niklas Johansson

We provide a framework wherein one can simulate the Deutsch-Jozsa quantum algorithm on a regular computer within polynomial time, and with linear memory consumption. Under certain reasonable assumptions the simulation solves the problem with a bounded error of probability with only one function evaluation, which is comparable with the efficiency of the quantum algorithm. The provided framework lies within a slight extension of the toy model purposed by Robert W. Spekkens Phys. Rev. A 75 (2007), and consists of transformations that are reminiscent of transformations in quantum mechanics.

•Jan 1, 2015•1 citation
We provide a framework wherein one can simulate the Deutsch-Jozsa quantum algorithm on a regular computer within polynomial time, and with linear memory consumption. Under certain reasonable assumptions the simulation solves the problem with a bounded error of probability with only one function evaluation, which is comparable with the efficiency of the quantum algorithm. The provided framework lies within a slight extension of the toy model purposed by Robert W. Spekkens Phys. Rev. A 75 (2007), and consists of transformations that are reminiscent of transformations in quantum mechanics.