The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Implementation of the Quantum Fourier Transform
Open accessAbstract
A quantum Fourier transform (QFT) has been implemented on a three qubit nuclear magnetic resonance (NMR) quantum computer to extract the periodicity of an input state. Implementation of a QFT provides a first step towards the realization of Shor's factoring and other quantum algorithms. The experimental implementation of the QFT on a periodic state is presented along with a quantitative measure of its efficiency measured through state tomography. Experimentally realizing the QFT is a clear demonstration of the ability of NMR to control quantum systems.
Overview
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
Verification
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.
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“For example, quantum computers, if constructed, could factor large numbers more rapidly [1], search data basis more quickly [2], and simulate quantum systems more efficiently [3] than is possible using current classical algorithms [4] [5] [6] [7] [8] [9] [10] [11].”
BackgroundSelf-citationFidelity for Mixed Quantum States
Jozsa, R. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552171 · Cited by 1,911
Protein NMR Spectroscopy: Principles and Practice
Cavanagh, J. (1995) · Cited by 1,636
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
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
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Protein NMR Spectroscopy. Principles and Practice
Kalbitzer, H. R. (1997) · Zeitschrift für Physikalische Chemie · doi:10.1524/zpch.1997.202.part_1_2.297 · Cited by 971
Ensemble quantum computing by NMR spectroscopy
Cory, D. G., Fahmy, A. F., & Havel, T. F. (1997) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.94.5.1634 · Cited by 964
Self-citationSending entanglement through noisy quantum channels
Schumacher, B. (1996) · Physical Review A · doi:10.1103/physreva.54.2614 · Cited by 823
Quantum Algorithm Providing Exponential Speed Increase for Finding Eigenvalues and Eigenvectors
Abrams, D. S., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.5162 · Cited by 817
Self-citationSimulation of Many-Body Fermi Systems on a Universal Quantum Computer
Abrams, D. S., & Lloyd, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2586 · Cited by 745
Self-citationSimulating Physics with Computers
Feynman, R. P. (2018) · Feynman and Computation · doi:10.1201/9780429500459-11 · Cited by 731
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Self-citationExperimental 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
Self-citationImplementation of a quantum search algorithm on a quantum computer
Jones, J. A., Mosca, M., & Hansen, R. H. (1998) · Nature · doi:10.1038/30687 · Cited by 558
Simulating quantum systems on a quantum computer
Zalka, C. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0162 · Cited by 390
Resilient quantum computation: error models and thresholds
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346
An approximate Fourier transform useful in quantum factoring
Coppersmith, D. (2002) · arXiv · doi:10.48550/arxiv.quant-ph/0201067 · Cited by 343
Resilient Quantum Computation: Error Models and Thresholds
Knill, E. H., Laflamme, R., & Zurek, W. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 296
The quantized Baker's transformation
Balazs, N. L., & Voros, A. (1989) · Annals of Physics · doi:10.1016/0003-4916(89)90259-5 · Cited by 221
Quantum algorithms and the Fourier transform
Jozsa, R. (1998) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.1998.0163 · Cited by 217
Quantum Simulations on a Quantum Computer
Somaroo, S., Tseng, C. H., Havel, T. F., Laflamme, R., & Cory, D. G. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.5381 · Cited by 180
Self-citationSimulations of Many-Body Quantum Systems by a Quantum ComputerPreprint
Wiesner, S. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9603028 · Cited by 155
Quantum algorithms and the Fourier transform
Jozsa, R. (1997) · Cited by 149
Efficient Simulation of Quantum Systems by Quantum Computers
Zalka, C. (1998) · Fortschritte der Physik · doi:10.1002/(sici)1521-3978(199811)46:6/8<877::aid-prop877>3.0.co;2-a · Cited by 110
Using a quantum computer to investigate quantum chaos
Schack, R. (1998) · Physical Review A · doi:10.1103/physreva.57.1634 · Cited by 105
Quantum chaos: a decoherent definition
Zurek, W. H., & Paz, J. P. (1995) · CERN Document Server (European Organization for Nuclear Research) · Cited by 94
Expressing the operations of quantum computing in multiparticle geometric algebra
Somaroo, S. S., Cory, D. G., & Havel, T. F. (1998) · Physics Letters A · doi:10.1016/s0375-9601(98)00010-3 · Cited by 75
Self-citation
Cited by
Information and computation: Classical and quantum aspects
Galindo, A., & Martín-Delgado, M. A. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.347 · Cited by 552
Colloquium: Coherently controlled adiabatic passage
Král, P., Thanopulos, I., & Shapiro, M. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.53 · Cited by 444
Altepeter, J. B., Jeffrey, E. R., & Kwiat, P. G. (2005) · Advances In Atomic, Molecular, and Optical Physics · doi:10.1016/s1049-250x(05)52003-2 · Cited by 365
Quantum Computing by an Optimal Control Algorithm for Unitary Transformations
Palao, J. P., & Kosloff, R. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.188301 · Cited by 343
Implementing the Quantum von Neumann Architecture with Superconducting Circuits
Mariantoni, M., Wang, H., Yamamoto, T., Neeley, M., Bialczak, R. C., Chen, Y., Lenander, M., Lucero, E., O’Connell, A. D., Sank, D., et al. (2011) · Science · doi:10.1126/science.1208517 · Cited by 323
Metadata
- Authors
- Weinstein, Y. S., Pravia, M. A., Fortunato, E. M., Lloyd, S., & Cory, D. G.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2001-02-26
- Volume
- 86
- Issue
- 9
- Pages
- 1889-1891
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1999090492
- Cited by
- 287
- References
- 33
- FWCI
- 17.65
- 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
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.