Pith. sign in

REVIEW 4 major objections 5 minor 22 references

Optimization of Connection Patterns between Mobile Phones and Base Stations using Quantum Annealing

T0 review · 4 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Restricting phones to the top two base stations cuts qubit needs and improves solution accuracy as problems grow.

desk verdict Useful application of a known variable-reduction trick to base-station assignment; the empirical advantage claim is plausible but rests on an unverified top-2 feasibility assumption. read the letter →

arxiv 2412.19434 v2 pith:R4FN7D5F submitted 2024-12-27 quant-ph

Taisei Takabayashi , Shoichi Sudo , Toshihiro Aoki , Shun Seo , Masayuki Ohzeki This is my paper · ORCID
classification quant-ph
keywords quantumannealingQUBOvariablereductionbasestationassignmentSINRmaximizationcapacityconstraintssimulatedwirelessnetworkoptimization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that a reduced QUBO formulation, in which each mobile phone may connect only to the base station giving the highest or second-highest SINR, is better suited to quantum annealing than the standard assignment QUBO. Because the one-hot “connect to exactly one station” constraint disappears, the number of logical variables drops from $N \times M$ to $N$, so far fewer qubits are needed to embed the problem on an annealer. In experiments with three base stations and up to roughly fifty phones, the reduced formulation produced approximate solutions closer to the exact optimum across all tested placement and antenna-beam patterns, and its advantage over the naive formulation grew with problem size even under simulated annealing. A sympathetic reader would care because the variable reduction lets qubit-limited hardware address larger wireless connection-optimization instances, and the same “best-or-second-best” idea may transfer to other resource-allocation problems.

What carries the argument

The central object is the variable-reduction QUBO of Eq. (11). Each mobile phone gets one binary variable: 1 means connect to the base station with the highest SINR, and 0 means connect to the second-highest. The capacity constraint is imposed as a quadratic penalty on the total number of phones assigned to each base station, and because each phone automatically picks exactly one of its two allowed stations, the one-hot constraint of the naive formulation is unnecessary. This machinery reduces logical variables from $N \times M$ to $N$, removes $N(M-1)$ redundant variables, and is the reason the qubit count and solution accuracy behave differently from the naive QUBO.

What would settle it

Construct a three-station instance with $N \approx 50$ and biased phone placement whose unique exact optimum assigns at least one phone to its third-best base station; then the reduced QUBO cannot represent that optimum and has a strictly positive floor on its relative error. Checking whether that floor grows with $N$ would settle whether the reported accuracy advantage is intrinsic to the reduced search space or an artifact of the heuristics struggling with the naive QUBO.

Watch

Extended reading notes

Core claim

The central claim is that the reduced variable formulation, defined by Eq. (11), is not merely a space-saver: it also returns more accurate approximate solutions. In this formulation, a single binary variable per phone records whether the phone connects to its highest-SINR or second-highest-SINR base station, so the one-hot constraint disappears and the logical variable count is $N$ instead of $N \times M$. Experiments on a quantum annealer across four placement and beam-pattern combinations show smaller relative error for the reduced QUBO, and simulated-annealing runs show the advantage widening as the number of phones grows, with the accuracy crossing around $N = 30$ to $40$. The explanation offered is that fewer logical variables mean fewer physical qubits and fewer error sources on the device, and a smaller search space is easier for both heuristics.

Load-bearing premise

The premise is that in the tested instances the capacity constraints never force so many phones onto their third-best or lower base stations that the top-two-only search space excludes solutions close to the true optimum.

Editorial extensions

If this is right

  • On a fixed annealer, the number of mobile phones that can be embedded rises substantially: with three base stations the logical variable count is one third of the naive QUBO, and the measured qubit count grows more slowly.
  • For a fixed problem size, quantum-annealer solutions have smaller relative error under the reduced formulation, across isotropic and Gaussian beam patterns and uniform and biased phone placements.
  • Under simulated annealing, the reduced formulation's relative error stays low as the number of phones grows from small values to roughly fifty, while the naive QUBO's error worsens after about thirty to forty phones.
  • Because the one-hot constraint is gone, the reduced QUBO no longer needs the penalty coefficient attached to that constraint, removing one tuning parameter from the optimization.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • An implication the paper leaves implicit is that the top-two restriction is a tunable prior: replacing “top two” with “top $k$” for small $k$ would create a family of formulations trading qubits against solution-space coverage, and the crossover where the reduced form loses to the naive form could be located empirically.
  • The accuracy crossover in simulated annealing around $N \approx 30$ to $40$ likely depends on the penalty coefficients in the naive QUBO; retuning those coefficients for each problem size might push the crossover to larger $N$, a comparison the paper does not make.
  • If the same reduction is applied to other assignment problems where the “best two” assumption is less natural than in wireless connection planning, the qubit savings would survive but the accuracy advantage could invert; testing such a problem would separate the benefit of variable reduction from the benefit of domain structure.
  • A practical consequence not developed in the paper is that, since mobile positions change over time and connection patterns must be reoptimized periodically, a formulation using fewer qubits and staying accurate under simulated annealing could be run more frequently on classical hardware, not only on quantum annealers.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper proposes a QUBO formulation for optimizing the connection pattern between mobile phones and base stations, in which each phone is restricted to connecting to either its highest-SINR or second-highest-SINR base station (Eq. 10, used in Eq. 11). This reduces the number of logical variables from N×M in the naive formulation (Eq. 9) to N. The authors compare the two formulations on D-Wave Advantage 6.4 and simulated annealing, measuring the required number of qubits and the relative error of the obtained solution with respect to the exact optimum computed by Gurobi. They report that the proposed formulation uses fewer qubits and yields smaller relative errors, with the gap increasing with problem size in the SA comparison (Figs. 4, 5, 7).

Significance. If validated, the variable-reduction strategy is practically attractive because it allows larger instances to be embedded on current quantum annealers and appears to improve the quality of approximate solutions obtained by QUBO heuristics. The paper has a concrete experimental design: random instances, four test patterns, a comparison against Gurobi's exact optimum, and a classical counterpart (SA). These are strengths. However, the central empirical claim that the proposed formulation yields 'more accurate approximate solutions' to the original problem is not yet supported because the paper does not establish that the top-2 restriction can represent the original optimum (or a close approximation of it), nor does it check feasibility of the restricted problem.

major comments (4)
  1. [Proposed formulation (Eq. (11))] The restricted formulation (11) assumes every phone can be assigned to its best or second-best base station, but the paper never verifies that the resulting capacity constraints can be satisfied. In the biased test patterns (Table 1), 60% of phones are placed near one base station, so many phones may share the same top-2 set; with M=3 and equal capacities C_a=N/3, the capacity of the remaining base station may become unsatisfiable, making Eq. (11) infeasible. In such cases no feasible sample exists, so the 'feasible solution with the lowest cost' selected in the experiments is undefined, and the relative error (E-E*)/E* in Fig. 5 would compare an infeasible assignment against a feasible optimum. The authors need to report the feasibility rate of Eq. (11) for every test pattern and either exclude infeasible instances or handle them explicitly.
  2. [Experiments, Figs. 5 and 7] The comparison against the original optimum E* does not separate the loss caused by the top-2 restriction from the loss caused by heuristic suboptimality. If the exact optimum of the restricted problem (11) is substantially worse than E*, then the proposed formulation cannot be claimed to provide more accurate approximate solutions to the original problem, regardless of how well SA or QA explores the restricted space. The authors should compute the optimum of Eq. (11) (e.g., with Gurobi) on the same instances and report this restricted-optimum gap. Without it, the observed advantage may simply reflect that the naive QUBO (9) has a harder penalty landscape for the heuristics, rather than that the proposed search space is better.
  3. [Fig. 7] The central scaling claim that the proposed formulation outperforms the naive formulation as N grows is based on Fig. 7, but this figure has no error bars and the text does not state how many random instances were used for each value of N. The crossover near N=30-40 could be due to random fluctuation. The authors should report the number of instances and confidence intervals (or at least standard deviations) for each N, and ideally apply the same statistical treatment to Fig. 5.
  4. [Experiments, hyperparameters] The values of the penalty parameters λ1 and λ2 in Eq. (9) and λ' in Eq. (11) are not specified. The relative performance of the two formulations can depend substantially on these weights; in particular, a poorly chosen λ2 in the naive formulation may produce solutions that violate capacity constraints or, conversely, force a poor SINR trade-off. For reproducibility and a fair comparison, the paper must report the penalty values used (or the tuning procedure) and ideally show how the main conclusions vary over a reasonable range of these hyperparameters.
minor comments (5)
  1. [Section 3.1 (after Eq. (9))] 'his is not ideal' is a typo and should read 'This is not ideal.'
  2. [Eq. (6)] The relation between the half-power beam width θ and σ is incorrectly typeset; the standard expression is θ = 2√(2 ln 2) σ, not the form displayed.
  3. [Reference [19]] Reference [19] cites only a presentation title ('Qubits2023'); the proposed formulation is taken from that prior work, so the paper should provide a citable reference or enough procedural detail to make the formulation self-contained.
  4. [Notation in Eq. (1)] The symbol N is used both for the number of mobile phones and for the noise power in Eq. (1); using a different symbol (e.g., N0) for the noise would avoid confusion.
  5. [Problem setting and experiments] The concrete parameters of the SINR model (frequency f, noise power, transmission antenna gain, and the linear value of the sidelobe level) are not reported, which hampers reproduction of the SINR values and thus of the QUBO coefficients.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the proposed top-2 formulation is an explicit ansatz evaluated against the independent Gurobi optimum; the self-citation supplies provenance, not evidence.

full rationale

The paper's derivation chain is: define the full SINR-maximization problem (8), write the conventional QUBO (9), then adopt a variable-reduction ansatz (10)-(11) in which each phone is restricted to its best or second-best base station, citing the same authors' earlier presentation [19] for the origin of the ansatz. The central accuracy claims are then tested empirically: the proposed and naive QUBOs are solved on the D-Wave annealer and with simulated annealing, and their costs are compared with the exact optimum of the original problem (8) computed by Gurobi. There is no step in which a predicted quantity is defined in terms of the target claim, no fitted parameter is renamed as a prediction, and no uniqueness theorem is imported from the authors' prior work. The top-2 restriction is an openly stated modeling assumption, and the paper explicitly acknowledges in the conclusion that even an exact solution of (11) need not be optimal for (8); that is a limitation on approximation quality, not a circularity. The self-citation [19] is provenance for the formulation, but the empirical comparison against an independent external solver (Gurobi) and against the naive baseline means the citation is not load-bearing evidence. Possible concerns about infeasibility of the restricted search space or about heuristic difficulty are correctness/validity issues, not equivalence-by-construction, so the circularity score is 0.

Assumptions & free parameters 3 free parameters · 3 assumptions · 0 invented entities

The central claim rests on the choice of penalty coefficients, which are not reported or justified, and on the untested premise that restricting phones to their top-2 base stations does not exclude near-optimal solutions in the tested regimes. No new physical or mathematical entities are invented.

free parameters (3)
  • λ1 = not reported
    Penalty weight for the one-hot constraint in the naive QUBO (Eq. 9). Its value affects the feasibility and quality of solutions from the quantum annealer, and it is not specified or tuned explicitly.
  • λ2 = not reported
    Penalty weight for the capacity constraint in the naive QUBO (Eq. 9). Together with λ1 it shapes the landscape that D-Wave and SA are optimizing; not reported.
  • λ' = not reported
    Penalty weight for the capacity constraint in the proposed QUBO (Eq. 11). Not reported, so the reader cannot assess how hard the capacity constraints are being enforced.
assumptions (3)
  • domain assumption Free-space path loss and the SINR model (Eqs. 1-3) accurately capture communication quality for the comparison.
    Used in Section 2 to compute S_{i,a}. This simplification neglects shadowing, multipath, and traffic dynamics, but it applies symmetrically to both formulations.
  • domain assumption Each mobile phone's top-2 base stations are sufficient to reach solutions close to the original optimum in the tested instances.
    This is the core premise behind the new formulation, stated in Section 3.2 and implicitly relied on in the experiments; not validated by computing the restricted problem's optimum.
  • standard math The QUBO-to-Ising mapping and the use of penalty methods to enforce constraints is standard.
    The paper relies on the standard reduction of constrained optimization with penalties to QUBO (Eq. 9), citing Glover et al. and Lucas.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Optimization of Connection Patterns between Mobile Phones and Base Stations using Quantum Annealing." pith.science (2026). https://pith.science/paper/R4FN7D5F

@misc{pith2026241219434,
  author       = {Pith},
  title        = {Pith review of: Optimization of Connection Patterns between Mobile Phones and Base Stations using Quantum Annealing},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/R4FN7D5F}},
  note         = {Machine review of arXiv:2412.19434}
}
read the original abstract

In current mobile networks, optimizing which base station a mobile phone in a particular area connects to is crucial for ensuring good communication quality for each mobile phone but presents a challenging combinatorial optimization problem. In this study, we optimize the connection patterns to base stations using quantum annealing which is a heuristic optimization algorithm using quantum fluctuations. However, since the number of qubits on a quantum annealer is limited, it is necessary to consider a formulation that efficiently utilizes qubits. By adopting a variable reduction formulation, we significantly reduce the qubit requirements compared to the naive formulation that is typically used when considering pattern-matching problems. Furthermore, experiments using quantum annealing revealed that the accuracy of the approximate solution obtained by the new formulation is superior to that of the conventional formulation. In addition, we demonstrate that the new formulation provides better solutions than the conventional formulation as the problem size increases, even when using simulated annealing, the classical counterpart of quantum annealing.

Figures

Figures reproduced from arXiv: 2412.19434 by the authors.

Figure 1
Figure 1. Example of a connection pattern between base stations and mobile phones. Orange squares represent base stations, and black circles show mobile phones. The blue line illustrates the connection between each mobile phone and its corresponding base station. There are two constraints for determining the connection pattern. The first constraint is that each mobile phone must 2/10 [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. (b) is the heat map that shows the SINR at each coordinate when two base stations with Gaussian patterns are placed 1 km apart, with mobile phones uniformly distributed every meter. All mobile phones at each position connect to the base station that provides the higher SINR. The half-power beam width is 30 degrees, the maximum gain is 0 dB, and the side lobe level is -15 dB. The figure shows that in the Gaussian pat… view at source ↗
Figure 3
Figure 3. Examples of two mobile phone distribution patterns. The left figure shows a uniform distribution within the area, while the right figure shows a biased distribution towards a specific base station. In this experiment, we use the isotropic and Gaussian beam patterns shown in [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Dependency of the number of qubits required by the two formulations on the number of mobile phones when the number of base stations is fixed at 3. Each line plots the average of 10 instances. The points where the plot is cut off indicate the maximum number of mobile ph…
Figure 5
Figure 5. Figure 5: Comparison of the accuracy of solutions obtained using the two formulations across four test patterns. The horizontal axis in [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: Comparison of the two formulations when solved using SA and QA in Test Pattern 1. relative errors for both formulations. This indicates that SA provides more accurate solutions than QA, which is susceptible to errors due to the physical device. On the other hand, unlik…
Figure 7
Figure 7. Figure 7: Dependence of the relative error of the two formulations in SA on the number of mobile phones. From [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

22 extracted references · 12 canonical work pages

  1. [1]

    Shen, K., Liu, Y .-F., Ding, D. Y . & Yu, W. Flexible multiple base station association and activation for downlink heterogeneous networks. IEEE Signal Process. Lett. 24, 1498–1502, DOI: 10.1109/LSP.2017.2738027 (2017)

    arXiv 2017

  2. [2]

    & Nishimori, H

    Kadowaki, T. & Nishimori, H. Quantum annealing in the transverse ising model. Phys. Rev. E 58, 5355–5363, DOI: 10.1103/PhysRevE.58.5355 (1998)

    doi:10.1103/physreve.58.5355 1998

  3. [3]

    Ising formulations of many np problems

    Lucas, A. Ising formulations of many np problems. Front. physics 2, 5 (2014)

    work page 2014

  4. [4]

    Neukart, F. et al. Traffic flow optimization using a quantum annealer. Front. ICT 4, 29 (2017)

    work page 2017

  5. [5]

    & Yoshida, H

    Inoue, D., Okada, A., Matsumori, T., Aihara, K. & Yoshida, H. Traffic signal optimization on a square lattice with quantum annealing. Sci. reports 11, 1–12 (2021)

    work page 2021

  6. [6]

    Quadratic Unconstrained Binary Formulation for Traffic Signal Optimization on Real-World Maps

    Shikanai, R., Ohzeki, M. & Tanaka, K. Traffic signal optimization using quantum annealing on real map, DOI: 10.48550/ arXiv.2308.14462 (2023). 2308.14462

    work page Pith review arXiv doi:10.48550/arxiv.2308.14462 2023

  7. [7]

    Ohzeki, M., Miki, A., Miyama, M. J. & Terabe, M. Control of automated guided vehicles without collision by quantum annealer and digital devices. Front. Comput. Sci. 1, 9 (2019)

    work page 2019

  8. [8]

    & Tanaka, K

    Haba, R., Ohzeki, M. & Tanaka, K. Travel time optimization on multi-agv routing by reverse annealing. Sci. Reports 12, 17753, DOI: 10.1038/s41598-022-22704-0 (2022). 9/10

    doi:10.1038/s41598-022-22704-0 2022

Show all 22 references
  1. [9]

    Rosenberg, G. et al. Solving the optimal trading trajectory problem using a quantum annealer. IEEE J. Sel. Top. Signal Process. 10, 1053–1060 (2016)

    2016

  2. [10]

    & Kondratyev, A

    Venturelli, D. & Kondratyev, A. Reverse quantum annealing approach to portfolio optimization problems. Quantum Mach. Intell. 1, 17–30 (2019)

    2019

  3. [11]

    Yonaga, K. et al. Quantum Optimization with Lagrangian Decomposition for Multiple-process Scheduling in Steel Manufacturing. ISIJ Int. 62, 1874–1880, DOI: 10.2355/isijinternational.ISIJINT-2022-019 (2022)

    2022 doi

  4. [12]

    H., Andriyash, E., Rolfe, J., Kulchytskyy, B

    Amin, M. H., Andriyash, E., Rolfe, J., Kulchytskyy, B. & Melko, R. Quantum Boltzmann Machine. Phys. Rev. X 8 (2018). 1601.02036

    2018 arXiv

  5. [13]

    V ., Alexandrov, B

    O’Malley, D., Vesselinov, V . V ., Alexandrov, B. S. & Alexandrov, L. B. Nonnegative/binary matrix factorization with a d-wave quantum annealer. PloS one 13, e0206653 (2018)

    2018

  6. [14]

    & Tanaka, K

    Sato, T., Ohzeki, M. & Tanaka, K. Assessment of image generation by quantum annealer. Sci. Reports 11, 13523, DOI: 10.1038/s41598-021-92295-9 (2021)

    2021 doi

  7. [15]

    & Tanaka, K

    Urushibata, M., Ohzeki, M. & Tanaka, K. Comparing the effects of boltzmann machines as associative memory in generative adversarial networks between classical and quantum samplings. J. Phys. Soc. Jpn. 91, 074008, DOI: 10.7566/ JPSJ.91.074008 (2022). https://doi.org/10.7566/JPS...

    2022 doi

  8. [16]

    & Ohzeki, M

    Hasegawa, Y ., Oshiyama, H. & Ohzeki, M. Kernel learning by quantum annealer, DOI: 10.48550/arXiv.2304.10144 (2023). 2304.10144

    2023 doi arXiv

  9. [17]

    & Ohzeki, M

    Goto, T. & Ohzeki, M. Online calibration scheme for training restricted boltzmann machines with quantum annealing, DOI: 10.48550/arXiv.2307.09785 (2023). 2307.09785

    2023 doi arXiv

  10. [18]

    Glover, F., Kochenberger, G., Hennig, R. & Du, Y . Quantum bridge analytics I: a tutorial on formulating and using QUBO models. Annals Oper. Res. 314, 141–183, DOI: 10.1007/s10479-022-04634-2 (2022)

    2022 doi

  11. [19]

    In presentation of Qubits2023

    Ohzeki, M. In presentation of Qubits2023

  12. [20]

    Kirkpatrick, S., Gelatt, C. D. & Vecchi, M. P. Optimization by simulated annealing. Science 220, 671–680, DOI: 10.1126/science.220.4598.671 (1983)

    1983 doi

  13. [21]

    Cai, J., Macready, W. G. & Roy, A. A practical heuristic for finding graph minors, DOI: 10.48550/arXiv.1406.2741 (2014). 1406.2741

    2014 doi arXiv

  14. [22]

    Available in https://github.com/dwavesystems/dwave-neal

    D-Wave Systems. Available in https://github.com/dwavesystems/dwave-neal. Acknowledgments This study was financially supported by programs for bridging the gap between R&D and IDeal society (Society 5.0) and Generating Economic and social value (BRIDGE) and Cross-ministerial St...

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.