Quantum simulation of the Sachdev-Ye-Kitaev model by asymmetric qubitization
Open accessThe DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
We show that one can quantum simulate the dynamics of a Sachdev-Ye-Kitaev model with $N$ Majorana modes for time $t$ to precision $\ensuremath{\epsilon}$ with gate complexity $O({N}^{7/2}t+{N}^{5/2}t\phantom{\rule{0.16em}{0ex}}\mathrm{polylog}(N/\ensuremath{\epsilon}))$. In addition to scaling sublinearly in the number of Hamiltonian terms, this gate complexity represents an exponential improvement in $1/\ensuremath{\epsilon}$ and large polynomial improvement in $N$ and $t$ over prior state-of-the-art algorithms which scale as $O({N}^{10}{t}^{2}/\ensuremath{\epsilon})$. Our approach involves a variant of the qubitization technique in which we encode the Hamiltonian $H$ as an asymmetric projection of a signal oracle $U$ onto two different signal states prepared by state oracles, $A|0\ensuremath{\rangle}\ensuremath{\mapsto}|A\ensuremath{\rangle}$ and $B|0\ensuremath{\rangle}\ensuremath{\mapsto}|B\ensuremath{\rangle}$, such that $H=\ensuremath{\langle}B|U|A\ensuremath{\rangle}$. Our strategy for applying this method to the Sachdev-Ye-Kitaev model involves realizing $B$ using only Hadamard gates and realizing $A$ as a random quantum circuit.
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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
On the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282
Gapless spin-fluid ground state in a random quantum Heisenberg magnet
Sachdev, S., & Ye, J. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.3339 · Cited by 1,910
Remarks on the Sachdev-Ye-Kitaev model
Maldacena, J., & Stanford, D. (2016) · Physical Review D · doi:10.1103/physrevd.94.106002 · Cited by 1,852
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
Self-citationHamiltonian Simulation by Qubitization
Low, G. H., & Chuang, I. L. (2019) · Quantum · doi:10.22331/q-2019-07-12-163 · Cited by 854
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
The spectrum in the Sachdev-Ye-Kitaev model
Polchinski, J., & Rosenhaus, V. (2016) · Journal of High Energy Physics · doi:10.1007/jhep04(2016)001 · Cited by 699
Jensen, K. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.111601 · Cited by 695
Childs, A. M., Kothari, R., & Somma, R. D. (2017) · SIAM Journal on Computing · doi:10.1137/16m1087072 · Cited by 646
(2004) · doi:10.1109/focs.2004.53 · Cited by 599
Toward the first quantum simulation with quantum speedup
Childs, A. M., Maslov, D., Nam, Y., Ross, N. J., & Su, Y. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1801723115 · Cited by 551
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383
Self-citationHamiltonian Simulation with Nearly Optimal Dependence on all Parameters
Berry, D. W., Childs, A. M., & Kothari, R. (2015) · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2015.54 · Cited by 372
Self-citationLow-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
Self-citationRandom Quantum Circuits are Approximate 2-designs
Harrow, A. W., & Low, R. A. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0873-6 · Cited by 324
Halving the cost of quantum addition
Gidney, C. (2018) · Quantum · doi:10.22331/q-2018-06-18-74 · Cited by 279
Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
Berry, D. W., Gidney, C., Motta, M., McClean, J. R., & Babbush, R. (2019) · Quantum · doi:10.22331/q-2019-12-02-208 · Cited by 222
Self-citationLow rank representations for quantum simulation of electronic structure
Motta, M., Ye, E., McClean, J. R., Li, Z., Minnich, A. J., Babbush, R., & Chan, G. K.-L. (2018) · arXiv · doi:10.48550/arxiv.1808.02625 · Cited by 173
Self-citation
Cited by
Even More Efficient Quantum Computations of Chemistry Through Tensor Hypercontraction
Lee, J., Berry, D. W., Gidney, C., Huggins, W. J., McClean, J. R., Wiebe, N., & Babbush, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030305 · Cited by 304
Self-citationEfficient and noise resilient measurements for quantum chemistry on near-term quantum computers
Huggins, W. J., McClean, J. R., Rubin, N. C., Jiang, Z., Wiebe, N., Whaley, K. B., & Babbush, R. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00341-7 · Cited by 256
Self-citationVariational 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
Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
Berry, D. W., Gidney, C., Motta, M., McClean, J. R., & Babbush, R. (2019) · Quantum · doi:10.22331/q-2019-12-02-208 · Cited by 222
Self-citationKivlichan, I. D., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Sun, W., Jiang, Z., Rubin, N., Fowler, A., Aspuru-Guzik, A., et al. (2020) · Quantum · doi:10.22331/q-2020-07-16-296 · Cited by 173
Self-citation
Metadata
- Authors
- Babbush, R., Berry, D. W., & Neven, H.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2019-04-04
- Volume
- 99
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2805699655
- Cited by
- 71
- References
- 21
- FWCI
- 4.83
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.