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
Error Mitigation for Short-Depth Quantum Circuits
Temme, K., Bravyi, S., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180509 · Cited by 1,379
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
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
Simulating Hamiltonian Dynamics with a Truncated Taylor Series
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.090502 · Cited by 742 · cited 1×
“Methods for simulating quantum dynamics on a quantum computer were first proposed based on Trotteriza-tion [5–7] and have been extended by incorporating linear combinations of unitaries [8, 9], truncated Dyson series [10], quantum random walk [11, 12], and quantum signal processing [13].”
Efficient Variational Quantum Simulator Incorporating Active Error Minimization
Li, Y., & Benjamin, S. C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021050 · Cited by 686
Hybrid Quantum-Classical Algorithms and Quantum Error Mitigation
Endo, S., Cai, Z., Benjamin, S. C., & Yuan, X. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.032001 · Cited by 566 · cited 1×
“To minimize the effect of imperfections in the circuit, we use gate-error mitigation [61–63] and measurement-error mitigation [63–66].”
Variational ansatz-based quantum simulation of imaginary time evolution
McArdle, S., Jones, T., Endo, S., Li, Y., Benjamin, S. C., & Yuan, X. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0187-2 · Cited by 557 · cited 1×
“Simulations of quantum dynamics in the framework of quantum–classical hybrid algorithms originated in variational quantum simulation (VQS) [25–28].”
Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
McClean, J. R., Kimchi-Schwartz, M. E., Carter, J., & de Jong, W. A. (2017) · Physical Review A · doi:10.1103/physreva.95.042308 · Cited by 516
Theory of variational quantum simulation
Yuan, X., Endo, S., Zhao, Q., Li, Y., & Benjamin, S. C. (2019) · Quantum · doi:10.22331/q-2019-10-07-191 · Cited by 458
Subspace-search variational quantum eigensolver for excited states
Nakanishi, K. M., Mitarai, K., & Fujii, K. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.033062 · Cited by 337 · cited 3×
“A. Subspace-search variational quantum eigensolver SSVQE is an algorithm for finding the k th or up to the k th excited states of Hamiltonian H [1].”
InfluentialSelf-citationOn the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019) · Nature Physics · doi:10.1038/s41567-018-0318-2 · Cited by 287
Measurement optimization in the variational quantum eigensolver using a minimum clique cover
Verteletskyi, V., Yen, T.-C., & Izmaylov, A. F. (2020) · The Journal of Chemical Physics · doi:10.1063/1.5141458 · Cited by 269
Quantum Simulation of Time-Dependent Hamiltonians and the Convenient Illusion of Hilbert Space
Poulin, D., Qarry, A., Somma, R., & Verstraete, F. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.170501 · Cited by 265 · cited 1×
“Methods for simulating quantum dynamics on a quantum computer were first proposed based on Trotteriza-tion [5–7] and have been extended by incorporating linear combinations of unitaries [8, 9], truncated Dyson series [10], quantum random walk [11, 12], and quantum signal processing [13].”
Variational Quantum Simulation of General Processes
Endo, S., Sun, J., Li, Y., Benjamin, S. C., & Yuan, X. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.010501 · Cited by 237
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 · cited 2×
“Several hybrid quantum–classical algorithms have been proposed to solve time-independent Hamiltonian dynamics on NISQ devices [9, 29–32].”
Simulating quantum dynamics on a quantum computer
Wiebe, N., Berry, D. W., Høyer, P., & Sanders, B. C. (2011) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/44/44/445308 · Cited by 110
Quantum simulation with hybrid tensor networks
Yuan, X., Sun, J., Liu, J., Zhao, Q., & Zhou, Y. (2020) · arXiv · doi:10.48550/arxiv.2007.00958 · Cited by 79
A Hybrid Quantum-Classical Approach to Mitigating Measurement Errors in Quantum Algorithms
Kwon, H., & Bae, J. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3009664 · Cited by 54
Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation
Commeau, B., Cerezo, M., Holmes, Z., Cincio, L., Coles, P. J., & Sornborger, A. (2020) · arXiv · doi:10.48550/arxiv.2009.02559 · Cited by 42
Metric Structure of the Space of Two-Qubit Gates, Perfect Entanglers and Quantum Control
Watts, P., O'Connor, M., & Vala, J. (2013) · Entropy · doi:10.3390/e15061963 · Cited by 31 · cited 1×
“To align the execution times of all the Clifford gates, the single-qubit and two-qubit Clifford gates are constructed based on Euler decomposition [35] and KAK decomposition [46], respectively.”
Noise-Resilient Quantum Dynamics Using Symmetry-Preserving Ansatzes
Otten, M., Cortes, C. L., & Gray, S. K. (2019) · arXiv · doi:10.48550/arxiv.1910.06284 · Cited by 30
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
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.