Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
A divide-and-conquer heuristic enables solving MWIS instances from molecular docking with graphs of 225-585 vertices on neutral-atom quantum emulators, outperforming greedy baselines and recovering provably optimal solutions on some instances.
A survey of quantum hardware platforms and methods for simulating condensed matter physics, covering ground states, topology, non-equilibrium dynamics, and the role of noisy devices as prototypes for fault-tolerant 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.
-
A Scalable Heuristic for Molecular Docking on Neutral-Atom Quantum Processors
A divide-and-conquer heuristic enables solving MWIS instances from molecular docking with graphs of 225-585 vertices on neutral-atom quantum emulators, outperforming greedy baselines and recovering provably optimal solutions on some instances.
-
Simulating Condensed Matter Physics on Quantum Hardware
A survey of quantum hardware platforms and methods for simulating condensed matter physics, covering ground states, topology, non-equilibrium dynamics, and the role of noisy devices as prototypes for fault-tolerant simulation.