The DOI matches its Crossref record; 163 of the 163 references it cites were found in a registry or an index; 76 of the 96 sources its claims cite were checked for support.
Beyond-classical computation in quantum simulation
Open accessAbstract
Quantum computers hold the promise of solving certain problems that lie beyond the reach of conventional computers. However, establishing this capability, especially for impactful and meaningful problems, remains a central challenge. Here, we show that superconducting quantum annealing processors can rapidly generate samples in close agreement with solutions of the Schrödinger equation. We demonstrate area-law scaling of entanglement in the model quench dynamics of two-, three-, and infinite-dimensional spin glasses, supporting the observed stretched-exponential scaling of effort for matrix-product-state approaches. We show that several leading approximate methods based on tensor networks and neural networks cannot achieve the same accuracy as the quantum annealer within a reasonable time frame. Thus, quantum annealers can answer questions of practical importance that may remain out of reach for classical computation.
Overview
CoChat Summary
TL;DR
Superconducting quantum annealing processors rapidly generate samples from quenched transverse-field Ising spin glasses in close agreement with Schrödinger-equation solutions, with area-law entanglement scaling and critical exponents matching independent estimates. Leading tensor-network and neural-network classical methods cannot match QPU accuracy within a reasonable time frame, supporting beyond-classical quantum simulation for these problems.
Key findings
- Two D-Wave quantum annealing processors, ADV1 and ADV2, produced consistent samples for 2D, 3D, and infinite-dimensional spin-glass quenches; for the largest MPS ground truths, the spin-glass order parameter ⟨q²⟩ had a median deviation of only 1% between quantum and classical simulation.
- MPS required a QPU-equivalent bond dimension χ_Q that grew exponentially with bipartition area, consistent with area-law entanglement scaling; for 3D or biclique lattices the estimated requirement was χ_Q ≃ 10⁷, and for diamond lattices χ_Q ≃ 10¹¹.
- PEPS and NQS methods failed to match QPU accuracy even on modest 2D problems at slower quenches: PEPS easily beat QPU error at t_a = 2 ns but at 20 ns all PEPS experiments had higher error than QPU, and NQS could not produce acceptable accuracy beyond the shortest time scales and smallest models.
- Extrapolated MPS resource estimates indicated that matching QPU quality on the largest problems would take millions of years on the Frontier supercomputer per input, exceed its 700 PB storage, and exceed annual global electricity consumption; extracted KZ exponents, e.g. square 2.83(24), cubic 2.72(16), and biclique 6.3(9), agreed with previous estimates and theory.
Methods
- The task was to sample from the post-quench state of a time-dependent transverse-field Ising model, H(t) = Γ(t/t_a)H_D + J(t/t_a)H_P, on square, cubic dimer, diamond, and biclique topologies, using two D-Wave processors: ADV1 (5627 qubits) and ADV2 (1222 qubits), both at 12 mK, with each QPU generating at least 1000 samples per second.
- QPU results were compared with classical approximations to the time-dependent Schrödinger equation: MPS and PEPS tensor networks and NQS simulations; ground truths for small systems came from well-converged MPS simulations on Summit and Frontier, using metrics including correlation error ε_c, classical fidelity F, and QPU-equivalent bond dimension χ_Q.
- Calibration refinements included flux offsets, anneal offsets, embedding and automorphism averaging, with up to 200 parallel embeddings; the largest diamond input was (12,12,16) with 567 of 576 qubits operable.
Limitations
- The paper states that direct, nonuniversal verification against ground truth is only possible at small scales; beyond the classically simulable regime, validation relies on universal quantum critical scaling and dynamic finite-size scaling collapse.
- The paper notes that its resource extrapolation applies to MPS, the only method that matched QPU quality for all considered quench times, and is not an intrinsic lower bound for all classical methods; PEPS and NQS failed at smaller sizes.
- The paper states that the QPUs were calibrated for the operational regime t_a > 500 ns, while the model quench times studied here required refined time mapping and synchronization corrections; future availability of t_a < 500 ns would make that calibration section unnecessary. The largest diamond lattice permitted 9 defects out of 576 qubits, expected to have no significant impact on algorithmic complexity.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures













![FIG. S9 A PEPS (circuit-model equivalent) representing a 2nd-order Trotterized approximation to time evolution of duration dt . Repeated action of a dt -operator on a PEPS enables a discretized simulation of dynamics with error controlled by dt . The dt operator can be decomposed into 2+ κ layers of rank-2 unitaries (gates), where κ is the edge chromatic number of the lattice being simulated ( κ = 2 = site connectivity for the case of a 1D chain shown). 2-site operators are exp( -i 2 πdt J ( t/t a ) J ij σ z i σ z j ) and single-site operators are exp( -iπdt Γ( t/t a ) σ x i ). The depth of 2-site operators is controlled by κ , and the total number of 2-gates matches the number of edges in the target lattice. To compress the circuit, 1-site operators between time steps can be combined. With care in the order of operations (to ensure 2nd-order Trotterization error), depth can be reduced to κ per unit dt by use of 2-site (rank 4) gates of the form exp ( -i 2 πdt [ J ( t/t a ) J ij σ z i σ z j -Γ( t/t a )( σ x i k i + σ x j k j )] ) , k ∗ being site connectivity, eliminating the need for 1-site gates.](https://figures.cochat.ai/paper-figures/4e49a83357524f469fba202fa7ef5784/beyond-classical-computation-in-quantum-simulation-figure-14.png)




























![FIG. S38 Error by extrapolation from local correlation estimates on 8 × 8 cylinders. ( A ) t a = 7ns and ( B ) t a = 20ns. The divergence of the QPU from the ground-truth distribution is shown by the blue horizontal line. If the QPU distribution can be reconstructed from a rotating-cluster approximation with similar accuracy, we anticipate an equal-scale clustering approach can also be used for ground-truth estimation, as verified at smaller scale. Correlations on 8 × 8 cylinder models can be estimated by rotating clusters with one cut (Fig. S35 right); correlations are more accurate furthest from the cut. For each correlation, we can select a rotating cluster with the cut maximally separated from the site coordinates, yielding an error shown by the black horizontal line. We can select the best (spatially local) correlations from either the approximation (QPU[W=8]), or the target distribution (QPU), and train a Boltzmann distribution. As we incorporate correlations of increasing geometric distance, we can improve the quality of estimation relative to the raw correlation data. However, approximation data becomes increasingly errant, and so this only works for QPU[W=8] up to a limited scale. At 7 ns inclusion of ideal data up to geometric distance 3 is sufficient to reproduce the distribution with comparable accuracy to the ground truth, the effects of the boundary in the rotating cluster lead to a deviation upwards, so that ϵ c remains just above the target threshold. At 20 ns, longer distance is required for the ideal data [QPU] to achieve low error, compatible with a longer correlation length, and the approximating data QPU[W=8] is relatively poor leading to weak approximation.](https://figures.cochat.ai/paper-figures/b8331c95166e406d9e1c781c17dcaf3e/beyond-classical-computation-in-quantum-simulation-figure-43.png)
Verification
Claims the paper makes
53 Valid · 24 Not valid · 17 Not checked · 357 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Time-evolving an MPS with χ = 1 with the time-dependent variational principle (TDVP, see next subsection for more details) is ill-defined, as many of the long-range interactions are lost during the projection step and the resulting time evolution would be wrong 51,76,77 .”
§ Beyond-classical computation in quantum simulation > 1. Initial state preparation
What the sources say
- Could not verifycites [51] 51. J. Haegeman, C. Lubich, I. Oseledets, B. Vandereycken, and F. Verstraete, Unifying time evolution and opti- mization with matrix product states, Phys. Rev. B 94, 165116 (2016). sourceExperimental — accuracy not yet measured
Section III discusses approximate bond truncation and reports that MPS can give wrong results at Clifford points, but it does not address TDVP evolution of an MPS with χ = 1 or interactions lost during a projection step. Searches for TDVP and the claimed projection mechanism found no passage addressing that point. (LLM, conf=0.72)
- Partly supportedcites [76] 76. J. Haegeman, J. I. Cirac, T. J. Osborne, I. Pižorn, H. Verschelde, and F. Verstraete, Time-dependent vari- ational principle for quantum lattices, Physical Review Letters 107, 1 (2011). sourceExperimental — accuracy not yet measured
The discussion accompanying Fig. 1 describes TDVP as projecting the time-evolution direction onto the MPS tangent plane, supporting the reference to a projection step. Our copy does not say that bond dimension χ = 1 makes TDVP ill-defined, that long-range interactions are lost in that case, or that the resulting evolution is wrong; it instead describes the projection as the best approximation within the chosen manifold. (LLM, conf=0.82)
- Partly supportedcites [77] 77. S. Paeckel, T. Köhler, A. Swoboda, S. R. Manmana, U. Schollwöck, and C. Hubig, Time-evolution meth- ods for matrix-product states, Annals of Physics 411, 167998 (2019). sourceExperimental — accuracy not yet measured
Section 6.2.2 (p. 49) says TDVP projection error can be particularly severe at small bond dimension, and §8.3.3 (p. 72) reports projection problems for product initial states. But the paper does not say that evolving every χ = 1 MPS with TDVP is ill-defined or that long-range interactions are necessarily lost: it says two-site TDVP has no projection error for nearest-neighbor Hamiltonians. The claim overgeneralizes a problem that depends on the interaction and TDVP variant. (LLM, conf=0.88)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Could not verify
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Such MPS states naturally encode the area law of entanglement 75 : ground states of gapped Hamiltonians of N qubits can be approximated to arbitrarily high precision with an MPS of bond dimension χ, which does not grow with the size of the system.”
§ Beyond-classical computation in quantum simulation > A. Matrix Product States (MPS)
What the sources say
- Partly supportedcites [75] 75. M. B. Hastings, An area law for one-dimensional quan- tum systems, Journal of statistical mechanics: theory and experiment 2007, P08024 (2007). sourceExperimental — accuracy not yet measured
The Matrix Product States section (p. 5) constructs an MPS approximation for a gapped ground state under finite-range and finite-strength assumptions. But the approximation estimate on p. 4 scales with chain length N at a given bond dimension, so the paper does not establish arbitrarily high precision at a bond dimension independent of N. Its theorem also assumes a unique ground state (p. 1). (LLM, conf=0.88)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“The nonequilibrium quantum dynamics studied here are responsible for a scaling advantage over classical dynamics in optimization 25 .”
§ Beyond-classical computation in quantum simulation > SUMMARY AND CONCLUSIONS
What the sources say
- Supportedcites [25] 25. A. D. King, J. Raymond, T. Lanting, R. Harris, A. Zucca, et al., Quantum critical dynamics in a 5,000- qubit programmable spin glass, Nature 617, 61 (2023). source
The Outlook (p. 5) says the measured quantum-critical dynamics give quantum annealing a dynamical advantage over simulated annealing and simulated quantum annealing in the spin-glass setting. It also reports an experimentally demonstrated scaling advantage in approaching the ground-state energy. (LLM, conf=0.91)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“As discussed in Section V, and in agreement with previous observations 31 , we show that quenched quantum dynamics deviating from the ground state also show area-law scaling.”
§ Beyond-classical computation in quantum simulation > A. Matrix Product States (MPS)
What the sources say
- Partly supportedcites [31] 31. E. Canovi, E. Ercolessi, P. Naldesi, L. Taddia, and D. Vodola, Dynamics of entanglement entropy and en- tanglement spectrum crossing a quantum phase transi- tion, Physical Review B 89, 104303 (2014). sourceExperimental — accuracy not yet measured
In §F.1 (Entanglement entropy; page unavailable), the paper reports that entropy curves for different system sizes are practically coincident at small quench times, consistent with size-independent scaling in that regime. Its discussion of fast sweeps (§D; page unavailable) describes dynamics that depart from the instantaneous ground state. It does not establish area-law scaling for quenched dynamics generally, as the claim implies. (LLM, conf=0.78)
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Moreover, as the size of the tensors is exponential in d, this methodology quickly becomes impractical, with extreme restrictions on feasible simulations even in three dimensions 54 .”
§ Beyond-classical computation in quantum simulation > CLASSICAL SIMULATION TECHNIQUES
What the sources say
- Partly supportedcites [54] 54. P. C. G. Vlaar and P. Corboz, Simulation of three-dimensional quantum systems with projected entangled-pair states, Phys. Rev. B 103, 205137 (2021). sourceExperimental — accuracy not yet measured
The iPEPS ansatz section describes six D-dimensional auxiliary indices for a 3D tensor, and the Introduction says the additional legs increase computational cost. Section III reports that a large-cluster contraction typically is feasible only at D = 2. But the paper does not characterize 3D iPEPS as generally impractical: its Summary presents a practical method at reasonable cost. It also uses d for the local physical-index dimension, not spatial dimension. (LLM, conf=0.87)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
243 more claims · 20 with their cited sources checked
Create a free account to see all 451 claims and every source verdict.
- Probably not a substantial claim. 96
- It may state two separate claims as one. 125
- Borderline: one of the tests for a substantial claim is unclear. 2
- The quote only partly states this claim. 2
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
“µ = z + 1/ν = 2.46(17) + 0.71(24) = 3.27( 41)”
§ Beyond-classical computation in quantum simulation > Additional information
Reported 3.27 · recomputed 3.17
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
Inference from iterative simulation using multiple sequences
Gelman, A., & Rubin, D. B. (1992) · Statistical Science · doi:10.1214/ss/1177011136 · Cited by 16,627
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
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
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Topology of cosmic domains and strings
Kibble, T. W. B. (1976) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/9/8/029 · Cited by 4,545
Entanglement in many-body systems
Amico, L., Fazio, R., Osterloh, A., & Vedral, V. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.517 · Cited by 3,745
Sachdev, S. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511622540 · Cited by 3,408
Research works printed but not linked: 1
- W. H. Press S. A. Teukolsky W. T. Vetterling B. P. Flannery Numerical Recipes in C: The Art of Scientific Computing (Cambridge Univ. Press ed. 2 1992).
Cited by
Quantum dynamics in Krylov space: Methods and applications
Nandy, P., Matsoukas-Roubeas, A. S., Martínez-Azcona, P., Dymarsky, A. Y., & del Campo, A. (2025) · Physics Reports · doi:10.1016/j.physrep.2025.05.001 · Cited by 340
Observation of constructive interference at the edge of quantum ergodicity
Collaborators, G. Q. A. A., Abanin, D. A., Acharya, R., Beni, L. A., Aigeldinger, G., Ajoy, A., Alcaraz, R., Aleǐner, I. L., Andersen, T. I., Ansmann, M., et al. (2025) · Nature · doi:10.1038/s41586-025-09526-6 · Cited by 195
Scaling Advantage in Approximate Optimization with Quantum Annealing
Munoz-Bauza, H., & Lidar, D. A. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.160601 · Cited by 97
Rams, M., Wojtowicz, G., Sinha, A., & Hasik, J. (2025) · SciPost Physics Codebases · doi:10.21468/scipostphyscodeb.52 · Cited by 16
Self-citationBias-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
“Nonequilibrium states resulting from global parameter quenches are expected to follow a volume law, though recent quantum simulationsofparamagnetic-to-spin-glassquenchdynamicsexhibitedarea-lawscaling 34 .”
Metadata
- Authors
- King, A. D., Nocera, A., Rams, M. M., Dziarmaga, J., Wiersema, R., Bernoudy, W., Raymond, J., Kaushal, N., Heinsdorf, N., Harris, R., Boothby, K., Altomare, F., Asad, M., Berkley, A. J., Boschnak, M., Chern, K., Christiani, H., Cibere, S., Connor, J., Dehn, M. H., Deshpande, R., Ejtemaee, S., Farre, P., Hamer, K., Hoskinson, E., Huang, S., Johnson, M. W., Kortas, S., Ladizinsky, E., Lanting, T., Lai, T., Li, R., MacDonald, A. J. R., Marsden, G., McGeoch, C. C., Molavi, R., Oh, T., Neufeld, R., Norouzpour, M., Pasvolsky, J., Poitras, P., Poulin-Lamarre, G., Prescott, T., Reis, M., Rich, C., Samani, M., Sheldan, B., Smirnov, A., Sterpka, E., Trullas Clavera, B., Tsai, N., Volkmann, M., Whiticar, A. M., Whittaker, J. D., Wilkinson, W., Yao, J., Yi, T. J., Sandvik, A. W., Alvarez, G., Melko, R. G., Carrasquilla, J., Franz, M., & Amin, M. H.
- Affiliations
- D-Wave Systems (Canada) (CA)
- University of British Columbia (CA)
- Jagiellonian University (PL)
- University of Waterloo (CA)
- D-Wave Quantum Inc., Burnaby, British Columbia, Canada.
- Boston University (US)
- Oak Ridge National Laboratory (US)
- Corresponding author
- King, Andrew D.
- Amin, Mohammad H.
- ORCID
- Nocera, Alberto
- Rams, Marek M.
- Dziarmaga, Jacek
- Wiersema, Roeland
- Bernoudy, William
- Raymond, Jack
- Kaushal, Nitin
- Heinsdorf, Niclas
- Boothby, Kelly
- Altomare, Fabio
- Asad, Mohsen
- Berkley, Andrew J.
- Dehn, Martin H.
- Ejtemaee, Sara
- Hamer, Kelsey
- Huang, Shuiyuan
- Johnson, Mark W.
- Kortas, Samuel
- Lanting, Trevor
- McGeoch, Catherine C.
- Pasvolsky, Joel
- Poitras, Patrick
- Poulin-Lamarre, Gabriel
- Rich, Chris
- Samani, Mohammad
- Smirnov, Anatoly
- Whiticar, Alexander M.
- Whittaker, Jed D.
- Yao, Jason
- Sandvik, Anders W.
- Melko, Roger G.
- Carrasquilla, Juan
- Franz, Marcel
- Amin, Mohammad H.
- Venue
- Science
- Published
- 2025-04-11
- Volume
- 388
- Issue
- 6743
- Pages
- 199-204
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W4408363016
- Semantic Scholar
- 5e366c3d19bc65cd9fc23e377aeea68f7b5b92b2
- Cited by
- 138
- References
- 160
- Citations by year
- 2026: 64 · 2025: 69
- FWCI
- 52.93
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Homo Politicus (Academy of Humanities and Economics in Lodz) (submittedVersion, cc-by-nc-nd)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy (AC05-00OR22725, DE--AC05--00OR22725, DE-AC05?, 00OR22725)
- Canadian Institute for Advanced Research
- Government of Canada (DE-AC05-00OR22725)
- Canada First Research Excellence Fund
- Institut Périmètre de physique théorique
- Office of Science (DEAC05- 00OR22725, AC05-00OR22725)
- Natural Sciences and Engineering Research Council of Canada (DE-AC05-00OR22725)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum annealing, superconducting quantum processors, quantum advantage, Schrödinger equation, spin glass, quench dynamics, entanglement scaling, area law, matrix product states, tensor networks, artificial neural networks, quantum simulation
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-09-29, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-09-29 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Beyond-classical computation in quantum simulation. https://app.cochat.ai/papers/10.1126/science.ado6285
- The paper
- King, A. D., Nocera, A., Rams, M. M., Dziarmaga, J., Wiersema, R., Bernoudy, W., Raymond, J., Kaushal, N., Heinsdorf, N., Harris, R., Boothby, K., Altomare, F., Asad, M., Berkley, A. J., Boschnak, M., Chern, K., Christiani, H., Cibere, S., Connor, J., . . . Amin, M. H. (2025). Beyond-classical computation in quantum simulation. Science. https://doi.org/10.1126/science.ado6285
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.