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

International Conference Physics and Control

The Deutsch-Jozsa algorithm and the bulk ensemble NMR quantum computer

Ryuichi Sawae, Y. Mori, Minaru Kawamura, T. Sakata, Kenichi Takarabe

Published Oct 4, 2006• 1 citation
Publisher

Abstract

In a bulk quantum computing it is shown by Collins that the iteration number of the Grover's algorithm will be decreased as compared with that number in case of a single quantum computer system. We discuss some of the implications on the Deutsch-Jozsa algorithm in a bulk quantum computing, and have a plan to prove them experimentally.

DOI
10.1109/phycon.2005.1514090

Related papers

Orchestrating an NMR quantum computation: the N=3 Deutsch-Jozsa algorithm

David C. Collins, K. W. Kim, William C. Holton +2 more

A detailed description of the development of a three qubit NMR realization of the Deutsch-Jozsa algorithm [Collins et.al., Phys. Rev. A 62, 022304 (2000)] is provided. The theoretical and experimental techniques used for the reduction of the algorithm's evolution steps into a sequence of NMR pulses are discussed at length. This includes the description of general pulse sequence compilation techniques, various schemes for indirectly coupled gate realizations, experimental pulse parameterization techniques and bookkeeping methods for pulse phases.

arXiv:quant-ph/0105045•May 10, 2001•0 citations

Scaling issues in ensemble implementations of the Deutsch-Jozsa algorithm

Arvind, David C. Collins

We discuss the ensemble version of the Deutsch-Jozsa (DJ) algorithm which attempts to provide a ``scalable'' implementation on an expectation-value NMR quantum computer. We show that this ensemble implementation of the DJ algorithm is at best as efficient as the classical random algorithm. As soon as any attempt is made to classify all possible functions with certainty, the implementation requires an exponentially large number of molecules. The discrepancies arise out of the interpretation of mixed state density matrices.

arXiv:quant-ph/0307153•Physical Review A•Nov 3, 2003•12 citations

개선된 Deutsch-Jozsa 알고리즘에 대한 4비트 핵자기공명 앙상블 양자컴퓨터 구현 = 4-bit NMR ensemble quantum computer implementation of refined Deutsch-Jozsa algorithm

이훈경, Hoon-Kyung Lee

•Jan 1, 2002•0 citations

Discrimination of unitary transformations in the Deutsch-Jozsa algorithm: Implications for thermal-equilibrium-ensemble implementations

David C. Collins

A general framework for regarding oracle-assisted quantum algorithms as tools for discriminating among unitary transformations is described. This framework is applied to the Deutsch-Jozsa problem and all possible quantum algorithms which solve the problem with certainty using oracle unitaries in a particular form are derived. It is also used to show that any quantum algorithm that solves the Deutsch-Jozsa problem starting with a quantum system in a particular class of initial, thermal equilibrium-based states of the type encountered in solution-state NMR can only succeed with greater probability than a classical algorithm when the problem size $n$ exceeds $~{10}^{5}.$

arXiv:1002.4227•Physical Review A•May 19, 2010•5 citations

Deutsch and Jozsa's Algorithm Revisited

J. Cooper

A classical analogue of Deutsch and Jozsa's algorithm is given and its implications on quantum computing is discussed

arXiv:quant-ph/0603231•Mar 27, 2006•0 citations

More advanced quantum algorithms

Jonathan A. Jones, Dieter Jaksch

Deutsch's algorithm and Grover's quantum search are theoretically interesting, but it is not obvious that these two algorithms are actually useful for anything important. We next consider a selection of more advanced algorithms, several of which may have real-life applications. Some of these will be too complicated to explain fully, and their properties will only be sketched briefly. The Deutsch–Jozsa algorithm Deutsch's algorithm is simple, but important, as it shows that a quantum algorithm can find a property of an unknown function (its parity) with a smaller number of queries than any possible classical algorithm (one rather than two). For this reason we can say that quantum computing is more efficient than classical computing within the oracle model of function evaluation. (It is widely believed that quantum computing is more efficient than classical computing in general, but this is a surprisingly hard thing to prove.) The simplicity of the algorithm is also an advantage, as it can be implemented on very primitive quantum computers. Beyond this, however, Deutsch's algorithm is also important as the simplest member of a large family of quantum algorithms, including most notably Shor's quantum factoring algorithm. The second simplest algorithm in the family is the Deutsch–Jozsa algorithm, which solves a very closely related problem. Consider an unknown binary function with n input bits, giving N = 2 n possible inputs, and a single output bit.

Cambridge University Press eBooks•Jul 19, 2012•0 citations
In a bulk quantum computing it is shown by Collins that the iteration number of the Grover's algorithm will be decreased as compared with that number in case of a single quantum computer system. We discuss some of the implications on the Deutsch-Jozsa algorithm in a bulk quantum computing, and have a plan to prove them experimentally.
A detailed description of the development of a three qubit NMR realization of the Deutsch-Jozsa algorithm [Collins et.al., Phys. Rev. A 62, 022304 (2000)] is provided. The theoretical and experimental techniques used for the reduction of the algorithm's evolution steps into a sequence of NMR pulses are discussed at length. This includes the description of general pulse sequence compilation techniques, various schemes for indirectly coupled gate realizations, experimental pulse parameterization techniques and bookkeeping methods for pulse phases.
We discuss the ensemble version of the Deutsch-Jozsa (DJ) algorithm which attempts to provide a ``scalable'' implementation on an expectation-value NMR quantum computer. We show that this ensemble implementation of the DJ algorithm is at best as efficient as the classical random algorithm. As soon as any attempt is made to classify all possible functions with certainty, the implementation requires an exponentially large number of molecules. The discrepancies arise out of the interpretation of mixed state density matrices.
A general framework for regarding oracle-assisted quantum algorithms as tools for discriminating among unitary transformations is described. This framework is applied to the Deutsch-Jozsa problem and all possible quantum algorithms which solve the problem with certainty using oracle unitaries in a particular form are derived. It is also used to show that any quantum algorithm that solves the Deutsch-Jozsa problem starting with a quantum system in a particular class of initial, thermal equilibrium-based states of the type encountered in solution-state NMR can only succeed with greater probability than a classical algorithm when the problem size nnn exceeds  105.~{10}^{5}. 105.
Deutsch's algorithm and Grover's quantum search are theoretically interesting, but it is not obvious that these two algorithms are actually useful for anything important. We next consider a selection of more advanced algorithms, several of which may have real-life applications. Some of these will be too complicated to explain fully, and their properties will only be sketched briefly. The Deutsch–Jozsa algorithm Deutsch's algorithm is simple, but important, as it shows that a quantum algorithm can find a property of an unknown function (its parity) with a smaller number of queries than any possible classical algorithm (one rather than two). For this reason we can say that quantum computing is more efficient than classical computing within the oracle model of function evaluation. (It is widely believed that quantum computing is more efficient than classical computing in general, but this is a surprisingly hard thing to prove.) The simplicity of the algorithm is also an advantage, as it can be implemented on very primitive quantum computers. Beyond this, however, Deutsch's algorithm is also important as the simplest member of a large family of quantum algorithms, including most notably Shor's quantum factoring algorithm. The second simplest algorithm in the family is the Deutsch–Jozsa algorithm, which solves a very closely related problem. Consider an unknown binary function with n input bits, giving N = 2 n possible inputs, and a single output bit.