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:0908.1262

Using the Deutsch-Jozsa algorithm to determine parts of an array and apply a specified function to each independent part

Samir Lipovaca

Published Aug 10, 2009• 0 citations
arXivHTMLPDF

Abstract

Using the Deutsch-Jozsa algorithm, we will develop a method for solving a class of problems in which we need to determine parts of an array and then apply a specified function to each independent part. Since present quantum computers are not robust enough for code writing and execution, we will build a model of a vector quantum computer that implements the Deutsch-Jozsa algorithm from a machine language view using the APL2 programming language. The core of the method is an operator (DJBOX) which allows evaluation of an arbitrary function f by the Deutsch-Jozsa algorithm. Two key functions of the method are GET_PARTITION and CALC_WITH_PARTITIONS. The GET_PARTITION function determines parts of an array based on the function f. The CALC_WITH_PARTITIONS function determines parts of an array based on the function f and then applies another function to each independent part. We will imagine the method is implemented on the above vector quantum computer. We will show that the method can be successfully executed.

DOI
10.48550/arxiv.0908.1262

Related papers

Algoritmo cuántico de Deutsch y Jozsa en GAMA

Mireya Paredes, A. Meneses Viveros, Guillermo B. Morales-Luna

An important feature of quantum computing is its inherent paralellism, allowing to process an exponential number of basic transforms with just a linear number of qubits. The Deutsch-Jozsa algorithm exemplifies the computational complexity reduction. This work reports the implementation and execution of the Deutsch-Josza quantum algoritm in GAMA, a programming language for quantum computing simulation developed by ourselves. Through this simulation, it is possible to explore all the components involved by tracing all the different configurations that each component may take.

Revista Mexicana de Física E•Jun 11, 2018•2 citations

Implementation of Deutsch-Jozsa quantum algorithm in functional programming language

Lucas Lacava, Mariana Godoy Vazquez Miano

The goal of this research is to show the implementation of Deutsch-Jozsa quantum algorithm in functional programming language and its advantages comparing to Classical Computing. Are presented definitions and characteristics of the algorithm and the language Quipper, in which the implementation of the Deutsch-Jozsa quantum algorithm occurs.

Revista dos Trabalhos de Iniciação Científica da UNICAMP•Feb 12, 2019•0 citations

Deutsch’s Algorithm

Johnny Hooyberghs

In Part 1 of this book, you learned about some of the theoretical concepts of quantum computing, and in Part 2, you got acquainted with Microsoft Q#, a quantum programming language and simulator. Actual quantum algorithms, and, as an extension on that, quantum programs, are hard to invent and write. Firstly, you need a very specific problem to solve, and secondly, you need to think of a process that can leverage quantum properties to solve your problem.

Apress eBooks•Dec 8, 2021•0 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

Phase-creation algorithm to solve an extended Deutsch problem by a quantum computer

Hiroshi Ozawa

The Deutsch-Jozsa algorithm to implement an f-controlled-NOT transformation on a quantum computer was generalized to create arbitrary phases. This phase-creation algorithm was applied to solve an extended Deutsch problem for a function that maps ${0,1{}}^{n}$ to ${0,1{}}^{m}.$ Implementation of the algorithm on a NMR quantum computer is discussed.

Physical Review A•Apr 18, 2001•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
Using the Deutsch-Jozsa algorithm, we will develop a method for solving a class of problems in which we need to determine parts of an array and then apply a specified function to each independent part. Since present quantum computers are not robust enough for code writing and execution, we will build a model of a vector quantum computer that implements the Deutsch-Jozsa algorithm from a machine language view using the APL2 programming language. The core of the method is an operator (DJBOX) which allows evaluation of an arbitrary function f by the Deutsch-Jozsa algorithm. Two key functions of the method are GET_PARTITION and CALC_WITH_PARTITIONS. The GET_PARTITION function determines parts of an array based on the function f. The CALC_WITH_PARTITIONS function determines parts of an array based on the function f and then applies another function to each independent part. We will imagine the method is implemented on the above vector quantum computer. We will show that the method can be successfully executed.
An important feature of quantum computing is its inherent paralellism, allowing to process an exponential number of basic transforms with just a linear number of qubits. The Deutsch-Jozsa algorithm exemplifies the computational complexity reduction. This work reports the implementation and execution of the Deutsch-Josza quantum algoritm in GAMA, a programming language for quantum computing simulation developed by ourselves. Through this simulation, it is possible to explore all the components involved by tracing all the different configurations that each component may take.
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.
The Deutsch-Jozsa algorithm to implement an f-controlled-NOT transformation on a quantum computer was generalized to create arbitrary phases. This phase-creation algorithm was applied to solve an extended Deutsch problem for a function that maps 0,1n{0,1{}}^{n}0,1n to 0,1m.{0,1{}}^{m}.0,1m. Implementation of the algorithm on a NMR quantum computer is discussed.
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.