Reducibility of native weighted graphs on Rydberg Arrays
quant-ph, cond-mat.dis-nn, cond-mat.quant-gas, physics.atom-ph
Submitted: 2026-05-08
Updated: 2026-09-25
Terminology
Sources
- Quantum Computation by Adiabatic Evolution
- A Quantum Approximate Optimization Algorithm
- A tweezer array with 6100 highly coherent atomic qubits
- Continuous operation of a coherent 3,000-qubit system
- Industry applications of neutral-atom quantum computing solving independent set problems
- Exploring the impact of graph locality for the resolution of MIS with neutral atom devices
- Quantum Optimization for Maximum Independent Set Using Rydberg Atom Arrays
- Computational complexity of the Rydberg blockade in two dimensions
- Accelerating Reductions Using Graph Neural Networks and a New Concurrent Local Search for the Maximum Weight Independent Set Problem
- Quantum optimization with globally driven neutral atom arrays
- Targeted Branching for the Maximum Independent Set Problem
- Quantum Compilation Toolkit for Rydberg Atom Arrays with Implications for Problem Hardness and Quantum Speedups
- qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity