The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Simulating Large Quantum Circuits on a Small Quantum Computer
Open accessAbstract
Limited quantum memory is one of the most important constraints for near-term quantum devices. Understanding whether a small quantum computer can simulate a larger quantum system, or execute an algorithm requiring more qubits than available, is both of theoretical and practical importance. In this Letter, we introduce cluster parameters K and d of a quantum circuit. The tensor network of such a circuit can be decomposed into clusters of size at most d with at most K qubits of inter-cluster quantum communication. We propose a cluster simulation scheme that can simulate any (K,d)-clustered quantum circuit on a d-qubit machine in time roughly 2^{O(K)}, with further speedups possible when taking more fine-grained circuit structure into account. We show how our scheme can be used to simulate clustered quantum systems-such as large molecules-that can be partitioned into multiple significantly smaller clusters with weak interactions among them. By using a suitable clustered ansatz, we also experimentally demonstrate that a quantum variational eigensolver can still achieve the desired performance for estimating the energy of the BeH_{2} molecule while running on a physical quantum device with half the number of required qubits.
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
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500830 · Cited by 4,852
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
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
Warshel, A., & Levitt, M. (1976) · Journal of Molecular Biology · doi:10.1016/0022-2836(76)90311-9 · Cited by 4,479
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
Colloquium : Area laws for the entanglement entropy
Eisert, J., Cramer, M., & Plenio, M. B. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.277 · Cited by 2,873
Efficient Classical Simulation of Slightly Entangled Quantum Computations
Vidal, G. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.147902 · Cited by 2,368
Orús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255
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
Quantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789
Efficient Simulation of One-Dimensional Quantum Many-Body Systems
Vidal, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040502 · Cited by 1,779
Verstraete, F., Murg, V., & Cirac, J. I. (2008) · Advances in Physics · doi:10.1080/14789940801912366 · Cited by 1,762
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
Mathematical Methods for Physicists
(2013) · Elsevier eBooks · doi:10.1016/c2009-0-30629-7 · Cited by 1,375
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.2307/2282952 · Cited by 1,166
Fragmentation Methods: A Route to Accurate Calculations on Large Systems
Gordon, M. S., Fedorov, D. G., Pruitt, S. R., & Slipchenko, L. V. (2012) · Chemical Reviews · doi:10.1021/cr200093j · Cited by 1,106
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
Goals and opportunities in quantum simulation
Cirac, J. I., & Zoller, P. (2012) · Nature Physics · doi:10.1038/nphys2275 · Cited by 891
Optimal Hamiltonian Simulation by Quantum Signal Processing
Low, G. H., & Chuang, I. L. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.010501 · Cited by 769
Quantum optimization using variational algorithms on near-term quantum devices
Moll, N., Barkoutsos, P., Bishop, L. S., Chow, J. M., Cross, A., Egger, D. J., Filipp, S., Fuhrer, A., Gambetta, J. M., Ganzhorn, M., et al. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab822 · Cited by 744
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
Progress towards practical quantum variational algorithms
Wecker, D., Hastings, M. B., & Troyer, M. (2015) · Physical Review A · doi:10.1103/physreva.92.042303 · Cited by 716
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692
Lieb-Schultz-Mattis in higher dimensions
Hastings, M. B. (2004) · Physical Review B · doi:10.1103/physrevb.69.104431 · Cited by 685
Classical simulation of quantum many-body systems with a tree tensor network
Shi, Y.-Y., Duan, L.-M., & Vidal, G. (2006) · Physical Review A · doi:10.1103/physreva.74.022320 · Cited by 577
A Modular Functor Which is Universal¶for Quantum Computation
Freedman, M. H., Larsen, M., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200645 · Cited by 573
Quantum autoencoders for efficient compression of quantum data
Romero, J., Olson, J. P., & Aspuru-Guzik, A. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa8072 · Cited by 559
Symmetry groups and their applications
Miller, W. (1972) · Cited by 506
Realization of a scalable Shor algorithm
Monz, T., Nigg, D., Martinez, E. A., Brandl, M. F., Schindler, P., Rines, R., Wang, S. X., Chuang, I. L., & Blatt, R. (2016) · Science · doi:10.1126/science.aad9480 · Cited by 486
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
Digitized adiabatic quantum computing with a superconducting circuit
Barends, R., Shabani, A., Lamata, L., Kelly, J., Mezzacapo, A., Heras, U. L., Babbush, R., Fowler, A. G., Campbell, B., Chen, Y., et al. (2016) · Nature · doi:10.1038/nature17658 · Cited by 463
Distributed quantum computation based on small quantum registers
Jiang, L., Taylor, J. M., Sørensen, A. S., & Lukin, M. D. (2007) · Physical Review A · doi:10.1103/physreva.76.062323 · Cited by 337
Trading Classical and Quantum Computational Resources
Bravyi, S., Smith, G., & Smolin, J. A. (2016) · Physical Review X · doi:10.1103/physrevx.6.021043 · Cited by 299
A Polynomial Quantum Algorithm for Approximating the Jones Polynomial
Aharonov, D., Jones, V., & Landau, Z. (2009) · Algorithmica · doi:10.1007/s00453-008-9168-0 · Cited by 270
Novel Schemes for Measurement-Based Quantum Computation
Gross, D., & Eisert, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220503 · Cited by 255
Scalable architecture for a room temperature solid-state quantum information processor
Yao, N. Y., Jiang, L., Gorshkov, A. V., Maurer, P. C., Giedke, G., Cirac, J. I., & Lukin, M. D. (2012) · Nature Communications · doi:10.1038/ncomms1788 · Cited by 250
Measurement-based quantum computation beyond the one-way model
Gross, D., Eisert, J., Schuch, N., & Perez-Garcia, D. (2007) · Physical Review A · doi:10.1103/physreva.76.052315 · Cited by 236
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
Aaronson, S., & Chen, L. (2016) · arXiv · doi:10.48550/arxiv.1612.05903 · Cited by 218
Tapering off qubits to simulate fermionic Hamiltonians
Bravyi, S. B., Gambetta, J., Mezzacapo, A., & Temme, K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.08213 · Cited by 162
Efficient Approximation of the Dynamics of One-Dimensional Quantum Spin Systems
Osborne, T. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.157202 · Cited by 161
Classical Simulation of Intermediate-Size Quantum CircuitsPreprint
Chen, J., Zhang, F., Huang, C., Newman, M., & Shi, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.01450 · Cited by 157
Simulation of low-depth quantum circuits as complex undirected graphical modelsPreprint
Boixo, S., Isakov, S. V., Smelyanskiy, V., & Neven, H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.05384 · Cited by 150
Fermion-to-qubit mappings with varying resource requirements for quantum simulation
Steudtner, M., & Wehner, S. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aac54f · Cited by 150
64-qubit quantum circuit simulation
Chen, Z.-Y., Zhou, Q., Xue, C., Yang, X., Guo, G.-C., & Guo, G.-P. (2018) · Science Bulletin · doi:10.1016/j.scib.2018.06.007 · Cited by 136
Efficient Factorization with a Single Pure Qubit andlogNMixed Qubits
Parker, S., & Plenio, M. B. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.3049 · Cited by 130
Optimal Remote Entanglement Distribution
Dai, W., Peng, T., & Win, M. Z. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2969005 · Cited by 116
Self-citationOn the simulation of quantum circuitsPreprint
Jozsa, R. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0603163 · Cited by 105
Quantum Computation and the Evaluation of Tensor Networks
Arad, I., & Landau, Z. A. (2010) · SIAM Journal on Computing · doi:10.1137/080739379 · Cited by 99
Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians
Haah, J., Hastings, M. B., Kothari, R., & Low, G. H. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00041 · Cited by 94
Moll, N., Fuhrer, A., Staar, P., & Tavernelli, I. (2016) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/49/29/295301 · Cited by 75
From estimation of quantum probabilities to simulation of quantum circuits
Pashayan, H., Bartlett, S. D., & Gross, D. (2020) · Quantum · doi:10.22331/q-2020-01-13-223 · Cited by 74
Simulating Quantum Fields with Cavity QED
Barrett, S. D., Hammerer, K., Harrison, S. K., Northup, T. E., & Osborne, T. J. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.090501 · Cited by 62
Lowering qubit requirements for quantum simulations of fermionic systemsPreprint
Steudtner, M., & Wehner, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.07067 · Cited by 29
Cited by
Quantum 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
Theory of Trotter Error with Commutator Scaling
Childs, A. M., Su, Y., Tran, M. C., Wiebe, N., & Zhu, S. (2021) · Physical Review X · doi:10.1103/physrevx.11.011020 · Cited by 451
The future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
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
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
Metadata
- Authors
- Peng, T., Harrow, A. W., Ozols, M., & Wu, X.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2020-10-06
- Volume
- 125
- Issue
- 15
- Pages
- 150504-150504
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2929853032
- Cited by
- 267
- References
- 58
- FWCI
- 10.04
- Type
- journal article
- Language
- en
- Open access
- bronze
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.