The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Digitization of scalar fields for quantum computing
Open accessAbstract
Qubit, operator, and gate resources required for the digitization of lattice $\ensuremath{\lambda}{\ensuremath{\phi}}^{4}$ scalar field theories onto quantum computers are considered, building upon the foundational work by Jordan et al. [Quantum Inf. Comput. 14, 1014 (2014); Science 336, 1130 (2012)], with a focus towards noisy intermediate-scale quantum devices. The Nyquist-Shannon sampling theorem, introduced in this context by Macridin et al. [Phys. Rev. A 98, 042312 (2018)] building on the work of Somma [Quantum Inf. Comput. 16, 1125 (2016)], provides a guide with which to evaluate the efficacy of two field-space bases, the eigenstates of the field operator, as used by Jordan et al., and eigenstates of a harmonic oscillator, to describe ($0+1$)- and ($d+1$)-dimensional scalar field theory. We show how techniques associated with improved actions, which are heavily utilized in lattice QCD calculations to systematically reduce lattice-spacing artifacts, can be used to reduce the impact of the field digitization in $\ensuremath{\lambda}{\ensuremath{\phi}}^{4}$, but are found to be inferior to a complete digitization improvement of the Hamiltonian using a quantum Fourier transform. When the Nyquist-Shannon sampling theorem is satisfied, digitization errors scale as $|log|log|{\ensuremath{\epsilon}}_{\mathrm{dig}}|||\ensuremath{\sim}{n}_{Q}$ (number of qubits describing the field at a given spatial site) for the low-lying states, leaving the familiar power-law lattice-spacing and finite-volume effects that scale as $|log|{\ensuremath{\epsilon}}_{\mathrm{latt}}||\ensuremath{\sim}{N}_{Q}$ (total number of qubits in the simulation). For localized (delocalized) field-space wave functions, it is found that ${n}_{Q}\ensuremath{\sim}4(7)$ qubits per spatial lattice site are sufficient to reduce theoretical digitization errors below error contributions associated with approximation of the time-evolution operator and noisy implementation on near-term quantum devices. Only classical computing resources have been used to obtain the results presented in this work.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Colman (2022) · doi:10.1073/pnas · Cited by 4,370
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Scalable Quantum Simulation of Molecular Energies
O’Malley, P. J. J., Babbush, R., Kivlichan, I. D., Romero, J., McClean, J. R., Barends, R., Kelly, J., Roushan, P., Tranter, A., Ding, N., et al. (2016) · Physical Review X · doi:10.1103/physrevx.6.031007 · Cited by 1,059
Bravyi, S. B., & Kitaev, A. Y. (2002) · Annals of Physics · doi:10.1006/aphy.2002.6254 · Cited by 1,033
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
Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
Kivlichan, I. D., McClean, J., Wiebe, N., Gidney, C., Aspuru-Guzik, A., Chan, G. K.-L., & Babbush, R. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.110501 · Cited by 431
Quantum computations on a topologically encoded qubit
Nigg, D., Müller, M., Martinez, E. A., Schindler, P., Hennrich, M., Monz, T., Martin-Delgado, M. A., & Blatt, R. (2014) · Science · doi:10.1126/science.1253742 · Cited by 400
Cloud Quantum Computing of an Atomic Nucleus
Dumitrescu, E. F., McCaskey, A. J., Hagen, G., Jansen, G. R., Morris, T. D., Papenbrock, T., Pooser, R. C., Dean, D. J., & Lougovski, P. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.210501 · Cited by 393
Twist-averaged boundary conditions in continuum quantum Monte Carlo algorithms
Lin, C., Zong, F. H., & Ceperley, D. M. (2001) · Physical Review E · doi:10.1103/physreve.64.016702 · Cited by 371
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
Low-Depth Quantum Simulation of Materials
Babbush, R., Wiebe, N., McClean, J., McClain, J., Neven, H., & Chan, G. K.-L. (2018) · Physical Review X · doi:10.1103/physrevx.8.011044 · Cited by 335
Gate-count estimates for performing quantum chemistry on small quantum computers
Wecker, D., Bauer, B., Clark, B. K., Hastings, M. B., & Troyer, M. (2014) · Physical Review A · doi:10.1103/physreva.90.022305 · Cited by 296
Learning the quantum algorithm for state overlap
Cincio, L., Subaşı, Y., Sornborger, A. T., & Coles, P. J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aae94a · Cited by 282
Chemical basis of Trotter-Suzuki errors in quantum chemistry simulation
Babbush, R., McClean, J., Wecker, D., Aspuru-Guzik, A., & Wiebe, N. (2015) · Physical Review A · doi:10.1103/physreva.91.022311 · Cited by 199
Fault-tolerant quantum computation with few qubits
Chao, R., & Reichardt, B. W. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0085-z · Cited by 137
Exploiting Locality in Quantum Computation for Quantum Chemistry
McClean, J. R., Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · The Journal of Physical Chemistry Letters · doi:10.1021/jz501649m · Cited by 125
Cited by
Robust data encodings for quantum classifiers
LaRose, R., & Coyle, B. (2020) · Physical Review A · doi:10.1103/physreva.102.032420 · Cited by 326
Quantum Simulation for High-Energy Physics
Bauer, C. W., Davoudi, Z., Balantekin, A. B., Bhattacharya, T., Carena, M., de Jong, W. A., Draper, P., El-Khadra, A., Gemelke, N., Hanada, M., et al. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.027001 · Cited by 326
Self-citation
Metadata
- Authors
- Klco, N., & Savage, M. J.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2019-05-23
- Volume
- 99
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2944838167
- Cited by
- 167
- References
- 21
- FWCI
- 11.17
- 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.