Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
Nature595, 233–238 (2021).2012.12268
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
A new classical algorithm for Gaussian boson sampling produces outputs closer to exact results than quantum experiments up to 1152 modes and scales efficiently, indicating hardware errors enable classical simulation.
citing papers explorer
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
Gaussian boson sampling: Benchmarking quantum advantage
A new classical algorithm for Gaussian boson sampling produces outputs closer to exact results than quantum experiments up to 1152 modes and scales efficiently, indicating hardware errors enable classical simulation.