WorksEngineering
Quantum Optimization Algorithm for Pinching-Antenna Activation with Max-Min Fairness
Abstract
In this letter, we propose a training-free quantum approximate optimization algorithm with a linear-ramp schedule (LR-QAOA) for antenna activation in pinching-antenna systems (PASS). Since all active pinching antennas (PAs) share one feed and split its power, maximizing the signal-to-noise ratio (SNR) of the weakest user becomes a combinatorial max-min problem that must be re-solved whenever the users move. We formulate the problem as a two-local Ising Hamiltonian with one qubit per PA and no penalty terms, employing a weightedsum surrogate to prioritize weaker users. Instead of training the circuit with a classical optimizer, the proposed LR-QAOA method tunes its parameters via a linear ramp; the measured patterns are ranked by the exact max-min objective, and the best ones are refined with a short local search using the same number of evaluated patterns. Monte Carlo simulations show that the proposed LR-QAOA method outperforms greedy activation, projection-guided activation, and semidefinite relaxation-based classical baseline methods when all methods test the same number of PA on/off patterns. Experiments on real IBM Quantum hardware further show that the execution time remains nearly constant as the number of PAs grows, whereas exhaustive search grows exponentially. However, gate noise in the NISQ era restricts near-optimal hardware solutions to small numbers of antennas only.
Introduction
[1]-antenna systems (PASS) carry a radio-frequency signal along a low-loss dielectric waveguide and radiate it only where a small dielectric “pinch” touches the guide [1]. Each pinch acts as an antenna, and since the waveguide can extend over many meters, the radiating points can be placed close to the users. PASS thus converts the problem of large-scale path loss into one of selecting good positions, establishing strong line-of-sight links with very simple hardware [2].
Since moving the pinches mechanically is slow, low-complexity deployments pre-install the pinching antennas (PAs) at fixed positions and only switch them on or off [3]–[5]. However, this simplification comes at an algorithmic price. Because all active PAs share a single feed, their signals add coherently while the transmit power is split among them. Consequently, a new PA adds a path but weakens every other one, and a PA that adds in phase at one user may cancel at another. For PAs, the problem is combinatorial, with candidate patterns, and must be solved again whenever the users move.
When one PA pattern serves several users, fairness matters. Maximizing the signal-to-noise ratio (SNR) of the weakest user leads to a max-min fractional 0–1 program [5], which is a quadratic fractional problem even for a single user [6]. Existing approaches trade optimality for speed, e.g., game-theoretic activation [3], projection-guided greedy activation (PGGA) [4], deep learning [6], and trellis-based Viterbi state selection (VSS) [5]. Semidefinite relaxation (SDR) [7] remains the classical general-purpose tool for such binary quadratic problems. As shown in this work, greedy methods tend to stop too early, since the power split makes almost every addition appear harmful, whereas exhaustive search becomes impractical for real-time operation beyond about 20 PAs.
Quantum optimization offers a different route. The quantum approximate optimization algorithm (QAOA) [8], [9] prepares a parameterized quantum state that favors low-energy solutions of an Ising Hamiltonian and samples from it, which makes it a natural fit for binary optimization problems. Prior works have investigated quantum optimization for MIMO detection [10], [11], and QAOA for RIS phase optimization [12] and MIMO-QAM data detection [13]. Despite these works, several research gaps remain. First, to the best of our knowledge, PA activation has not yet been formulated as an Ising problem, and such a formulation is not immediate, since the max-min objective contains both a ratio and a minimum, neither of which is quadratic. Second, standard QAOA tunes circuit angles for every instance with a classical optimizer, which is too slow when every channel realization is a new instance. Linear-ramp QAOA (LR-QAOA) avoids this by fixing all angles through a single scale parameter that transfers across instances [14], but has not been applied to PA activation problem yet. Third, gate noise, which grows with circuit size, limits current hardware, so both the execution time and the achieved quality must be evaluated on real quantum devices. This work addresses these three gaps through the following contributions:
We formulate max-min PA activation as a two-local Ising Hamiltonian with one qubit per PA and no penalty terms, and analyze how its weighted-sum surrogate ranks the true optimum.
We propose a training-free LR-QAOA framework with post-selection on the exact objective and a short local refinement. We compare the proposed LR-QAOA framework with greedy activation, PGGA, and SDR-based classical baseline methods.
We validate the proposed QAOA approach on IBM Quantum hardware with up to 120 qubits and report both the quantum processing unit (QPU) time and the solution quality actually achieved.
Together, these contributions show that LR-QAOA finds better activation patterns than greedy, PGGA [4], and SDR [7] in the multi-user case. Moreover, its time complexity scales more favorably than that of exhaustive search, which makes LR-QAOA a scalable candidate for PASS as quantum hardware improves, since its complexity grows polynomially with the number of PAs and linearly with the number of users.
The remainder of this work is organized as follows. § 2 presents the system model and the Ising formulation. § 3 presents the LR-QAOA algorithm, and § 4 presents the simulation and hardware results, while § 5 concludes the paper.
Notations: Matrices and vectors are denoted by boldface uppercase () and lowercase () letters, respectively. The transpose and the conjugate transpose of are denoted by and , respectively. denotes the real part, the absolute value, the Euclidean norm, and the all-ones vector. A complex Gaussian random variable with mean and variance is denoted by . and denote the Pauli- and Pauli- operators acting on qubit , and the computational basis states, , and the -fold tensor product. The single-qubit rotation gates are and , the two-qubit rotation is , and CNOT denotes the controlled-NOT gate.
System Model and Ising Formulation
PASS Model
We consider the PASS model of [5], as shown in Figure 1. A waveguide of length is deployed along the -axis at height and is fed at . The PAs are located at , and single-antenna users are located at , where and are uniformly distributed in and are assumed to be known at the base station. Neglecting in-waveguide loss, the effective channel from PA to user is given by

Figure 1. PASS with a waveguide of length at height carrying pre-installed PAs; one activation pattern serves users.
where denotes the guided wavelength, and denotes the channel vector of the -th user. An activation vector switches on PAs, which share the transmit power equally. Under time-division access, the SNR of user is given by
where is the free-space path-loss scaling factor, denotes the speed of light, the carrier frequency, the transmit power, and the variance of the additive white Gaussian noise . The corresponding achievable rate is . To ensure fairness across users, the max-min activation problem is given by [5]
Ising Formulation of the Max-Min Problem
To be solved by QAOA, the optimization problem must be expressed as a quadratic function of the binary activation variables, i.e., as an Ising Hamiltonian. However, the problem in (3), contains a ratio and a minimum over the users, neither of which is quadratic. Therefore, we replace it by a quadratic surrogate, which we build in three steps. First, note that for binary , the numerator is a quadratic form given by , where . The off-diagonal entries of are positive for PA pairs that arrive in phase at user and negative for pairs that cancel. Second, following Dinkelbach’s method [15], holds if and only if for every user, and hence the ratio becomes a price on each active PA. Instead of iterating on , we adopt a fixed price . Third, we replace the minimum by a weighted sum with weights , which assigns more weight to users with weak channels. Combining these steps yields the surrogate objective
where is a fraction of the weighted power of the best single PA. Since , maximizing is equivalent to minimizing . Substituting and replacing by the Pauli operator yields, up to a constant, the Ising Hamiltonian
with local fields and pairwise couplings given by
where indicates that PA is active. Since the problem is unconstrained, requires no penalty terms, and every measured bitstring except the all-zero one corresponds to a valid pattern.
The surrogate is bounded below by an affine function of as
since every user’s gain is at least that of the worst user, with equality for a single user. Hence, a pattern with a good worst user always has a large , i.e., a low energy of , so the max-min optimum remains among the low-energy patterns that QAOA favors, and post-selection on picks it among the sampled patterns. Since a large does not guarantee a large , this bound loosens as users are added, which is why we add local refinement in § 3. Finally, sets the price of each active PA, such that activates too many PAs and activates very few or none.
LR-QAOA With Local Refinement
Starting from the initial state , which is the ground state of the mixer Hamiltonian and assigns equal probability to every activation pattern, a depth- circuit prepares
Since all terms of in (5) are diagonal in the computational basis and therefore commute, the cost unitary factorizes exactly into single- and two-qubit rotations,
Algorithm 1 LR-QAOA for Max-Min PA Activation
Require: , depth , scale , factors , number of evaluated patterns
Phase 1: Hamiltonian and schedule (classical)
,
Compute , by (6) and , by (10)
Phase 2: Sampling (quantum)
From , apply layers of cost and mixer
Measure shots; distinct nonzero patterns
Phase 3: Post-selection and refinement (classical)
Sort by decreasing ; best of
for each , until more evaluations are used do
repeat flip PAs of one at a time in random order; accept the first flip that raises
until no flip improves
end for
return
where acts on qubits and . The cost layer imprints on each pattern a phase proportional to its cost, so that, for the computational basis state , , where denotes the energy of under . Similarly, the mixer factorizes into independent single-qubit rotations , which let the amplitudes of patterns that differ in one PA interfere. Through this interplay of phases and interference, the amplitudes of low-energy patterns grow, whereas those of high-energy patterns are suppressed. As depicted in Figure 2, each cost layer thus uses one gate per PA and one CNOT––CNOT block per coupling, whereas each mixer layer uses rotations. Since is generally dense, every pair of PAs is coupled, and one layer contains two-qubit blocks.

Figure 2. LR-QAOA circuit with linear-ramp layers; measured patterns are post-selected on and refined by local search.
Measuring in the computational basis returns pattern with probability , where outcome is read as . QAOA is therefore used here as a sampler rather than as an estimator of : we only require that good patterns appear among the measured ones, not that the most frequent pattern be optimal. This viewpoint matters because, as shown in § 4-A, the ground state of is often not the max-min optimum.
Standard QAOA tunes the angles for each instance with a classical optimizer, which requires many repeated circuit executions per channel realization. Rather than training the angles, we fix them by a linear-ramp schedule, given by [14, 16]
where the single scale parameter is selected once offline and applied to all instances. The schedule in (10) mimics a first-order Trotterization of the annealing path , , with acting as the time step: the cost angles increase while the mixer angles decrease, so the circuit gradually shifts weight from to . A small keeps the state close to , so that the samples approach uniform sampling, whereas a very large increases the discretization error. Within a broad intermediate range, the samples concentrate on low-energy patterns without any per-instance training, which makes the schedule suitable when the users move and a new instance arises in every channel realization.
As outlined in Algorithm 1, the measured patterns are scored with the exact objective rather than the surrogate, which corrects for the mismatch between and discussed in § 2-B. The remaining evaluations are spent on a single-flip local search started from the best measured patterns, so exactly patterns are evaluated in total, as for every sampling baseline. In the remainder of this work, “LR-QAOA” refers to this complete procedure.
Complexity Analysis: The LR-QAOA circuit requires qubits and gate operations, or a depth of with a swap network [17]. Phases 1 and 3 require operations, and no classical optimization loop is involved. Moreover, since one evaluation of takes about 5 s on a CPU, whereas one shot on current hardware takes 1.4–7.8 ms including overheads, replacing half of the shots by local search halves the number of shots and thus reduces the QPU time. In contrast, exhaustive search requires operations with Gray-code updates.
Numerical Results
Simulation Results
We consider a simulation scenario by adopting the parameters of [5], i.e., m, m, GHz, , a noise power of dBm, and dBm, and use , , and unless stated otherwise. The scale is selected once offline on 60 held-out instances with and kept fixed for all other instances. LR-QAOA is compared with greedy activation, PGGA [4], and SDR with Gaussian randomization [7] using the same number of evaluated patterns . The surrogate does not always place the optimum at the ground state of , especially when several users are served. Still, the optimum usually lies among the lowest-energy patterns, so post-selection on picks it up from the samples. A small favors many active PAs, which the power split penalizes. In practice, the choice of matters little, since the loss is almost the same for any between 0.7 and 1. We therefore fix offline, just like , and use .
Figure 3(a) shows the worst-user rate versus for and , averaged over 1000 instances. It can be observed that the performance of LR-QAOA almost overlaps the exhaustive search upper bound for all , even though it looks at only a tiny fraction of the patterns, whereas SDR falls slightly further behind as grows. Furthermore, the classical greedy activation and PGGA methods show a much larger performance gap since both of these methods add one PA at a time and stop as soon as no single addition improves . Because every new PA takes power away from the others, adding one PA often lowers , even when adding several PAs together would raise it. Therefore, these baseline methods stop too early, with fewer active PAs than the optimal pattern.

Figure 3. (a) Worst-user rate versus , (b) rate loss of LR-QAOA versus , and (c) execution time versus on ibm_fez quantum processor.
We define the rate loss of a method that returns the pattern as
where and is the solution of (3), found by exhaustive search over all patterns. Figure 3(b) shows the rate loss of LR-QAOA versus for , 16, and 20, using post-selection only. It can be observed that for , a few tens of patterns are enough to bring the loss below 0.03 bps/Hz (dotted line), whereas needs a few hundred, and more as grows. Hence, more users need more evaluated patterns to reach the same rate loss.
Quantum Hardware Results
Next, we execute LR-QAOA on the 156-qubit IBM Heron processor ibm_fez for –120, with , , and 32 shots per instance, using Pauli twirling and dynamical decoupling. Given QPU access costs, we limit sampling to 32 shots and refine the best measured shot with a short local search of at most 512 evaluations. SDR uses the same number of randomized candidates. The QPU time excludes queuing and transpilation overheads, whereas exhaustive search and SDR run on a CPU. Since exhaustive search cannot be evaluated beyond on a classical CPU, the runtime results are extrapolated beyond . Exhaustive search and SDR runtimes are reported for a server with two AMD EPYC 9555 64-core processors (128 cores, 256 threads) and 1 TB of RAM, where SDR is solved by CVXPY [18].
Figure 3(c) compares the runtimes of the proposed LR-QAOA on actual quantum hardware with that of the classical exhaustive search and SDR on classical CPU. It can be observed that the QPU run-time of LR-QAOA stays at 2 s for every , because it is set by the fixed overhead of each job rather than by the number of qubits. Exhaustive search, on the other hand, doubles its CPU time with every added PA and becomes slower than LR-QAOA beyond . Furthermore, it can be observed that the runtime of SDR keeps growing with and is more than that of the quantum runtime for beyond PAs.
Table I compares the run times and worst user rates of the LR-QAOA on quantum hardware against the classical exhaustive search (Exh.) and SDR-based methods. Here, Shots denotes the worst-user rate of the best of the 32 measured patterns, i.e., LR-QAOA with post-selection on but without local search. For , the time of exhaustive search is extrapolated from the 36.4 ns per pattern measured at . The table shows that LR-QAOA keeps its advantage over SDR on real hardware as well. It finds the optimum for every and comes very close at , while SDR misses it at several sizes. For larger , the two methods are nearly equal at , and LR-QAOA is clearly better at and 120. The LR-QAOA based on shots without post selection, however, are far from optimal, because the circuit contains two-qubit blocks whose errors add up even with error mitigation. Most of the gain therefore comes from the local search post-selection. Therefore, we do not claim a quantum advantage on today’s hardware. However, our quantum hardware results show that the QPU run-time does not grow with , so the advantage over exhaustive search will become usable as quantum hardware gate errors come down in the future.
| Time (s) Exh. | Time (s) QPU | Time (s) SDR | Rate (bps/Hz) Exh. | Rate (bps/Hz) LR-QAOA | Rate (bps/Hz) Shots | Rate (bps/Hz) SDR | |
| 6 | 2.0 | 0.07 | 4.137 | 4.137 | 3.915 | 4.137 | |
| 8 | 2.0 | 0.34 | 4.402 | 4.402 | 4.402 | 4.402 | |
| 10 | 2.0 | 0.07 | 4.460 | 4.460 | 3.941 | 4.058 | |
| 12 | 2.0 | 0.53 | 4.677 | 4.677 | 4.001 | 4.677 | |
| 16 | 2.0 | 0.83 | 5.213 | 5.213 | 4.016 | 5.213 | |
| 20 | 2.0 | 0.90 | 5.167 | 5.167 | 4.439 | 4.973 | |
| 24 | 0.61 | 2.0 | 2.65 | 5.737 | 5.712 | 4.057 | 5.550 |
| 32 | 2.0 | 47.6 | – | 5.585 | 3.605 | 5.603 | |
| 64 | 2.0 | 83.8 | – | 6.330 | 3.769 | 5.918 | |
| 120 | 2.0 | 212.8 | – | 7.343 | 3.874 | 3.182 |
Table 1. Runtime and worst-user rate comparison for users.
Conclusion
We have proposed a training-free quantum optimization algorithm that selects which pinching antennas to activate in PASS to maximize the worst-user rate. We mapped the max-min SNR optimization problem to a two-local Ising Hamiltonian with one qubit per PA and no penalty terms through a quadratic surrogate that is lower-bounded by the worst-user SNR, with equality for a single user. Since this bound loosens for several users, the LR-QAOA samples are post-selected on the exact objective and refined by a short local search. Our simulation results show that LR-QAOA outperforms greedy activation, PGGA, and SDR-based classical baseline methods when all methods test the same number of PA on/off patterns. Furthermore, on the IBM quantum processor ibm_fez, the LR-QAOA takes only 2 s of QPU run-time for up to 120 qubits, and with local search post-selection, LR-QAOA finds the optimum up to and beats SDR for large . However, in the NISQ era, due to quantum hardware gate noise, most of the gain of the proposed LR-QAOA comes from the local search post-selection. Future work will focus on investigating shallower hardware-aware circuits, stronger error mitigation, and multi-waveguide PASS systems.
References
- [1]A. Fukuda, H. Yamamoto, H. Okazaki, Y. Suzuki, and K. Kawai, “Pinching antenna: Using a dielectric waveguide as an antenna,” NTT DOCOMO Technical Journal, vol. 23, no. 3, pp. 5–12, 2022.
- [2]Y. Liu, H. Jiang, X. Xu, Z. Wang, J. Guo, C. Ouyang, X. Mu, Z. Ding, A. Nallanathan, G. K. Karagiannidis, and R. Schober, “Pinching-antenna systems (PASS): A tutorial,” pp. 4881–4918, 2026.DOI
- [3]K. Wang, Z. Ding, and G. K. Karagiannidis, “Antenna activation and resource allocation in multi-waveguide pinching-antenna systems,” IEEE Transactions on Wireless Communications, vol. 25, pp. 4070–4082, 2026.arxiv.org/abs/2505.02864
- [4]L. Cao, H. Yin, X. Pei, R. Song, and Y. Liu, “Multi-pin and movable-pin enabled discretely-activated pinching antenna systems,” IEEE Wireless Communications Letters, vol. 15, pp. 590–594, 2026.DOI
- [5]V. E. Galanopoulou, T. K. Yiokou, G. D. Karagiannidis, S. A. Tegos, and P. D. Diamantoulakis, “Viterbi state selection for discrete pinching antenna systems,” IEEE Communications Letters, vol. 30, pp. 1523–1527, 2026.
- [6]O. G. Karagiannidis, V. E. Galanopoulou, P. D. Diamantoulakis, Z. Ding, and O. A. Dobre, “Deep learning optimization of two-state pinching antennas systems,” IEEE Transactions on Cognitive Communications and Networking, vol. 12, pp. 4942–4956, 2026.arxiv.org/abs/2507.06222
- [7]Z.-Q. Luo, W.-K. Ma, A. C.-C. So, Y. Ye, and S. Zhang, “Semidefinite relaxation of quadratic optimization problems,” IEEE Signal Processing Magazine, vol. 27, no. 3, pp. 20–34, 2010.DOI
- [8]E. Farhi, J. Goldstone, and S. Gutmann, “A quantum approximate optimization algorithm,” arXiv:1411.4028, 2014.arxiv.org/abs/1411.4028
- [9]K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer, “A review on quantum approximate optimization algorithm and its variants,” Physics Reports, vol. 1068, pp. 1–66, 2024.DOI
- [10]J. Cui, Y. Xiong, S. X. Ng, and L. Hanzo, “Quantum approximate optimization algorithm based maximum likelihood detection,” IEEE Transactions on Communications, vol. 70, no. 8, pp. 5386–5400, 2022.arxiv.org/abs/2107.05020
- [11]M. Kim, D. Venturelli, and K. Jamieson, “Leveraging quantum annealing for large MIMO processing in centralized radio access networks,” in Proc. ACM SIGCOMM, 2019, pp. 241–255.DOI
- [12]S. Paul and N. K. Kundu, “Efficient quantum algorithm for phase optimization of 1-bit RIS-assisted MIMO communication system,” 2026. [Online]. Available: https://arxiv.org/abs/2607.14700
- [13]S. Paul, S. Banerjee, D. Bhowmik, and N. K. Kundu, “Warm-start quantum approximate optimization algorithm for QAM MIMO data detection,” 2026. [Online]. Available: https://arxiv.org/abs/2604.18479
- [14]J. A. Montañez-Barrera and K. Michielsen, “Toward a linear-ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems,” npj Quantum Information, vol. 11, p. 131, 2025.
- [15]W. Dinkelbach, “On nonlinear fractional programming,” Management Science, vol. 13, no. 7, pp. 492–498, 1967.DOI
- [16]S. H. Sack and M. Serbyn, “Quantum annealing initialization of the quantum approximate optimization algorithm,” Quantum, vol. 5, p. 491, 2021.DOI
- [17]B. O’Gorman, W. J. Huggins, E. G. Rieffel, and K. B. Whaley, “Generalized swap networks for near-term quantum computing,” 2019. [Online]. Available: https://arxiv.org/abs/1905.05118
- [18]S. Diamond and S. Boyd, “CVXPY: A Python-embedded modeling language for convex optimization,” Journal of Machine Learning Research, vol. 17, no. 83, pp. 1–5, 2016.