Deutsch Algorithm on Classical Circuits
Osman Kaan Erol

TL;DR
This paper demonstrates that classical analog electronic circuits can replicate the Deutsch and Deutsch-Jozsha algorithms' performance, challenging the notion that quantum advantage is solely due to quantum properties.
Contribution
It shows that classical analog systems can perform quantum algorithms with similar efficiency, questioning the uniqueness of quantum computational advantages.
Findings
Classical analog circuits can implement Deutsch algorithms effectively.
Classical systems may carry more information than digital bits in similar tasks.
Quantum and classical analog circuits can perform equivalently in these algorithms.
Abstract
The well-known Deutsch Algorithm (DA) and Deutsch-Jozsha Algorithm (DJA) both are used as an evidence to the power of quantum computers over classical computation mediums. In these theoretical experiments, it has been shown that a quantum computer can find the answer with certainty within a few steps although classical electronic systems must evaluate more iterations than quantum computer. In this paper, it is shown that a classical computation system formed by using ordinary electronic parts may perform the same task with equal performance than quantum computers. DA and DJA quantum circuits act like an analog computer, so it is unfair to compare the bit of classical digital computers with the qubit of quantum computers. An analog signal carrying wire will of course carry more information that a bit carrying wire without serial communication protocols.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
