The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Complete 3-Qubit Grover search on a programmable quantum computer
Open accessAbstract
The Grover quantum search algorithm is a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.
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
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470
Experimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273 · cited 3×
“8(9) 70(1) 70(1) 73(1) 73(1) 72(1) 73(1) 81(1) 82(1) 80(1) 79(1) 79(1) 78(1) 71(1) 72(1) 79(1) 79(1) 73(1) 74(1) 69(1) 69(1) 79(1) 79(1) 72(1) 74.”
InfluentialDemonstration of a small programmable quantum computer with atomic qubits
Debnath, S., Linke, N. M., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2016) · Nature · doi:10.1038/nature18648 · Cited by 777
Self-citationDemonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
Manipulation and detection of a trappedYb+hyperfine qubit
Olmschenk, S., Younge, K. C., Moehring, D. L., Matsukevich, D. N., Maunz, P., & Monroe, C. (2007) · Physical Review A · doi:10.1103/physreva.76.052314 · Cited by 464
Self-citationNuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing
Cory, D. G., Price, M. D., & Havel, T. F. (1998) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00046-3 · Cited by 419
Maslov, D. (2016) · Physical Review A · doi:10.1103/physreva.93.022311 · Cited by 193
Self-citationImplementation of a three-quantum-bit search algorithm
Vandersypen, L. M. K., Steffen, M., Sherwood, M. H., Yannoni, C. S., Breyta, G., & Chuang, I. L. (2000) · Applied Physics Letters · doi:10.1063/1.125846 · Cited by 131
Cited by
Trapped-ion quantum computing: Progress and challenges
Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019) · Applied Physics Reviews · doi:10.1063/1.5088164 · Cited by 1,483
Parallel Implementation of High-Fidelity Multiqubit Gates with Neutral Atoms
Levine, H., Keesling, A., Semeghini, G., Omran, A., Wang, T. T., Ebadi, S., Bernien, H., Greiner, M., Vuletić, V., Pichler, H., et al. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.170503 · Cited by 604
Multi-qubit entanglement and algorithms on a neutral-atom quantum computer
Graham, T. M., Song, Y., Scott, J., Poole, C., Phuttitarn, L., Jooya, K., Eichler, P., Jiang, X., Marra, A., Grinkemeyer, B., et al. (2022) · Nature · doi:10.1038/s41586-022-04603-6 · Cited by 518
Quantum simulation and computing with Rydberg-interacting qubits
Morgado, M., & Whitlock, S. (2021) · AVS Quantum Science · doi:10.1116/5.0036562 · Cited by 370
Shuttling-based trapped-ion quantum information processing
Kaushal, V., Lekitsch, B., Stahl, A., Hilder, J., Pijn, D., Schmiegelow, C., Bermudez, A., Müller, M., Schmidt-Kaler, F., & Poschinger, U. (2020) · AVS Quantum Science · doi:10.1116/1.5126186 · Cited by 141
Metadata
- Authors
- Figgatt, C., Maslov, D., Landsman, K. A., Linke, N. M., Debnath, S., & Monroe, C.
- Venue
- Nature Communications
- Published
- 2017-12-04
- Volume
- 8
- Issue
- 1
- Pages
- 1918-1918
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W2604388771
- Cited by
- 235
- References
- 11
- FWCI
- 10.66
- Type
- journal article
- Language
- en
- Open access
- gold
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: Complete 3-Qubit Grover search on a programmable quantum computer. https://app.cochat.ai/papers/10.1038/s41467-017-01904-7
- The paper
- Figgatt, C., Maslov, D., Landsman, K. A., Linke, N. M., Debnath, S., & Monroe, C. (2017). Complete 3-Qubit Grover search on a programmable quantum computer. Nature Communications. https://doi.org/10.1038/s41467-017-01904-7
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.