Demonstrates a quantum wire encoding using Rydberg atom chains to solve MWIS and QUBO problems on neutral atom arrays with reduced ancilla overhead and experimental validation.
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
fields
quant-ph 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Classical kernelisation fully reduces many small and sparse unit-disk graphs for MIS and MWIS native to Rydberg arrays, but dense graphs retain finite irreducible kernels, with vertex weights increasing reducibility and extended interaction ranges suppressing it.
An optimized adiabatic-impulse protocol reduces total time for crossing quantum critical points while preserving Kibble-Zurek scaling and attenuating noise-induced anti-Kibble-Zurek defects in the transverse Ising chain.
citing papers explorer
-
A quantum wire approach to weighted combinatorial graph optimisation problems
Demonstrates a quantum wire encoding using Rydberg atom chains to solve MWIS and QUBO problems on neutral atom arrays with reduced ancilla overhead and experimental validation.
-
Reducibility of native weighted graphs on Rydberg Arrays
Classical kernelisation fully reduces many small and sparse unit-disk graphs for MIS and MWIS native to Rydberg arrays, but dense graphs retain finite irreducible kernels, with vertex weights increasing reducibility and extended interaction ranges suppressing it.
-
Optimized adiabatic-impulse protocol preserving Kibble-Zurek scaling with attenuated anti-Kibble-Zurek behavior
An optimized adiabatic-impulse protocol reduces total time for crossing quantum critical points while preserving Kibble-Zurek scaling and attenuating noise-induced anti-Kibble-Zurek defects in the transverse Ising chain.