2003
DOI: 10.1038/nature01336
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of the Deutsch–Jozsa algorithm on an ion-trap quantum computer

Abstract: Determining classically whether a coin is fair (head on one side, tail on the other) or fake (heads or tails on both sides) requires an examination of each side. However, the analogous quantum procedure (the Deutsch-Jozsa algorithm) requires just one examination step. The Deutsch-Jozsa algorithm has been realized experimentally using bulk nuclear magnetic resonance techniques, employing nuclear spins as quantum bits (qubits). In contrast, the ion trap processor utilises motional and electronic quantum states o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

7
316
0
3

Year Published

2004
2004
2018
2018

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 452 publications
(330 citation statements)
references
References 19 publications
7
316
0
3
Order By: Relevance
“…We then prepare the |0, DDD · · · D -state with N π-pulses on the carrier transition applied to ions #1 to #N , denoted by R C n (θ = π) (the notation is detailed in Gulde et al 15 ; we do not specify the phase of the pulses because its particular value is irrelevant in this context). Then this state is checked for vanishing fluorescence with a photomultiplier tube.…”
Section: Methodsmentioning
confidence: 99%
“…We then prepare the |0, DDD · · · D -state with N π-pulses on the carrier transition applied to ions #1 to #N , denoted by R C n (θ = π) (the notation is detailed in Gulde et al 15 ; we do not specify the phase of the pulses because its particular value is irrelevant in this context). Then this state is checked for vanishing fluorescence with a photomultiplier tube.…”
Section: Methodsmentioning
confidence: 99%
“…The memory effects were further applied as important physical resources 28 to substantially improve the performance of the quantum algorithm with the assistance of the DD protection method. 26 The Deutsch-Jozsa algorithm, [38][39][40] which can be used to determine whether a coin is fair or fake in a single examination step, 40,41 is one of the seminal algorithms used to demonstrate the advantages of quantum computations. Experimentally, the refined Deutsch-Jozsa algorithm (RDJA) [38][39][40] was implemented with a single spin qubit of the NV center to study the memory effect of a non-Markovian environment, with a bidirectional flow of information between the spin qubit and the spin bath, as shown in Fig.…”
Section: Introductionmentioning
confidence: 99%
“…2 is interesting since it involves only n = 3 qubits and a few tens on quantum gates. Therefore this quantum computation seems to be accessible or close to the present capabilities of NMR-based [17,18] and ion-trap [19] quantum processors.…”
Section: Quantum Computing Of Dynamical Localizationmentioning
confidence: 81%