arXiv (All)
open access
Reducibility of native weighted graphs on Rydberg Arrays
We investigate the classical reducibility of random unit-disk graph (UDG) instances of the maximum independent set (MIS) and maximum weighted independent set (MWIS) problems, which can be natively realised in Rydberg atom quantum processors. Using state-of-the-art kernelisation techniques, we system
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quantum Speedups for Sampling and Non-convex Optimization with Stochastic Oracles#924423
- Quantum Speedups for Sampling and Non-convex Optimization with Stochastic Oracles#920192
- Conditioning-Free Non-Uniform Quantum Fourier and Chebyshev Transforms#1154538
- Post-quantum auditing for outsourced storage with probabilistic guarantees#221374
- Quantum State Designs from Minimally Random Quantum Circuits#1012003
Record · ID 1105039
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive