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

arXiv:0803.3183

Deutsch Algorithm on Classical Circuits

Osman Kaan Erol

Published Mar 21, 2008• 2 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.0803.3183

Related papers

The Deutsch-Josza algorithm for n-qudits

Gabriela Mogos

Abstract: Over the last decade has been a lot of interest in new types of computable machines, due partly over the fears on conventional, classical, computing. Research by leading physicists, mathematicians and computer scientists has shown quantum computers could be the future, as they may be able to solve some computationally difficult problems much faster than is currently possible on a classical computer. David Deutsch has already created a working model for a quantum computer, the quantum Turing machine or QTM Deutsch [1985]. This has been proved as a model for computation on a quantum and has allowed algorithms to be developed. Deutsch-Josza’s algorithm, as all known quantum algorithms that provide exponential speedup over classical systems do, answers a question about a global property of a solution space. This paper describes the generalization of the Deutsch-Josza algorithm to n d-dimensional quantum systems or qudits. Key–Words: quantum computing, quantum dits, quantum algorithm 1

•Nov 21, 2007•2 citations

Quantum Computers

S. Rajasekar, R. Velusamy

In quantum computers a unitary transformation is applied to a given initial state of a set of qubits through several quantum gates. Tests were conducted using Grover's algorithm and implemented in a variety of different ways on the publically available IBM quantum computers. Essentially, quantum computers manipulate quantum states instead of classical bits. Quantum information can be represented by the elementary units called quantum bits abbreviated as qubits or qbits. This chapter discusses the fundamental properties of quantum systems that are relevant to information processing. Quantum computation needs something much more than that quantum parallelism to be useful. This is achieved in Deutsch's algorithm which combines quantum parallelism with interference. One can simulate a classical circuit using a quantum circuit. That is, it is possible to perform classical computations on quantum computers. But the advantage of quantum computing is that powerful functions may be computed by making use of quantum parallelism, the fundamental feature of many quantum algorithms.

CRC Press eBooks•Oct 5, 2022•0 citations

Deutsch-Jozsa Algorithm for Three Fermions System

Mezher B. Saleh, Loay Edwar George, Kadhum J. Kadhum

One of the most important quantum algorithms is Dutsch-Jozsa algorithm. It is one of the most basic ways to demonstrate the power of quantum computation. In this research a system consists of three electron (fermions) in state |0˃ and one in state |1˃ the Hadamard transform was applied on all states. Then, the black box is applied to compute f. Finally it has been applied the Hadamard gate. It was proved this quantum information processing system can solve Deutsch’s problem with one evaluation of the function f while the classical system requires (2 n /2 + 1 = 5) evaluations.

World Scientific News•Jan 1, 2016•0 citations

Quantum Computing Algorithms

Alice Flarend, Bob Hilborn

Abstract Alice and Bob introduce and explain in detail some of the algorithms that convinced physicists and computer scientists that there might be something to this crazy idea of quantum computing. Each algorithm provides a case study of how the properties of quantum states can be used to provide an advantage for using a quantum computer compared to a classical computer. Alice and Bob describe the Deutsch algorithm, designed to answer a simple question about the properties of functions of binary digits (0 and 1), and the Simon algorithm, which finds a “secret code.” The Simon algorithm, like many other quantum algorithms, is a mix of quantum state algorithms and classical computational methods. Alice and Bob also introduce Hadamard gates that act on multi-qubit systems. Those gates play an important role in many quantum algorithms.

Oxford University Press eBooks•Apr 15, 2022•0 citations

Quantum Gates and Circuits

Radhika Vathsan

We are now ready to see how computing with qubits can be done. In this book, we will mainly use the circuit model for computation which was first introduced by Deutsch [25]. We will represent by quantum “wires,” the qubits upon which manipulations. The length of the wire is to be interpreted as the time axis. Manipulations on qubits can be done using basic unitary operators that are the equivalents of logic “gates.” An algorithm, or a complete set of steps for achieving a processing task, is a combination of wires and gates representing a quantum circuit. This circuit must be thought of as a time sequence of events with every wire a way of representing qubit states, and with gates representing processing of those states.

CRC Press eBooks•Jul 21, 2015•3 citations

An Extension of the Deutsch-Jozsa Algorithm to Arbitrary Qudits

Peter Marttala

Recent advances in quantum computational science promise substantial improvements in the speed with which certain classes of problems can be computed. Various algorithms that utilize the distinctively non-classical characteristics of quantum mechanics have been formulated to take advantage of this promising new approach to computation. One such algorithm was formulated by David Deutsch and Richard Jozsa. By measuring the output of a quantum network that implements this algorithm, it is possible to determine with N – 1 measurements certain global properties of a function f(x), where N is the number of network inputs. Classically, it may not be possible to determine these same properties without evaluating f(x) a number of times that rises exponentially as N increases. Hitherto, the potential power of this algorithm has been explored in the context of qubits, the quantum computational analogue of classical bits. However, just as one can conceive of classical computation in the context of non-binary logic, such as ternary or quaternary logic, so also can one conceive of corresponding higher-order quantum computational equivalents.This thesis investigates the behaviour of the Deutsch-Jozsa algorithm in the context of these higher-order quantum computational forms of logic and explores potential applications for this algorithm. An important conclusion reached is that, not only can the Deutsch-Jozsa algorithm’s known computational advantages be formulated in more general terms, but also a new algorithmic property is revealed with potential practical applications.

•Jan 1, 2007•0 citations
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.
Abstract: Over the last decade has been a lot of interest in new types of computable machines, due partly over the fears on conventional, classical, computing. Research by leading physicists, mathematicians and computer scientists has shown quantum computers could be the future, as they may be able to solve some computationally difficult problems much faster than is currently possible on a classical computer. David Deutsch has already created a working model for a quantum computer, the quantum Turing machine or QTM Deutsch [1985]. This has been proved as a model for computation on a quantum and has allowed algorithms to be developed. Deutsch-Josza’s algorithm, as all known quantum algorithms that provide exponential speedup over classical systems do, answers a question about a global property of a solution space. This paper describes the generalization of the Deutsch-Josza algorithm to n d-dimensional quantum systems or qudits. Key–Words: quantum computing, quantum dits, quantum algorithm 1
In quantum computers a unitary transformation is applied to a given initial state of a set of qubits through several quantum gates. Tests were conducted using Grover's algorithm and implemented in a variety of different ways on the publically available IBM quantum computers. Essentially, quantum computers manipulate quantum states instead of classical bits. Quantum information can be represented by the elementary units called quantum bits abbreviated as qubits or qbits. This chapter discusses the fundamental properties of quantum systems that are relevant to information processing. Quantum computation needs something much more than that quantum parallelism to be useful. This is achieved in Deutsch's algorithm which combines quantum parallelism with interference. One can simulate a classical circuit using a quantum circuit. That is, it is possible to perform classical computations on quantum computers. But the advantage of quantum computing is that powerful functions may be computed by making use of quantum parallelism, the fundamental feature of many quantum algorithms.
One of the most important quantum algorithms is Dutsch-Jozsa algorithm. It is one of the most basic ways to demonstrate the power of quantum computation. In this research a system consists of three electron (fermions) in state |0˃ and one in state |1˃ the Hadamard transform was applied on all states. Then, the black box is applied to compute f. Finally it has been applied the Hadamard gate. It was proved this quantum information processing system can solve Deutsch’s problem with one evaluation of the function f while the classical system requires (2 n /2 + 1 = 5) evaluations.
Abstract Alice and Bob introduce and explain in detail some of the algorithms that convinced physicists and computer scientists that there might be something to this crazy idea of quantum computing. Each algorithm provides a case study of how the properties of quantum states can be used to provide an advantage for using a quantum computer compared to a classical computer. Alice and Bob describe the Deutsch algorithm, designed to answer a simple question about the properties of functions of binary digits (0 and 1), and the Simon algorithm, which finds a “secret code.” The Simon algorithm, like many other quantum algorithms, is a mix of quantum state algorithms and classical computational methods. Alice and Bob also introduce Hadamard gates that act on multi-qubit systems. Those gates play an important role in many quantum algorithms.
We are now ready to see how computing with qubits can be done. In this book, we will mainly use the circuit model for computation which was first introduced by Deutsch [25]. We will represent by quantum “wires,” the qubits upon which manipulations. The length of the wire is to be interpreted as the time axis. Manipulations on qubits can be done using basic unitary operators that are the equivalents of logic “gates.” An algorithm, or a complete set of steps for achieving a processing task, is a combination of wires and gates representing a quantum circuit. This circuit must be thought of as a time sequence of events with every wire a way of representing qubit states, and with gates representing processing of those states.
Recent advances in quantum computational science promise substantial improvements in the speed with which certain classes of problems can be computed. Various algorithms that utilize the distinctively non-classical characteristics of quantum mechanics have been formulated to take advantage of this promising new approach to computation. One such algorithm was formulated by David Deutsch and Richard Jozsa. By measuring the output of a quantum network that implements this algorithm, it is possible to determine with N – 1 measurements certain global properties of a function f(x), where N is the number of network inputs. Classically, it may not be possible to determine these same properties without evaluating f(x) a number of times that rises exponentially as N increases. Hitherto, the potential power of this algorithm has been explored in the context of qubits, the quantum computational analogue of classical bits. However, just as one can conceive of classical computation in the context of non-binary logic, such as ternary or quaternary logic, so also can one conceive of corresponding higher-order quantum computational equivalents.This thesis investigates the behaviour of the Deutsch-Jozsa algorithm in the context of these higher-order quantum computational forms of logic and explores potential applications for this algorithm. An important conclusion reached is that, not only can the Deutsch-Jozsa algorithm’s known computational advantages be formulated in more general terms, but also a new algorithmic property is revealed with potential practical applications.