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

AIP conference proceedings

Simulation of Deutsch-Jozsa Algorithm in Mathematica

Peter Nyman, Guillaume Adenier, Andrei Yu. Khrennikov, PEKKA J. LAHTI, Vladimir I. Man’ko, Theo M. Nieuwenhuizen

Published Jan 1, 2007• 4 citations
Publisher
DOI
10.1063/1.2827324

Related papers

Comments on “Efficient classical simulation of the Deutsch–Jozsa and Simon’s algorithms”

Carlos A. Batista, Tiago M. L. Veras, Leon D. da Silva +1 more

Quantum Information Processing•Nov 3, 2023•0 citations

Implementation of Deutsch and Deutsch–Jozsa-like algorithms involving classical entanglement of elastic bits

Pierre Alix Deymier, Keith Runge, M. Arif Hasan

Wave Motion•Jun 18, 2022•3 citations

Beyond z=0. The Deutsch-Jozsa decided monochromatic languages

Eraldo Pereira Marinho

The present work points out that the Deutsch-Jozsa algorithm was the first formal description of a quantum decider. In particular, it is studied here the class of languages whose indicator functions allow the Deutsch-Jozsa algorithm to output a monochromatic result, beyond the trivial case z = 0 for constant indicator functions. To illustrate examples of randomly balanced languages and some monochromatic cases, it was performed classical computational simulations of the Deutsch-Jozsa quantum algorithm for the specific cases of 4 and 6 qubits, respectively. The general case of the Deutsch-Jozsa decided languages are named balanced languages, and their outcomes from the simulation suggest that such languages are equivalent to the quantum superposition of the monochromatic cases.

arXiv:1812.07844•Dec 19, 2018•1 citation

Generalized Quantum Deutsch-Jozsa Algorithm

Tomasz Arodź

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

Efficient classical simulation of the Deutsch-Jozsa algorithm

Niklas Johansson, Larsson, Jan-Åke

In 1985, David Deutsch challenged the Church-Turing thesis by stating that his quantum model of computation "could, in principle, be built and would have many remarkable properties not reproducible by any Turing machine". While this is thought to be true in general, there is usually no way of knowing that the corresponding classical algorithms are the best possible solutions. Here we provide an efficient classical simulation of the Deutsch-Jozsa algorithm, which was one of the first examples of quantum computational speed-up. Our conclusion is that the Deutsch-Jozsa quantum algorithm owes its speed-up to resources that are not necessarily quantum-mechanical, and when compared with the classical simulation offers no speed-up at all.

arXiv:1506.04627•Jun 15, 2015•1 citation

Distributed Generalized Deutsch-Jozsa Algorithm

Hao Li, Daowen Qiu, Le Luo

Lecture notes in computer science•Jan 1, 2025•2 citations
The present work points out that the Deutsch-Jozsa algorithm was the first formal description of a quantum decider. In particular, it is studied here the class of languages whose indicator functions allow the Deutsch-Jozsa algorithm to output a monochromatic result, beyond the trivial case z = 0 for constant indicator functions. To illustrate examples of randomly balanced languages and some monochromatic cases, it was performed classical computational simulations of the Deutsch-Jozsa quantum algorithm for the specific cases of 4 and 6 qubits, respectively. The general case of the Deutsch-Jozsa decided languages are named balanced languages, and their outcomes from the simulation suggest that such languages are equivalent to the quantum superposition of the monochromatic cases.
In 1985, David Deutsch challenged the Church-Turing thesis by stating that his quantum model of computation "could, in principle, be built and would have many remarkable properties not reproducible by any Turing machine". While this is thought to be true in general, there is usually no way of knowing that the corresponding classical algorithms are the best possible solutions. Here we provide an efficient classical simulation of the Deutsch-Jozsa algorithm, which was one of the first examples of quantum computational speed-up. Our conclusion is that the Deutsch-Jozsa quantum algorithm owes its speed-up to resources that are not necessarily quantum-mechanical, and when compared with the classical simulation offers no speed-up at all.