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

Wave Motion

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

Pierre A. Deymier, Keith Runge, M. Arif Hasan

Published Jun 18, 2022• 3 citations
Publisher
DOI
10.1016/j.wavemoti.2022.102977

Related papers

Quantum entanglement in the NMR implementation of the Deutsch-Jozsa algorithm

Arvind, Kavita Dorai, Anil Kumar

arXiv:quant-ph/9909067•Pramana•May 1, 2001•37 citations

Quantum computation with classical light: Implementation of the Deutsch–Jozsa algorithm

Benjamin Perez-García, Melanie G. McLaren, Sandeep K. Goyal +3 more

Physics Letters A•Apr 10, 2016•19 citations

Implementation of a Deutsch-like quantum algorithm utilizing entanglement at the two-qubit level on an NMR quantum-information processor

Kavita Dorai, Arvind, Anil Kumar

We describe the NMR implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits. The algorithm solves a generalization of the Deutsch problem, and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and Grover's search algorithm for two bits.

arXiv:quant-ph/0006103•Physical Review A•Feb 9, 2001•27 citations

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

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

arXiv:1706.09489•Science China Physics Mechanics and Astronomy•Mar 7, 2018•25 citations

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

arXiv:1708.06375•Quantum Information Processing•May 18, 2018•50 citations

Efficient Simulation of Deutsch's Algorithm.

Niklas Johansson

It is shown that Deutsch’s algorithm and the Deutsch-Jozsa algorithm for two and three qubits can be efficiently implemented on a classical computer. This is done by analysing the structure of the oracles contained in these algorithms, followed by an implementation in the toy theory proposed by Robert W. Spekkens which uses 2 classical bits to simulate a qubit. Further discussion is given about how to analyse, and possible implementations, of the Deutsch-Jozsa for higher number of qubits in the toy theory.

•Jan 1, 2014•0 citations
It is shown that Deutsch’s algorithm and the Deutsch-Jozsa algorithm for two and three qubits can be efficiently implemented on a classical computer. This is done by analysing the structure of the oracles contained in these algorithms, followed by an implementation in the toy theory proposed by Robert W. Spekkens which uses 2 classical bits to simulate a qubit. Further discussion is given about how to analyse, and possible implementations, of the Deutsch-Jozsa for higher number of qubits in the toy theory.