Abstract
Quantum systems have entered a competitive regime in which classical computers must make approximations to represent highly entangled quantum states1,2. However, in this beyond-classically-exact regime, fidelity comparisons between quantum and classical systems have so far been limited to digital quantum devices2–5, and it remains unsolved how to estimate the actual entanglement content of experiments6. Here, we perform fidelity benchmarking and mixed-state entanglement estimation with a 60-atom analogue Rydberg quantum simulator, reaching a high-entanglement entropy regime in which exact classical simulation becomes impractical. Our benchmarking protocol involves extrapolation from comparisons against an approximate classical algorithm, introduced here, with varying entanglement limits. We then develop and demonstrate an estimator of the experimental mixed-state entanglement6, finding our experiment is competitive with state-of-the-art digital quantum devices performing random circuit evolution2–5. Finally, we compare the experimental fidelity against that achieved by various approximate classical algorithms, and find that only the algorithm we introduce is able to keep pace with the experiment on the classical hardware we use. Our results enable a new model for evaluating the ability of both analogue and digital quantum devices to generate entanglement in the beyond-classically-exact regime, and highlight the evolving divide between quantum and classical systems.
Subject terms: Quantum simulation, Quantum information
Fidelity benchmarking of an analogue quantum simulator reaches a high-entanglement regime where exact classical simulation of quantum systems becomes impractical, and enables a new method for evaluating the mixed-state entanglement of quantum devices.
Main
Classical computers generally struggle to exactly represent highly entangled states7–9, in the sense of entanglement entropy. This has raised interest in the potential of quantum devices to efficiently solve certain classically hard problems, but modern noisy-intermediate-scale quantum1,10 (NISQ) devices are limited by experimental errors (Fig. 1a). This makes it a key goal to benchmark NISQ devices in the highly entangled regime in which exact classical simulation becomes infeasible (Fig. 1b); for example, state-of-the-art classical simulation of Hamiltonian time evolution generating highly entangled states with exact global fidelity is currently limited to 38 qubits (ref. 11).
One such approach is to study the fidelity of preparing a highly entangled target state of interest2, with several efficient fidelity estimators12–16 having been introduced in recent years. However, in the beyond-classically-exact regime, these protocols have only been applied to digital quantum devices, with no such demonstrations on analogue quantum simulators17, that is, quantum devices tailored to efficiently encode select problems of interest18–20.
In this work, we perform fidelity estimation with an analogue quantum simulator targeting highly entangled states that are impractical to represent exactly on a classical computer. Our Rydberg quantum simulator14,19 has recently demonstrated21 two-qubit entanglement fidelities of ≈0.999, spurring this study with up to 60 atoms22 in a one-dimensional array (Fig. 1c). We stress that we target high entanglement entropy states that require an exponential number of coefficients to represent classically, as distinct from Greenberger–Horne–Zeilinger (GHZ), cluster or stabilizer states, which are efficiently representable on a classical computer at all system sizes23 (Supplementary Fig. 1).
Our fidelity estimation is based on extrapolation from benchmarking against many approximate classical simulations, namely, matrix product state (MPS) algorithms that cap the maximum simulation entanglement to avoid the aforementioned exponential increase in classical cost23–25 (Fig. 1b). In one-dimension, early-time entanglement growth is system-size independent, so at short times the MPS representation is exact for essentially arbitrarily large systems. When entanglement growth surpasses the entanglement cap, the MPS is no longer a faithful reference, but we can extrapolate the fidelity through a combination of varying the system size, evolution time and simulation entanglement limit.
Using the fidelity, we derive and demonstrate a simple proxy of the experimental mixed-state entanglement6, which so far has been notoriously difficult to measure in large systems. Our proxy serves as a universal quality-factor requiring only the fidelity with, and the entanglement of, the ideal target pure state. This enables comparisons between our experiment and state-of-the-art digital quantum devices2–5,26, with which we are competitive.
Ultimately, we compare the fidelity of our experiment against that achieved by a variety of approximate classical algorithms, including several not based on MPS. Using a single node of the Caltech central computing cluster, none of the tested algorithms is able to match the experimental fidelity in the high-entanglement regime, except for an improved algorithm we introduce, termed Lightcone-MPS. Even with this new algorithm, classical costs reach a regime requiring high-performance computing to match the experiment’s performance.
Fidelity estimation with approximate algorithms
A key quantity when studying quantum systems is the fidelity27, , where is a pure state of interest and is the experimental mixed state. For digital devices studying deep circuits, the fidelity can be estimated by means of the linear cross-entropy2,12, a cross-correlation between measurement outcomes of an experiment and an exact classical simulation. A modified cross-entropy, termed15 Fd, was proposed for both analogue and digital systems, and demonstrated on Rydberg14 and superconducting28 analogue quantum simulators. Fd is efficiently sampled (Supplementary Fig. 15) as
1 |
where M is the number of measurements, zm is the experimentally measured bitstring, p(z) is the probability of measuring z with no errors following quench evolution and pavg(z) is the time-averaged probability of measuring z. Fd ≈ F for a wide class of physical systems, as long as the rescaled probabilities p(z)/pavg(z) follow the so-called Porter–Thomas distribution15. Still, a stringent requirement remains: access to an exact classical simulation to obtain p(z), precluding direct fidelity estimation at large system sizes. We circumvent this constraint by introducing a method to estimate the fidelity by benchmarking against approximate classical simulations.
We consider a comparison (Fig. 2b) between an ideal high-entanglement target pure state, , the experimental mixed state, , and a pure state from classical MPS simulation, . We introduce an improved MPS time-evolution algorithm using an optimal decomposition of Hamiltonian dynamics into quantum circuits29,30, which we term Lightcone-MPS (Supplementary Information). The MPS is parameterized by a bond dimension, χ, that defines the maximum simulable entanglement, which scales as . Starting from an all-zero state, we program a time-independent, global quench under the one-dimensional Ising-like Rydberg Hamiltonian (Fig. 2a, for Hamiltonian details see Supplementary Fig. 3 and the Supplementary Information). Hamiltonian parameters lead to high-temperature thermalization31, such that describing at late times requires an exponential number of classical coefficients14.
For a system size of n = 30 (Fig. 2c–e, left), we can exactly classically simulate these dynamics (Fig. 2d, grey); by exact, we mean the classical fidelity, , stays near unity for all times. We numerically observe the entanglement of the target state increases linearly at early times, before eventual near-saturation (Fig. 2c). Moreover, the estimated experimental quantum fidelity, Fd, shows apparent exponential decay due to experimental errors14 (Fig. 2e, grey).
However, the situation changes when using an approximate classical simulation. Now, the classical fidelity begins to decay (Fig. 2d, blue) after the time, tex, when the ideal entanglement exceeds the limit set by the bond dimension (Fig. 2c, blue), meaning the classical simulation is no longer a faithful reference of the ideal dynamics. Most importantly, we find that after tex the experimental benchmarked fidelity also deviates downwards (Fig. 2e, blue), indicating that Fd no longer accurately estimates the fidelity to the ideal state. For the largest system sizes (for instance, n = 60 in Fig. 2c–e, right), tex occurs well before the entanglement is predicted to saturate, even for the largest bond dimension we can realistically use. We estimate the classical fidelity in this case using the product of MPS truncation errors25, which we find is accurate in the regime in which we operate (Supplementary Fig. 29).
Essentially, Fd seems to be an amalgam of both classical and quantum fidelities, only estimating the quantum fidelity to the ideal state in the limit of the classical simulation being perfect. To test this behaviour for all system sizes, we study the benchmarked value of Fd averaged over all experimental times (Fig. 2f). Consistently, we see for a bond dimension (open markers) that is too small, Fd is reduced. In some cases, the requirement that p(z)/pavg(z) follows a Porter–Thomas distribution can be violated, resulting in Fd even becoming unphysically negative. As bond dimension increases, Fd rises, before reaching a saturation bond dimension, χ0(n, t), which depends on system size and time (closed markers). For the largest system sizes and times, however, the saturation bond dimension is beyond the capabilities of any current classical hardware11.
If the noise affecting the system was purely Markovian, then the fidelity would decay exponentially32 and it would be possible to measure the fidelity at early times before tex to learn the exponential decay rate, and then extrapolate in time to estimate the late-time fidelity. Indeed, we note this is an advantage of the Fd metric we use here, because it accurately estimates the fidelity earlier than other estimators such as the standard linear cross-entropy14,15. However, extrapolating to late times is non-trivial in our case owing to non-Markovian noise sources often affecting analogue quantum systems. In particular, with analytic and numerical analysis we show that shot-to-shot Hamiltonian parameter fluctuations (for example, laser intensity variations) induce subexponential fidelity decay at low fidelities (Supplementary Information Theorem 1 and Supplementary Fig. 8).
Instead, we use a model-agnostic extrapolation by leveraging a large amount of data with three independent parameters: evolution time, system size and bond dimension normalized by its saturation value (Fig. 3a and Supplementary Information). We can calculate Fd in seven of the octants of this parameter space: the only outlier is the high-entanglement regime of interest. We thus use a Monte Carlo inference approach by training an ensemble33 of initially randomized neural networks to predict Fd given an input n, χ and t; Fd at large system sizes and long evolution times is then estimated as the ensemble average when χ → χ0 (Supplementary Fig. 9). We emphasize that essentially we are simply performing curve fitting of the smoothly varying function Fd(n, χ, t), for which we can directly simulate many ground truth data.
We check that this protocol consistently reproduces fidelities at small system sizes, does not seem to overfit the experiment (Supplementary Fig. 12), is insensitive to hyperparameters such as the neural net topology and size, and that predictions are converged as a function of the bond dimension (Supplementary Fig. 13). We further reaffirm that our method extrapolates correctly by replicating our entire procedure in a smaller scale wherein the quantum device is replaced by numerical error model simulations up to n = 18 atoms (Supplementary Information). For t > 6.6 cycles and n > 15, the training data only consist of low bond dimensions to emulate the limitations of the large-n experimental data. Even still, the extrapolated fidelity is in excellent agreement with the ground truth data (Fig. 3b and Supplementary Fig. 12), and reproduces the subexponential fidelity decay predicted analytically (Supplementary Information Theorem 1).
Ultimately, we apply Monte Carlo inference to the full experimental dataset for system sizes up to n = 60 atoms (Fig. 3c; see Supplementary Figs. 7 and 11 for all data). At high fidelities (roughly greater than 0.2), we observe nearly exponential decay, with a rate scaling linearly with system size (Fig. 3d). At low fidelity, however, the Monte Carlo prediction again reproduces the expected subexponential response. We estimate the fidelity to produce the target state when the entanglement is expected to saturate (Fig. 3e), yielding Fd = 0.095(11) at n = 60.
This work showcases benchmarking a quantum device by extrapolating from approximate classical simulations, and extends the reach of global fidelity estimation for analogue quantum simulators into the classically inexact regime. We expect this approach to be scalable; by studying the convergence of predicted fidelities as a function of bond dimension, our approach seems feasible for up to an order-of-magnitude more atoms than we use here (Supplementary Fig. 14).
Experimental mixed-state entanglement
Having benchmarked the fidelity of our Rydberg quantum simulator, we now turn to investigate the actual half-chain bipartite entanglement content of the experiment. In the past, several studies have investigated entanglement properties of (nearly) pure states by estimating the second Rényi entropy in (sub)systems up to ten particles31,34–36. However, the actual output of an experiment can be a highly mixed state with markedly different entanglement content from the target pure state. For this reason, it is desirable to directly quantify mixed-state entanglement measures. Unfortunately, extensions of most pure state entanglement measures to the case of mixed states are defined variationally, and as such are incalculable for even moderately sized systems37.
An alternative, computable measure of mixed-state entanglement is the log negativity6, , which is an upper bound to the distillable entanglement of the system37. However, measuring the value of the negativity naïvely requires tomography of the full system density matrix, which is infeasible even for intermediate scale quantum systems38,39. In the past, experiments have been limited to demonstrating necessary conditions for a non-vanishing negativity, which can only reveal the binary presence of mixed-state entanglement40,41.
Here we derive and demonstrate an entanglement proxy, , which can lower-bound the extensive mixed-state entanglement (quantified by log negativity). For a mixed state, , with fidelity, F, to a target pure state, , with known entanglement, , our mixed-state entanglement proxy is
2 |
Here, is a proxy evaluating the competition between the growth of the error-free entanglement, , versus the error-sensitive fidelity, as F < 1 reduces the mixed-state entanglement. When is an isotropic state (an admixture of a maximally entangled state and a maximally mixed state), it has been shown6,42 that at large system sizes. Further, we show the same holds for a Haar-random state admixed with a maximally mixed state—the expected output32 of deep noisy random unitary circuits (RUCs)—as long as the fidelity is large compared to the inverse of the half-chain Hilbert space dimension (Supplementary Information).
More generally, we prove is a lower bound for for any mixed state assuming is the highest fidelity state to , and becomes tighter as the system size increases (Supplementary Fig. 17). Violations of this assumption can only lead to small violations of our bound in the worst case for physically realistic conditions with local or quasi-static errors, as we show with both analytic (Supplementary Information Theorems 3 and 4) and numeric (Supplementary Figs. 18 and 21) support in the Supplementary Information.
We demonstrate the efficacy of on both noisy RUC evolution and error model simulation of our Rydberg dynamics (Fig. 4a and Supplementary Information). In both cases, the target pure state log negativity increases and saturates, while the exactly calculated mixed-state log negativity reaches a maximum before decaying at late times, behaviour that the entanglement proxy replicates as a lower bound.
We then plot the experimental entanglement proxy (Fig. 4b), where is extrapolated from small system sizes (Supplementary Fig. 16) and F is found from Monte Carlo inference. We observe the entanglement proxy peaks before falling at late times; this peak value increases (Fig. 4c) as a function of effective system size defined as the number of qubits with the same Hilbert space dimension as our experiment under the Rydberg blockade constraint (roughly 42 for n = 60).
With equation (2) we can directly compare the results of our present study against RUC evolution in state-of-the-art digital quantum devices2–5,26 (Fig. 4c). We find we are within roughly 2 ebits of early tests of quantum advantage2 (an ebit is the entanglement of a two-qubit Bell state). For literature examples, we assume targeted states are Haar-random43,44, whereas for our experiment we conservatively use the extrapolated log negativity, which is roughly 2 ebits below the expectation for Haar-random states at the largest system sizes (Supplementary Fig. 16).
The mixed-state entanglement proxy can serve as a useful quality-factor of the ability for different experiments to produce highly entangled states, including for preparation methods besides quench evolution such as quasi-adiabatic ground state preparation (Supplementary Figs. 2 and 23), and could be a more widely applicable alternative to other measures, such as quantum volume13, for directing efforts to improve NISQ-era quantum systems.
The classical cost of quantum simulation
We finally ask: which device, quantum or classical, has a higher fidelity of reproducing a high-entanglement pure target state of interest? Equivalently, in terms of fidelity, what are the minimum classical resources required for a classical computer to outperform the quantum device?
To answer this, we compare the fidelity of the experiment against that of the MPS with varying bond dimension. We define the critical bond dimension for a given system size, χ*, as the minimum bond dimension for which the classical fidelity always exceeds the estimated experimental fidelity. This controls the costs of classical simulation: for instance, MPS simulation time scales as . We find χ* continually increases as a function of system size (Fig. 5a), reaching a maximum value of χ* = 3,400 for n = 60 (Supplementary Fig. 31), and apparently continuing to increase beyond that point.
In performing this study, we used our new Lightcone-MPS algorithm, but considered several alternative approximate classical algorithms, including path integral, matrix product operator, time-dependent variational principle, Schrieffer–Wolff transformation and neural net approaches (Supplementary Information); however, we found the equivalent classical cost of these methods quickly became infeasible, typically well before n = 60. As an example, we show χ* for a more conventional MPS approach using time-evolving block decimation45 (Fig. 5a).
All calculations used a single 16-core node of the Caltech central computing cluster (Supplementary Information). On this machine, we estimate that running the Lightcone-MPS simulation for n = 60 and χ* = 3,400 would entail a peak memory usage of roughly 110 GB (scaling as ), and would take roughly 11.3 days or 11.3 × 16 ≈ 180 core-days; sampling from the resultant MPS would take roughly 0.3 core-seconds per sample (scaling as ). For comparison, the experimental cycle time is roughly 1.7 s, limited by array loading and imaging; the actual quantum simulation time is only roughly 1 μs per shot. Just as the classical computer can use several cores, so too can the experiment be parallelized over several atom-array chains simultaneously, which in fact we do already at small system sizes.
We predict these classical costs are highly sensitive to the effective per-atom fidelity, , defined by (Fig. 5b and Supplementary Information). For instance, the simulation time scales as around the experimental . Although specialized classical hardware11,46,47 may more readily perform the present approximate classical simulations, we thus expect small improvements in the quantum fidelity may soon make the experiment out of reach of even these more advanced classical systems.
Outlook
As quantum systems tackle tasks of rising complexity, it is increasingly important to understand their ability to produce states in the highly entangled, beyond-classically-exact regime. Here we have studied this regime directly by measuring the global fidelity of an analogue quantum simulator with up to 60 atoms.
A careful analysis (Supplementary Fig. 14) indicates that with reasonable classical resources, our Monte Carlo inference protocol is scalable to an order-of-magnitude larger system sizes than were studied here, potentially enabling fidelity estimation for system sizes with n ≈ 500. It is also applicable for digital devices2–5,26 that are affected by non-Markovian noises such as control errors2, which could then lead to non-exponential scaling of global fidelities in certain parameter regimes. Furthermore, it could be applied to analogue quantum simulators for itinerant particles15,18,48. Further, one may imagine applying the same basic technique to cross-platform comparisons49–51 between erroneous quantum devices by varying the decoherence of each: a form of zero-noise extrapolation52.
Additionally, we have addressed a longstanding problem by introducing a simple proxy of the experimental mixed-state entanglement. This entanglement proxy can serve as a universal quality-factor comparable amongst analogue and digital quantum devices as a guide for improving future systems, and may act as a probe for detecting topological order53,54 and measurement-induced criticality55.
Finally, we have studied the equivalent classical cost of our experiment on the level of global fidelity, which we note could be greatly increased through the use of erasure conversion21,56,57. Similar techniques could be applied to quantify the classical cost of measuring physical observables9,58, and to benchmark the performance of approximate classical algorithms themselves through comparison to high fidelity quantum data. Although here we have focused on one-dimensional systems to exploit the power of MPS representations, using higher-dimensional systems59,60, while maintaining high fidelities, may prove even more difficult for classical algorithms. We emphasize that in contrast to many previous experiments2–5 that explicitly targeted spatiotemporally complex quantum evolution when exploring the limits of classical simulation, here the dynamics we have studied are one-dimensional and both space- and time-independent, yet still begin to reach a regime of classical intractability. Ultimately, our results showcase the present and potential computational power of analogue quantum simulators, encouraging an auspicious future for these platforms18.
Online content
Any methods, additional references, Nature Portfolio reporting summaries, source data, extended data, supplementary information, acknowledgements, peer review information; details of author contributions and competing interests; and statements of data and code availability are available at 10.1038/s41586-024-07173-x.
Supplementary information
Acknowledgements
We thank J. Preskill, G. Chan, H.-Y. Huang, M. Stoudenmire, A. Baumgärtner, G. Nomura, E. Bataille, K. Leung and R. Tsai for their feedback on this work. We acknowledge support from the National Science Foundation (NSF) QLCI program (grant no. 2016245), the Department of Energy (grant no. DE-SC0021951), the Institute for Quantum Information and Matter (IQIM), an NSF Physics Frontiers Center (NSF grant no. PHY-1733907), the Defense Advanced Research Projects Agency (DARPA) ONISQ program (grant no. W911NF2010021), the Air Force Office of Scientific Research (AFOSR) YIP (grant no. FA9550-19-1-0044), Army Research Office MURI program (grant no. W911NF2010136), NSF CAREER award no. 2237244 and NSF CAREER award no. 1753386. Support is also acknowledged from the US Department of Energy, Office of Science, National Quantum Information Science Research Centers, Quantum Systems Accelerator. Z.C. acknowledges the DARPA grant no. 134371-5113608 award and NSF 10434. J.C. acknowledges support from the IQIM postdoctoral fellowship. P.S. acknowledges support from the IQIM postdoctoral fellowship. R.F. acknowledges support from the Troesh postdoctoral fellowship. A.E. acknowledges funding by the German National Academy of Sciences Leopoldina under the grant number LPDS 2021-02 and by the Walter Burke Institute for Theoretical Physics at Caltech.
Author contributions
A.L.S., P.S. and R.F. performed the experiments. A.L.S., Z.C. and J.C. performed the data analysis. A.L.S., Z.C., J.C., D.K.M. and A.E. contributed to underlying theory and associated numerics. A.L.S. and M.E. wrote the manuscript with contributions and input from all authors. S.C. and M.E. supervised this project.
Peer review
Peer review information
Nature thanks Rick van Bijnen and the other, anonymous, reviewer(s) for their contribution to the peer review of this work.
Data availability
The data supporting this study are available from the corresponding author upon request.
Code availability
The codes supporting this study are available from the corresponding author upon request.
Competing interests
The authors declare no competing interests.
Footnotes
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
These authors contributed equally: Adam L. Shaw, Zhuo Chen, Joonhee Choi, Daniel K. Mark
Contributor Information
Adam L. Shaw, Email: ashaw@caltech.edu
Soonwon Choi, Email: soonwon@mit.edu.
Manuel Endres, Email: mendres@caltech.edu.
Supplementary information
The online version contains supplementary material available at 10.1038/s41586-024-07173-x.
References
- 1.Preskill J. Quantum computing in the NISQ era and beyond. Quantum. 2018;2:79. [Google Scholar]
- 2.Arute F, et al. Quantum supremacy using a programmable superconducting processor. Nature. 2019;574:505–510. doi: 10.1038/s41586-019-1666-5. [DOI] [PubMed] [Google Scholar]
- 3.Wu Y, et al. Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett. 2021;127:180501. doi: 10.1103/PhysRevLett.127.180501. [DOI] [PubMed] [Google Scholar]
- 4.Zhu Q, et al. Quantum computational advantage via 60-qubit 24-cycle random circuit sampling. Sci. Bull. 2022;67:240. doi: 10.1016/j.scib.2021.10.017. [DOI] [PubMed] [Google Scholar]
- 5.Morvan, A. et al. Phase transition in random circuit sampling. Preprint at https://arxiv.org/abs/2304.11119 (2023).
- 6.Vidal G, Werner RF. Computable measure of entanglement. Phys. Rev. A. 2002;65:32314. [Google Scholar]
- 7.Preskill, J. Quantum computing and the entanglement frontier. Preprint at https://arxiv.org/abs/1203.5813 (2012).
- 8.Ghosh S, Deshpande A, Hangleiter D, Gorshkov AV, Fefferman B. Complexity phase transitions generated by entanglement. Phys. Rev. Lett. 2023;131:30601. doi: 10.1103/PhysRevLett.131.030601. [DOI] [PubMed] [Google Scholar]
- 9.Kechedzhi K, et al. Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments. Future Gener. Comput. Syst. 2024;153:431. [Google Scholar]
- 10.Bharti K, et al. Noisy intermediate-scale quantum algorithms. Rev. Modern Phys. 2022;94:15004. [Google Scholar]
- 11.Hauru, M. et al. Simulation of quantum physics with tensor processing units: brute-force computation of ground states and time evolution. Preprint at https://arxiv.org/abs/2111.10466 (2021).
- 12.Neill C, et al. A blueprint for demonstrating quantum supremacy with superconducting qubits. Science. 2018;360:195. doi: 10.1126/science.aao4309. [DOI] [PubMed] [Google Scholar]
- 13.Cross AW, Bishop LS, Sheldon S, Nation PD, Gambetta JM. Validating quantum computers using randomized model circuits. Phys. Rev. A. 2019;100:32328. [Google Scholar]
- 14.Choi J, et al. Preparing random states and benchmarking with many-body quantum chaos. Nature. 2023;613:468. doi: 10.1038/s41586-022-05442-1. [DOI] [PubMed] [Google Scholar]
- 15.Mark DK, Choi J, Shaw AL, Endres M, Choi S. Benchmarking quantum simulators using ergodic quantum dynamics. Phys. Rev. Lett. 2023;131:110601. doi: 10.1103/PhysRevLett.131.110601. [DOI] [PubMed] [Google Scholar]
- 16.Proctor T, Rudinger K, Young K, Nielsen E, Blume-Kohout R. Measuring the capabilities of quantum computers. Nat. Phys. 2022;18:75. doi: 10.1103/PhysRevLett.129.150502. [DOI] [PubMed] [Google Scholar]
- 17.Cirac JI, Zoller P. Goals and opportunities in quantum simulation. Nat. Phys. 2012;8:264. [Google Scholar]
- 18.Daley AJ, et al. Practical quantum advantage in quantum simulation. Nature. 2022;607:667. doi: 10.1038/s41586-022-04940-6. [DOI] [PubMed] [Google Scholar]
- 19.Browaeys A, Lahaye T. Many-body physics with individually controlled Rydberg atoms. Nat. Phys. 2020;16:132. [Google Scholar]
- 20.Altman E, et al. Quantum simulators: architectures and opportunities. PRX Quantum. 2021;2:17003. [Google Scholar]
- 21.Scholl P, et al. Erasure conversion in a high-fidelity Rydberg quantum simulator. Nature. 2023;622:273. doi: 10.1038/s41586-023-06516-4. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 22.Shaw AL, et al. Dark-state enhanced loading of an optical tweezer array. Phys. Rev. Lett. 2023;130:193402. doi: 10.1103/PhysRevLett.130.193402. [DOI] [PubMed] [Google Scholar]
- 23.Bridgeman JC, Chubb CT. Hand-waving and interpretive dance: an introductory course on tensor networks. J. Phys. A Math. Theor. 2017;50:223001. [Google Scholar]
- 24.Vidal G. Efficient classical simulation of slightly entangled quantum computations. Phys. Rev. Lett. 2003;91:147902. doi: 10.1103/PhysRevLett.91.147902. [DOI] [PubMed] [Google Scholar]
- 25.Zhou Y, Stoudenmire EM, Waintal X. What limits the simulation of quantum computers? Phys. Rev. X. 2020;10:41038. [Google Scholar]
- 26.Moses, S. A. et al. A race race track trapped-ion quantum processor. Phys. Rev. X13, 041052 (2023).
- 27.Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information (Cambridge Univ. Press, 2010).
- 28.Zhang X, Kim E, Mark DK, Choi S, Painter O. A superconducting quantum simulator based on a photonic-bandgap metamaterial. Science. 2023;379:278. doi: 10.1126/science.ade7651. [DOI] [PubMed] [Google Scholar]
- 29.Haah J, Hastings MB, Kothari R, Low GH. Quantum algorithm for simulating real time evolution of lattice Hamiltonians. SIAM J. Comput. 2021;52:6. [Google Scholar]
- 30.Tran MC, et al. Locality and digital quantum simulation of power-law interactions. Phys. Rev. X. 2019;9:31006. doi: 10.1103/PhysRevX.9.031006. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 31.Kaufman AM, et al. Quantum thermalization through entanglement in an isolated many-body system. Science. 2016;353:794. doi: 10.1126/science.aaf6725. [DOI] [PubMed] [Google Scholar]
- 32.Dalzell, A. M., Hunter-Jones, N., & Brandão, G. S. L. Random quantum circuits transform local noise into global white noise. Preprint at https://arxiv.org/abs/2111.14907 (2021).
- 33.Ganaie MA, Hu M, Malik AK, Tanveer M, Suganthan PN. Ensemble deep learning: a review. Eng. Appl. Artificial Intell. 2022;115:105151. [Google Scholar]
- 34.Islam R, et al. Measuring entanglement entropy in a quantum many-body system. Nature. 2015;528:77. doi: 10.1038/nature15750. [DOI] [PubMed] [Google Scholar]
- 35.Linke NM, et al. Measuring the Rényi entropy of a two-site Fermi-Hubbard model on a trapped ion quantum computer. Phys. Rev. A. 2018;98:52334. [Google Scholar]
- 36.Brydges T, et al. Probing Rényi entanglement entropy via randomized measurements. Science. 2019;364:260. doi: 10.1126/science.aau4963. [DOI] [PubMed] [Google Scholar]
- 37.Plenio MB. Logarithmic negativity: a full entanglement monotone that is not convex. Phys. Rev. Lett. 2005;95:90503. doi: 10.1103/PhysRevLett.95.090503. [DOI] [PubMed] [Google Scholar]
- 38.O’Donnell, R. & Wright, J. Efficient quantum tomography. In Proc. Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC ’16 899–912 (Association for Computing Machinery, 2016).
- 39.Haah J, Harrow AW, Ji Z, Wu X, Yu N. Sample-optimal tomography of quantum states. IEEE Trans. Inform. Theory. 2017;63:5628. [Google Scholar]
- 40.Elben A, et al. Mixed-state entanglement from local randomized measurements. Phys. Rev. Lett. 2020;125:200501. doi: 10.1103/PhysRevLett.125.200501. [DOI] [PubMed] [Google Scholar]
- 41.Mooney GJ, White GAL, Hill CD, Hollenberg LCL. Whole-device entanglement in a 65-qubit superconducting quantum computer. Adv. Quant. Technol. 2021;4:2100061. [Google Scholar]
- 42.Lee S, Chi DP, Oh SD, Kim J. Convex-roof extended negativity as an entanglement measure for bipartite quantum systems. Phys. Rev. A. 2003;68:62304. [Google Scholar]
- 43.Bhosale UT, Tomsovic S, Lakshminarayan A. Entanglement between two subsystems, the Wigner semicircle and extreme-value statistics. Phys. Rev. A. 2012;85:62331. [Google Scholar]
- 44.Datta A. Negativity of random pure states. Phys. Rev. A. 2010;81:52312. [Google Scholar]
- 45.Vidal G. Efficient simulation of one-dimensional quantum many-body systems. Phys. Rev. Lett. 2004;93:40502. doi: 10.1103/PhysRevLett.93.040502. [DOI] [PubMed] [Google Scholar]
- 46.Ganahl M, et al. Density matrix renormalization group with tensor processing units. PRX Quantum. 2023;4:10317. [Google Scholar]
- 47.Häner, T. & Steiger, D. S. 0.5 Petabyte simulation of a 45-qubit quantum circuit. In Proc. International Conference for High Performance Computing, Networking, Storage and Analysis, SC ’17 (Association for Computing Machinery, 2017).
- 48.Gross C, Bloch I. Quantum simulations with ultracold atoms in optical lattices. Science. 2017;357:995. doi: 10.1126/science.aal3837. [DOI] [PubMed] [Google Scholar]
- 49.Elben A, et al. Cross-platform verification of intermediate scale quantum devices. Phys. Rev. Lett. 2020;124:10504. doi: 10.1103/PhysRevLett.124.010504. [DOI] [PubMed] [Google Scholar]
- 50.Zhu D, et al. Cross-platform comparison of arbitrary quantum states. Nat. Commun. 2022;13:6620. doi: 10.1038/s41467-022-34279-5. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 51.Carrasco J, Elben A, Kokail C, Kraus B, Zoller P. Theoretical and experimental perspectives of quantum verification. PRX Quantum. 2021;2:10102. [Google Scholar]
- 52.Li Y, Benjamin SC. Efficient variational quantum simulator incorporating active error minimization. Phys. Rev. X. 2017;7:21050. [Google Scholar]
- 53.Lee YA, Vidal G. Entanglement negativity and topological order. Phys. Rev. A. 2013;88:42318. [Google Scholar]
- 54.Lu T-C, Hsieh TH, Grover T. Detecting topological order at finite temperature using entanglement negativity. Phys. Rev. Lett. 2020;125:116801. doi: 10.1103/PhysRevLett.125.116801. [DOI] [PubMed] [Google Scholar]
- 55.Sang S, et al. Entanglement negativity at measurement-induced criticality. PRX Quantum. 2021;2:30313. [Google Scholar]
- 56.Wu Y, Kolkowitz S, Puri S, Thompson JD. Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays. Nat. Commun. 2022;13:4657. doi: 10.1038/s41467-022-32094-6. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 57.Ma S, et al. High-fidelity gates and mid-circuit erasure conversion in an atomic qubit. Nature. 2023;622:279. doi: 10.1038/s41586-023-06438-1. [DOI] [PubMed] [Google Scholar]
- 58.Trivedi, R., Rubio, A. F. & Cirac, J. I. Quantum advantage and stability to errors in analogue quantum simulators. Preprint at https://arxiv.org/abs/2212.04924 (2022). [DOI] [PMC free article] [PubMed]
- 59.Scholl P, et al. Quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms. Nature. 2021;595:233. doi: 10.1038/s41586-021-03585-1. [DOI] [PubMed] [Google Scholar]
- 60.Ebadi S, et al. Quantum phases of matter on a 256-atom programmable quantum simulator. Nature. 2021;595:227. doi: 10.1038/s41586-021-03582-4. [DOI] [PubMed] [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Supplementary Materials
Data Availability Statement
The data supporting this study are available from the corresponding author upon request.
The codes supporting this study are available from the corresponding author upon request.