The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Quantum computing in molecular magnets
Open accessAbstract
Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers and in searching a database by exploiting the parallelism of quantum mechanics. Whereas Shor's algorithm requires both superposition and entanglement of a many-particle system, the superposition of single-particle quantum states is sufficient for Grover's algorithm. Recently, the latter has been successfully implemented using Rydberg atoms. Here we propose an implementation of Grover's algorithm that uses molecular magnets, which are solid-state systems with a large spin; their spin eigenstates make them natural candidates for single-particle systems. We show theoretically that molecular magnets can be used to build dense and efficient memory devices based on the Grover algorithm. In particular, one single crystal can serve as a storage unit of a dynamic random access memory device. Fast electron spin resonance pulses can be used to decode and read out stored numbers of up to 105, with access times as short as 10-10 seconds. We show that our proposal should be feasible using the molecular magnets Fe8 and Mn12.
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Macroscopic quantum tunnelling of magnetization in a single crystal of nanomagnets
Thomas, L., Lionti, F., Ballou, R., Gatteschi, D., Sessoli, R., & Barbara, B. (1996) · Nature · doi:10.1038/383145a0 · Cited by 1,978
Cohen-Tannoudji, C. N., & Laloë, F. (1977) · Cited by 1,886
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
Quantum Tunneling of the Magnetization in an Iron Cluster Nanomagnet
Sangregorio, C., Ohm, T., Paulsen, C., Sessoli, R., & Gatteschi, D. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.4645 · Cited by 717
Quantum Computers Can Search Arbitrarily Large Databases by a Single Query
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.4709 · Cited by 432
Information Storage and Retrieval Through Quantum Phase
Ahn, J., Weinacht, T. C., & Bucksbaum, P. H. (2000) · Science · doi:10.1126/science.287.5452.463 · Cited by 286
Spin tunneling and phonon-assisted relaxation inMn12-acetate
Leuenberger, M. N., & Loss, D. (2000) · Physical Review B · doi:10.1103/physrevb.61.1286 · Cited by 189
Self-citationNonadiabatic Landau-Zener tunneling in Fe 8 molecular nanomagnets
Wernsdorfer, W., Sessoli, R., Caneschi, A., Gatteschi, D., & Cornia, A. (2000) · Europhysics Letters (EPL) · doi:10.1209/epl/i2000-00305-x · Cited by 159
Quantum search without entanglement
Lloyd, S. (1999) · Physical Review A · doi:10.1103/physreva.61.010301 · Cited by 149
Thiaville, A., & Miltat, J. (1999) · Science · doi:10.1126/science.284.5422.1939 · Cited by 76
Incoherent Zener tunneling and its application to molecular magnets
Leuenberger, M. N., & Loss, D. (2000) · Physical review. B, Condensed matter · doi:10.1103/physrevb.61.12200 · Cited by 60
Self-citation
Cited by
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Quantum Tunneling of Magnetization and Related Phenomena in Molecular Materials
Gatteschi, D., & Sessoli, R. (2003) · Angewandte Chemie International Edition · doi:10.1002/anie.200390099 · Cited by 2,808
Lanthanide Single-Molecule Magnets
Woodruff, D. N., Winpenny, R. E. P., & Layfield, R. A. (2013) · Chemical Reviews · doi:10.1021/cr400018q · Cited by 2,781
Molecular-Scale Electronics: From Concept to Function
Xiang, D., Wang, X., Jia, C., Lee, T., & Guo, X. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.5b00680 · Cited by 1,336
Sanvito, S. (2011) · Chemical Society Reviews · doi:10.1039/c1cs15047b · Cited by 1,325
Metadata
- Authors
- Leuenberger, M. N., & Loss, D.
- Venue
- Nature
- Published
- 2001-04
- Volume
- 410
- Issue
- 6830
- Pages
- 789-793
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1823409394
- Cited by
- 2,987
- References
- 12
- FWCI
- 41.35
- 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.