Polynomial-Time Simulation of Pairing Models on a Quantum Computer
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
We propose a polynomial-time algorithm for simulation of the class of pairing Hamiltonians, e.g., the BCS Hamiltonian, on an NMR quantum computer. The algorithm adiabatically finds the low-lying spectrum in the vicinity of the gap between the ground and the first excited states and provides a test of the applicability of the BCS Hamiltonian to mesoscopic superconducting systems, such as ultrasmall metallic grains.
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Bravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
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
Simulation 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
From quantum cellular automata to quantum lattice gases
Meyer, D. A. (1996) · Journal of Statistical Physics · doi:10.1007/bf02199356 · Cited by 556
Quantum algorithms for fermionic simulations
Ortiz, G., Gubernatis, J. E., Knill, E., & Laflamme, R. (2001) · Physical Review A · doi:10.1103/physreva.64.022319 · Cited by 347
An algorithmic benchmark for quantum information processing
Knill, E., Laflamme, R., Martinez, R., & Tseng, C.-H. (2000) · Nature · doi:10.1038/35006012 · Cited by 290
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
Cited by
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
“A polynomial-time algorithm to model this BCS Hamiltonian has been proposed in (Wang and Yang, 2006; Wu et al., 2002) and a two-qubit version of the algorithm was experimentally realized using NMR (Yang et al.”
MethodQuantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Buluta, I., & Nori, F. (2009) · Science · doi:10.1126/science.1177838 · Cited by 876
Effective Quantum Spin Systems with Trapped Ions
Porras, D., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.207901 · Cited by 872
Towards quantum chemistry on a quantum computer
Lanyon, B. P., Whitfield, J. D., Gillett, G. G., Goggin, M. E., Almeida, M. P., Kassal, I., Biamonte, J. D., Mohseni, M., Powell, B. J., Barbieri, M., et al. (2010) · Nature Chemistry · doi:10.1038/nchem.483 · Cited by 796
Elucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745
“Adiabatic state preparation [81] provides an alternative approach state preparation wherein the Hamiltonian to be simulated is replaced with a time–dependent Hamiltonian whose final ground state coincides with the target ground state and whose initial ground state is an easily preparable state.”
BackgroundSimulation of electronic structure Hamiltonians using quantum computers
Whitfield, J. D., Biamonte, J., & Aspuru-Guzik, A. (2011) · Molecular Physics · doi:10.1080/00268976.2011.552441 · Cited by 472
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383
Simulating Chemistry Using Quantum Computers
Kassal, I., Whitfield, J. D., Perdomo-Ortiz, A., Yung, M.-H., & Aspuru-Guzik, A. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103512 · Cited by 352
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
NMR Implementation of a Molecular Hydrogen Quantum Simulation with Adiabatic State Preparation
Du, J., Xu, N., Peng, X., Wang, P., Wu, S., & Lu, D. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.030502 · Cited by 274
From transistor to trapped-ion computers for quantum chemistry
Yung, M.-H., Casanova, J., Mezzacapo, A., McClean, J., Lamata, L., Aspuru-Guzik, A., & Solano, E. (2014) · Scientific Reports · doi:10.1038/srep03589 · Cited by 221
Low rank representations for quantum simulation of electronic structure
Motta, M., Ye, E., McClean, J. R., Li, Z., Minnich, A. J., Babbush, R., & Chan, G. K.-L. (2018) · arXiv · doi:10.48550/arxiv.1808.02625 · Cited by 173
Faster 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
Using Quantum Computers for Quantum Simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2010) · Entropy · doi:10.3390/e12112268 · Cited by 129
“[37] developed a detailed method for quantum simulation of Equation (20).”
BackgroundMethodMeasurement reduction in variational quantum algorithms
Zhao, A., Tranter, A., Kirby, W. M., Ung, S. F., Miyake, A., & Love, P. J. (2020) · Physical Review A · doi:10.1103/physreva.101.062322 · Cited by 121
Brown, K. R., Clark, R. J., & Chuang, I. L. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.050504 · Cited by 98
Quantum-circuit design for efficient simulations of many-body quantum dynamics
Raeisi, S., Wiebe, N., & Sanders, B. C. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/10/103017 · Cited by 72
Computational complexity in electronic structure
Whitfield, J. D., Love, P. J., & Aspuru-Guzik, A. (2013) · Phys. Chem. Chem. Phys. · doi:10.1039/c2cp42695a · Cited by 71
Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance
Li, Z., Yung, M.-H., Chen, H., Lu, D., Whitfield, J. D., Peng, X., Aspuru-Guzik, A., & Du, J. (2011) · Scientific Reports · doi:10.1038/srep00088 · Cited by 63
Kendon, V. M., Nemoto, K., & Munro, W. J. (2010) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2010.0017 · Cited by 41
Lidar, D. A. (2004) · New Journal of Physics · doi:10.1088/1367-2630/6/1/167 · Cited by 33
Self-citation
Metadata
- Authors
- Wu, L.-A., Byrd, M. S., & Lidar, D. A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2002-07-16
- Volume
- 89
- Issue
- 5
- Pages
- 057904-057904
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2061741118
- Cited by
- 108
- References
- 11
- FWCI
- 3.68
- 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.