DQMW-Sample realizes a classically hard online learning primitive via dissipative quantum dynamics with sublinear regret and proven hardness for classical simulation including PH collapse.
A Rydberg Quantum Simulator
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
Following Feynman and as elaborated on by Lloyd, a universal quantum simulator (QS) is a controlled quantum device which reproduces the dynamics of any other many particle quantum system with short range interactions. This dynamics can refer to both coherent Hamiltonian and dissipative open system evolution. We investigate how laser excited Rydberg atoms in large spacing optical or magnetic lattices can provide an efficient implementation of a universal QS for spin models involving (high order) n-body interactions. This includes the simulation of Hamiltonians of exotic spin models involving n-particle constraints such as the Kitaev toric code, color code, and lattice gauge theories with spin liquid phases. In addition, it provides the ingredients for dissipative preparation of entangled states based on engineering n-particle reservoir couplings. The key basic building blocks of our architecture are efficient and high-fidelity n-qubit entangling gates via auxiliary Rydberg atoms, including a possible dissipative time step via optical pumping. This allows to mimic the time evolution of the system by a sequence of fast, parallel and high-fidelity n-particle coherent and dissipative Rydberg gates.
citation-role summary
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
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.