Scalable and Near-Optimal Discrete Phase Shift Optimization for Reconfigurable Intelligent Surfaces with Over 20,000 Elements
Yuto Hama, Daisuke Kitayama, Kensuke Inaba, Toshimori Honjo, Hiroki Takesue, Naoki Ishikawa, and Hiroyuki Takahashi

TL;DR
This paper introduces a CIM-based optimization framework for large-scale RIS with over 20,000 elements, enabling efficient discrete phase shift optimization and near-optimal beam pattern formation.
Contribution
It formulates RIS phase optimization as a quadratic Ising model and demonstrates hardware-based solutions for large-scale problems with improved scalability.
Findings
Successfully optimized RIS with over 22,000 elements using CIM.
Achieved physically consistent beam patterns in various environments.
Introduced spin-size reduction for scalable optimization without performance loss.
Abstract
This paper proposes a novel optimization framework for discrete phase shifts of a reconfigurable intelligent surface (RIS) using a coherent Ising machine (CIM). Unlike conventional methods based on iterative convex approximation or combinatorial search with exponentially increasing complexity, the CIM physically explores the solution space of Ising Hamiltonians through collective mode competition in a network of optical oscillators, enabling efficient large-scale discrete optimization. We formulate the RIS discrete phase optimization problem as a quadratic Ising model, which supports both binary and quaternary phase shifts by appropriately mapping quantized phase states to spin variables. Using a real hardware CIM, we experimentally solve quadratic optimization problems for RISs with up to 22,201 elements. The results demonstrate that the proposed method achieves physically consistent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
