Experimental realization of the Deutsch-Jozsa algorithm with a six-qubit cluster state
Open accessAbstract
We describe an experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a two-bit Boolean function in the framework of one-way quantum computation. For this purpose, a two-photon six-qubit cluster state was engineered. Its peculiar topological structure is the basis of the original measurement pattern allowing the algorithm realization. The good agreement of the experimental results with the theoretical predictions, obtained at $~1$ kHz success rate, demonstrates the correct implementation 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.
Integrity signals
Registry
Cites
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.
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 [16]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 18 · Cited by 26
Research works printed but not linked: 4
- [3]D. Deutsch and R. Jozsa, in Proceedings of the Royal Society of London A (1992), vol. 439, pp. 553-558.
- [7]W.-B. Gao, P. Xu, X.-C. Yao, O. G¨ uhne, A. Cabello, C.-Y. Lu, C.-Z. Peng, Z.-B. Chen, and J.-W. Pan (2009), preprint, [arXiv:0905.2103] . · arXiv
- [8]G. Vallone, G. Donati, R. Ceccarelli, and P. Mataloni (2009), preprint, [arXiv:0911.2365] . · arXiv
- [15]M. Hein, W. D¨ ur, J. Eisert, R. Raussendorf, M. V. den Nes t, and H.-J. Briegel, in Quantum computers, algorithms and chaos , edited by P. Zoller, G. Casati, D. Shepelyansky, and G. Benenti (2006), International School of Physics Enrico Fermi (Varenna, Italy), quant-ph/0602096. · arXiv
- Authors
- Vallone, G., Donati, G., Bruno, N., Chiuri, A., & Mataloni, P.
- Affiliations
- Centro Ricerche Enrico Fermi (IT)
- Sapienza University of Rome (IT)
- National Institute of Optics (IT)
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2010-05-13
- Volume
- 81
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2165658238
- Cited by
- 26
- References
- 18
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 1 · 2023: 2 · 2020: 1 · 2017: 4 · 2016: 1 · 2014: 3 · 2013: 1 · 2012: 7
- FWCI
- 4.06
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- INO Open Portal (submittedVersion)
- IRIS Research product catalog (Sapienza University of Rome) (submittedVersion)
- Padua Research Archive (University of Padova) (submittedVersion)
- arXiv (Cornell University)
- 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-Jozsa algorithm, cluster states, one-way quantum computation, two-photon states, topological structure, Boolean function evaluation, quantum algorithms
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
