The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Real- and Imaginary-Time Evolution with Compressed Quantum Circuits
Open accessAbstract
The current generation of noisy intermediate-scale quantum computers introduces new opportunities to study quantum many-body systems.In this paper, we show that quantum circuits can provide a dramatically more efficient representation than current classical numerics of the quantum states generated under nonequilibrium quantum dynamics.For quantum circuits, we perform both real-and imaginary-time evolution using an optimization algorithm that is feasible on near-term quantum computers.We benchmark the algorithms by finding the ground state and simulating a global quench of the transverse-field Ising model with a longitudinal field on a classical computer.Furthermore, we implement (classically optimized) gates on a quantum processing unit and demonstrate that our algorithm effectively captures real-time evolution.
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 supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Density matrix formulation for quantum renormalization groups
White, S. R. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2863 · Cited by 7,702
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Structural absorption by barbule microstructures of super black bird of paradise feathers
McCoy, D. E., Feo, T., Harvey, T. A., & Prum, R. O. (2018) · Nature Communications · doi:10.1038/s41467-017-02088-w · Cited by 7,424
The density-matrix renormalization group in the age of matrix product states
Schollwöck, U. (2011) · Annals of Physics · doi:10.1016/j.aop.2010.09.012 · Cited by 4,818
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 3×
“[32] Alberto Peruzzo, Jarrod McClean, Peter Shadbolt, ManHong Yung, Xiao-Qi Zhou, Peter J Love, Alán AspuruGuzik, and Jeremy L OâĂŹbrien, “A variational eigenvalue solver on a photonic quantum processor,” Nature communications 5, 4213 (2014).”
BackgroundMethodInfluentialThe 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
Solving the quantum many-body problem with artificial neural networks
Carleo, G., & Troyer, M. (2017) · Science · doi:10.1126/science.aag2302 · Cited by 2,215 · cited 2×
“For systems without the infamous sign problem, quantumMonte Carlo techniques represent a powerful tool [1, 4].”
BackgroundMethodEfficient Simulation of One-Dimensional Quantum Many-Body Systems
Vidal, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040502 · Cited by 1,779
Mitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639
Cited by
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
Topological non-Hermitian skin effect
Lin, R., Tai, T., Li, L., & Lee, C. H. (2023) · Frontiers of Physics · doi:10.1007/s11467-023-1309-z · Cited by 304
Challenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
Hardware-efficient variational quantum algorithms for time evolution
Benedetti, M., Fiorentini, M., & Lubasch, M. (2020) · arXiv · doi:10.48550/arxiv.2009.12361 · Cited by 176
Parallel quantum simulation of large systems on small NISQ computers
Barratt, F., Dborin, J., Bal, M., Stojevic, V., Pollmann, F., & Green, A. G. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00420-3 · Cited by 111
Self-citationAn efficient quantum algorithm for the time evolution of parameterized circuits
Barison, S., Vicentini, F., & Carleo, G. (2021) · Quantum · doi:10.22331/q-2021-07-28-512 · Cited by 110
Neural predictor based quantum architecture search
Zhang, S.-X., Hsieh, C.-Y., Zhang, S., & Yao, H. (2021) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/ac28dd · Cited by 88
Holographic dynamics simulations with a trapped-ion quantum computer
Chertkov, E., Bohnet, J., Francois, D., Gaebler, J., Gresh, D., Hankin, A., Lee, K., Hayes, D., Neyenhuis, B., Stutz, R., et al. (2022) · Nature Physics · doi:10.1038/s41567-022-01689-7 · Cited by 53
Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization
Romero, S. V., Visuri, A.-M., Cadavid, A. G., Simen, A., Solano, E., & Hegade, N. N. (2025) · Communications Physics · doi:10.1038/s42005-025-02270-3 · Cited by 18
“They were developed over the past three decades mostly for the study of condensed-matter physics [21, 23] and have been adopted as e ffi cient simulators of quantum hardware, as classical benchmarks for quantum algorithms, and in hybrid approaches combining TNs and quantum algorithms [24–27].”
Metadata
- Authors
- Lin, S.-H., Dilip, R., Green, A. G., Smith, A., & Pollmann, F.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2021-03-15
- Volume
- 2
- Issue
- 1
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W3080410339
- Cited by
- 206
- References
- 28
- FWCI
- 12.09
- Type
- journal article
- Language
- en
- Open access
- gold
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.