Cited by 124Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer

Open access
Tame, M. S., Prevedel, R., Paternostro, M., Böhi, P., Kim, M. S., Zeilinger, A.·2007·Physical Review Letters

Abstract

We report the first experimental demonstration of an all-optical one-way implementation of Deutsch's quantum algorithm on a four-qubit cluster state. All the possible configurations of a balanced or constant function acting on a two-qubit register are realized within the measurement-based model for quantum computation. The experimental results are in excellent agreement with the theoretical model, therefore demonstrating the successful performance of the algorithm.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.98.140501

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • In contrast to previously realized implementations of Deutsch's algorithm using traditional cluster states, the paper exploits blind staircase cluster states |Φ̂θ〉⌟⌜ for the implementation of this quantum algorithm for n=1.

    “In contrast to previously realized implementations of Deutsch's algorithm using traditional cluster states [16, 46], we exploit blind staircase cluster states | Φ ˆ θ 〉 ⌟⌜ for the implementation of this quantum algorithm for the case n = 1.”

    From Demonstration of Blind Quantum Computing (2012) · cites this paper as [46]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. [1]M. A. Nielsen and I. L. Chuang, Quantum Computing and Quantum Information , Cambridge University Press, Cambridge (2000).
  2. [3]D. Deutsch, Proc. Roy. Soc. Lond. A 400 , 97 (1985).
  3. [4]N. A. Gershenfeld and I. L. Chuang, Science 275 , 350 (1997); D.G. Cory et al. , Proc. Nat. Acad. Sci. USA 94 , 1634 (1997); I. L. Chuang et al. , Nature 393 , 143 (1998); J. Jones, M. Mosca, and R. H. Hansen, Nature 393 , 344 (1998).
  4. [11]D. Deutsch and R. Jozsa, Proc. R. Soc. Lond. A 439 , 553 (1992).

Cited by

Sorted by citations

Authors
Tame, M. S., Prevedel, R., Paternostro, M., Böhi, P., Kim, M. S., & Zeilinger, A.
Affiliations
  • Queen's University Belfast (GB)
  • University of Vienna (AT)
Venue
Physical Review Letters
Published
2007-04-02
Volume
98
Issue
14
Pages
140501-140501
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1990843498
Cited by
124
References
28
Citations by year
2026: 1 · 2025: 1 · 2024: 6 · 2023: 1 · 2022: 4 · 2021: 5 · 2020: 1 · 2019: 3 · 2018: 6 · 2017: 13 · 2016: 6 · 2015: 4 · 2014: 5 · 2013: 3 · 2012: 11
FWCI
18.15
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Funders
Engineering and Physical Sciences Research Council (EP/E003931/1)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
Deutsch's algorithm, one-way quantum computation, cluster states, measurement-based quantum computation, four-qubit cluster state, quantum algorithms
MeSH terms
Algorithms, Computers, Quantum Theory

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review