Quantum Simulations of Physics Problems
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not efficiently simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical "questions" more efficiently. The existence of one-to-one mappings between different algebras of observables or between different Hilbert spaces allow us to represent and imitate any physical system by any other one (e.g. a bosonic system by a spin-1/2 system). We explain how these mappings can be performed, and we show quantum networks useful for the efficient evaluation of some physical properties, such as correlation functions and energy spectra.
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
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597
Research works printed but not linked: 8
- Ortiz G., Phys. Rev. A., 64, 042323
- 10.1016/S0010-4655(02)00420-4 · DOI
- 10.1103/PhysRevA.65.022319 · doi:10.1103/physreva.65.022319
- 10.1103/PhysRevLett.86.1082 · DOI · Paper page
- Nielsen M. A., 2000, Quantum Computation and Quantum Information
- Blaizot J., 1986, Quantum Theory of Finite Systems
- 10.1142/2262 · DOI · Paper page
- 10.1007/978-3-642-61629-7 · DOI · Paper page
Cited by
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
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
A Multireference Quantum Krylov Algorithm for Strongly Correlated Electrons
Stair, N. H., Huang, R., & Evangelista, F. A. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b01125 · Cited by 183
Metadata
- Authors
- Somma, R., Ortiz, G., Knill, E., & Gubernatis, J.
- Venue
- International Journal of Quantum Information
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2003-06
- Volume
- 01
- Issue
- 02
- Pages
- 189-206
- ISSN
- 0219-7499 (ISSN-L)
- 1793-6918
- OpenAlex
- W4240512022
- Cited by
- 85
- References
- 2
- FWCI
- 1.06
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum Simulations of Physics Problems. https://app.cochat.ai/papers/10.1142/s0219749903000140
- The paper
- Somma, R., Ortiz, G., Knill, E., & Gubernatis, J. (2003). Quantum Simulations of Physics Problems. International Journal of Quantum Information. https://doi.org/10.1142/s0219749903000140
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.