Subspace variational quantum simulator
Open accessPublished version of a preprint
The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
Quantum simulation is one of the key applications of quantum computing, which accelerates research and development in the fields such as chemistry and material science. The recent development of noisy intermediate-scale quantum (NISQ) devices urges the exploration of applications without the necessity of quantum error correction. In this paper, we propose an efficient method to simulate quantum dynamics driven by a static Hamiltonian on NISQ devices, named subspace variational quantum simulator (SVQS). SVQS employs the subspace-search variational quantum eigensolver (SSVQE) [Phys. Rev. Res. 1, 033062 (2019)] to find a low-lying eigensubspace and extends it to simulate dynamics within the subspace with lower overhead compared to the existing schemes. We experimentally simulate the time-evolution operator in a low-lying eigensubspace of a hydrogen molecule. We also define the subspace process fidelity as a measure between two quantum processes in a subspace. The subspace time evolution mimicked by SVQS shows the subspace process fidelity of $0.896\text{--}0.989$.
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
Powell, M. J. D. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.155 · Cited by 4,632
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 1×
“These algorithms, such as variational quantum eigen-solvers [21–24], generally do not guarantee the accuracy of solutions but can be feasibly implemented on NISQ devices.”
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385 · cited 1×
“A suitable approach for NISQ devices is quantum– classical hybrid algorithms that utilize a variational ∗ kheya@qc.rcast.u-tokyo.ac.jp method and shallow parameterized quantum circuits [20].”
Self-citationQuantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“The relationship between SSVQE, which gives the desired map, and SVQS, which utilizes the map, is similar to the relationship between quantum phase estimation [75–77] and HHL algorithm [78].”
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
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
Georgescu, I. M., Ashhab, S., & Nori, F. (2014) · Reviews of Modern Physics · doi:10.1103/revmodphys.86.153 · Cited by 2,932
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597 · cited 1×
“In applications for quantum chemistry, Jordan-Wigner [33] or Bravyi-Kitaev [34] transformation can be utilized to map a fermionic Hamiltonian to an n -qubit Hamiltonian.”
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
Cited by
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
Quantum 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
Cost function dependent barren plateaus in shallow parametrized quantum circuits
Cerezo, M., Sone, A., Volkoff, T., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-21728-w · Cited by 1,047
Programmable Quantum Simulations of Spin Systems with Trapped Ions
Monroe, C., Campbell, W. C., Duan, L. M., Gong, Z. X., Gorshkov, A. V., Hess, P., Islam, R., Kim, K., Linke, N., Pagano, G., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.07845 · Cited by 806
Programmable quantum simulations of spin systems with trapped ions
Monroe, C., Campbell, W. C., Duan, L.-M., Gong, Z.-X., Gorshkov, A. V., Hess, P. W., Islam, R., Kim, K., Linke, N. M., Pagano, G., et al. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025001 · Cited by 802
Noise-induced barren plateaus in variational quantum algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-27045-6 · Cited by 773
Connecting Ansatz Expressibility to Gradient Magnitudes and Barren Plateaus
Holmes, Z., Sharma, K., Cerezo, M., & Coles, P. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010313 · Cited by 570
“[14] Kentaro Heya, Ken M Nakanishi, Kosuke Mitarai, and Keisuke Fujii, “Subspace variational quantum simulator,” arXiv preprint arXiv:1904.”
BackgroundVariational Quantum Linear Solver
Bravo-Prieto, C., LaRose, R., Cerezo, M., Subasi, Y., Cincio, L., & Coles, P. J. (2023) · Quantum · doi:10.22331/q-2023-11-22-1188 · Cited by 260
Variational fast forwarding for quantum simulation beyond the coherence time
Cîrstoiu, C., Holmes, Z., Iosue, J., Cincio, L., Coles, P. J., & Sornborger, A. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00302-0 · Cited by 232
Efficient quantum measurement of Pauli operators in the presence of finite sampling error
Crawford, O., Straaten, B. V., Wang, D., Parks, T., Campbell, E., & Brierley, S. (2021) · Quantum · doi:10.22331/q-2021-01-20-385 · Cited by 188
Noisy intermediate-scale quantum (NISQ) 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. (2021) · arXiv · doi:10.48550/arxiv.2101.08448 · Cited by 166
Large gradients via correlation in random parameterized quantum circuits
Volkoff, T., & Coles, P. J. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd891 · Cited by 143
“[14] Kentaro Heya, Ken M Nakanishi, Kosuke Mitarai, and Keisuke Fujii, “Subspace variational quantum simulator,” arXiv preprint arXiv:1904.”
BackgroundBarren Plateaus Preclude Learning Scramblers
Holmes, Z., Arrasmith, A., Yan, B., Coles, P. J., Albrecht, A., & Sornborger, A. T. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.190501 · Cited by 125
“[35] Kentaro Heya, Ken M Nakanishi, Kosuke Mitarai, and Keisuke Fujii, “Subspace variational quantum simulator,” arXiv preprint arXiv:1904.”
BackgroundGeneralized Quantum Assisted Simulator
Haug, T., & Bharti, K. (2020) · arXiv · doi:10.48550/arxiv.2011.14737 · Cited by 38
Long-time simulations with high fidelity on quantum hardware
Gibbs, J., Gili, K., Holmes, Z., Commeau, B., Arrasmith, A., Cincio, L., Coles, P. J., & Sornborger, A. (2021) · arXiv · doi:10.48550/arxiv.2102.04313 · Cited by 28
“Cru-cially these states need not be low lying and therefore our approach is more widely applicable than the Subspace Variational Quantum Simulator (SVQS) algorithm [20], which simulates fixed low energy input states.”
Method
Metadata
- Authors
- Heya, K., Nakanishi, K. M., Mitarai, K., Yan, Z., Zuo, K., Suzuki, Y., Sugiyama, T., Tamate, S., Tabuchi, Y., Fujii, K., & Nakamura, Y.
- Venue
- Physical Review Research
- Publisher
- American Physical Society (APS)
- Published
- 2023-05-01
- Volume
- 5
- Issue
- 2
- ISSN
- 2643-1564 (ISSN-L)
- OpenAlex
- W4367625911
- Cited by
- 56
- References
- 32
- FWCI
- 2.99
- 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.