Quantum simulation of a three-body-interaction Hamiltonian on an NMR quantum computer
Open accessThe DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
Extensions of average Hamiltonian theory to quantum computation permit the design of arbitrary Hamiltonians, allowing rotations throughout a large Hilbert space. In this way, the kinematics and dynamics of any quantum system may be simulated by a quantum computer. A basis mapping between the systems dictates the average Hamiltonian in the quantum computer needed to implement the desired Hamiltonian in the simulated system. The flexibility of the procedure is illustrated with NMR on ${}^{13}\mathrm{C}$ labeled alanine by creating the nonphysical Hamiltonian ${\ensuremath{\sigma}}_{z}{\ensuremath{\sigma}}_{z}{\ensuremath{\sigma}}_{z}$ corresponding to a three-body interaction.
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
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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Self-citationBulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Cited by
Khaneja, N., Reiss, T., Kehlet, C., Schulte-Herbrüggen, T., & Glaser, S. J. (2005) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2004.11.004 · Cited by 1,854
“The corresponding pulse sequences [39, 40] are considerably shorter than conventional implementations of these unitary propagators [34, 35, 41, 42].”
BackgroundExperimental Realization of Nonadiabatic Holonomic Quantum Computation
Feng, G., Xu, G., & Long, G. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.190501 · Cited by 432
Lloyd, S. (2000) · Physical Review A · doi:10.1103/physreva.62.022108 · Cited by 389
Can one trust quantum simulators?
Hauke, P., Cucchietti, F. M., Tagliacozzo, L., Deutsch, I., & Lewenstein, M. (2012) · Reports on Progress in Physics · doi:10.1088/0034-4885/75/8/082401 · Cited by 315
Wu, H., Wang, Y., Gong, W. J., Han, Y., & Chen, X. H. (2013) · The European Physical Journal B · doi:10.1140/epjb/e2012-30793-6 · Cited by 241
Fidelity Decay as an Efficient Indicator of Quantum Chaos
Emerson, J., Weinstein, Y. S., Lloyd, S., & Cory, D. G. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.284102 · Cited by 147
Self-citationUsing Quantum Computers for Quantum Simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2010) · Entropy · doi:10.3390/e12112268 · Cited by 129
“[98] describe how to simulate a general three-body interaction using only the ZZ interaction present in NMR, and experimentally demonstrated a ZZZ interaction.”
BackgroundQuantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-32041-5_13 · Cited by 47
Hamiltonian gadgets with reduced resource requirements
Cao, Y., Babbush, R., Biamonte, J., & Kais, S. (2015) · Physical Review A · doi:10.1103/physreva.91.012315 · Cited by 35
“We note that these gadgets solve a different problem than the type of many-body operator simulations considered previously [17, 18] for gate model quantum computation, where the techniques developed therein are not directly applicable to our situation.”
BackgroundEstimating Franck-Condon factors using an NMR quantum processor
Joshi, S., Shukla, A., Katiyar, H., Hazra, A., & Mahesh, T. S. (2014) · Physical Review A · doi:10.1103/physreva.90.022303 · Cited by 20
Metadata
- Authors
- Tseng, C. H., Somaroo, S., Sharf, Y., Knill, E., Laflamme, R., Havel, T. F., & Cory, D. G.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1999-12-10
- Volume
- 61
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2060833438
- Cited by
- 131
- References
- 20
- FWCI
- 6.92
- 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.