Deutsch-Jozsa algorithm as a test of quantum computation
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
A redundancy in the existing Deutsch-Jozsa quantum algorithm is removed and a refined algorithm, which reduces the size of the register and simplifies the function evaluation, is proposed. The refined version allows a simpler analysis of the use of entanglement between the qubits in the algorithm and provides criteria for deciding when the Deutsch-Jozsa algorithm constitutes a meaningful test of quantum computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rapid solution of problems by quantum computation
Deutsch, D., & Jozsa, R. (1992) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1992.0167 · Cited by 2,700
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
Experimental Implementation of Fast Quantum Searching
Chuang, I. L., Gershenfeld, N., & Kubinec, M. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.3408 · Cited by 707
Experimental realization of a quantum algorithm
Chuang, I. L., Vandersypen, L. M. K., Zhou, X., Leung, D. W., & Lloyd, S. (1998) · Nature · doi:10.1038/30181 · Cited by 604
Experimental Quantum Error Correction
Cory, D. G., Price, M. D., Maas, W., Knill, E., Laflamme, R., Zurek, W. H., Havel, T. F., & Somaroo, S. S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.2152 · Cited by 581
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Jones, J. A. (2001) · Progress in Nuclear Magnetic Resonance Spectroscopy · doi:10.1016/s0079-6565(00)00033-9 · Cited by 177
Patel, T., Potharaju, A., Li, B., Roy, R. B., & Tiwari, D. (2020) · SC20: International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc41405.2020.00050 · Cited by 37
Minimal state tomography of spatial qubits using a spatial light modulator
Pimenta, W. M., Marques, B., Carvalho, M. A., Barros, M. R., Fonseca, J. G., Ferraz, J., Terra Cunha, M., & Pádua, S. (2010) · Optics Express · doi:10.1364/oe.18.024423 · Cited by 30
Controllability and universal three-qubit quantum computation with trapped electron states
Pedersen, L. H., & Rangan, C. (2008) · Quantum Information Processing · doi:10.1007/s11128-007-0070-5 · Cited by 10
Metadata
- Authors
- Collins, D., Kim, K. W., & Holton, W. C.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1998-09-01
- Volume
- 58
- Issue
- 3
- Pages
- R1633-R1636
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1996143597
- Cited by
- 140
- References
- 6
- FWCI
- 8.31
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Deutsch-Jozsa algorithm as a test of quantum computation. https://app.cochat.ai/papers/10.1103/physreva.58.r1633
- The paper
- Collins, D., Kim, K. W., & Holton, W. C. (1998). Deutsch-Jozsa algorithm as a test of quantum computation. Physical Review A. https://doi.org/10.1103/physreva.58.r1633
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.