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.
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
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
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
Optimal control theory for unitary transformations
Palao, J. P., & Kosloff, R. (2003) · Physical Review A · doi:10.1103/physreva.68.062308 · Cited by 313
A survey of quantum image representations
Yan, F., Iliyasu, A. M., & Venegas-Andraca, S. E. (2016) · Quantum Information Processing · doi:10.1007/s11128-015-1195-6 · Cited by 310
Quantum process tomography of the quantum Fourier transform
Weinstein, Y. S., Havel, T. F., Emerson, J., Boulant, N., Saraceno, M., Lloyd, S., & Cory, D. G. (2004) · The Journal of Chemical Physics · doi:10.1063/1.1785151 · Cited by 178
Self-citationFaster quantum chemistry simulation on fault-tolerant quantum computers
Cody Jones, N., Whitfield, J. D., McMahon, P. L., Yung, M.-H., Meter, R. V., Aspuru-Guzik, A., & Yamamoto, Y. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/11/115023 · Cited by 145
Spin-based optical quantum computation via Pauli blocking in semiconductor quantum dots
Pazy, E., Biolatti, E., Calarco, T., D'Amico, I., Zanardi, P., Rossi, F., & Zoller, P. (2003) · Europhysics Letters (EPL) · doi:10.1209/epl/i2003-00343-4 · Cited by 114
An analytical decomposition protocol for optimal implementation of two-qubit entangling gates
Blaauboer, M., & de Visser, R. L. (2008) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/41/39/395307 · Cited by 20
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.