Quantum simulations of physics problems
Open accessThe DOI matches its Crossref record; 1 of the 1 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 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 showing 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
From quantum cellular automata to quantum lattice gases
Meyer, D. A. (1996) · Journal of Statistical Physics · doi:10.1007/bf02199356 · Cited by 556
Cited by
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
“The preparation of N -particle fermionic states of the form: |ψ(0)〉 = N∏ j=1 b†j |vac〉 , (2) where |vac〉 is the vacuum state and b†j and bj are the fermionic creation and annihilation operators, was discussed in (Ortiz et al., 2001, 2002; Somma et al., 2002, 2003).”
BackgroundQuantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
Sawaya, N. P. D., Menke, T., Kyaw, T. H., Johri, S., Aspuru-Guzik, A., & Guerreschi, G. G. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0278-0 · Cited by 163
Using Quantum Computers for Quantum Simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2010) · Entropy · doi:10.3390/e12112268 · Cited by 129
“[84] discuss in detail how to map physical particles onto spin-1/2 systems.”
BackgroundMethodVariational Quantum Classifier for Binary Classification: Real vs Synthetic Dataset
Maheshwari, D., Sierra-Sosa, D., & Garcia-Zapirain, B. (2022) · IEEE Access · doi:10.1109/access.2021.3139323 · Cited by 108
Metadata
- Authors
- Somma, R. D., Ortiz, G., Knill, E. H., & Gubernatis, J.
- Venue
- SPIE Proceedings
- Publisher
- SPIE
- Published
- 2003-08-05
- Volume
- 5105
- Pages
- 96
- ISSN
- 0277-786X (ISSN-L)
- OpenAlex
- W1996689031
- Cited by
- 53
- References
- 1
- FWCI
- 0.25
- Type
- conference paper
- 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
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.1117/12.487249
- The paper
- Somma, R. D., Ortiz, G., Knill, E. H., & Gubernatis, J. (2003). Quantum simulations of physics problems. SPIE Proceedings. https://doi.org/10.1117/12.487249
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.