arXiv subjects

Symeon Chatzinotas

Publications and source records attributed to Symeon Chatzinotas.

At least 37 records · Page 2Linked to original sources

arXiv2026

Exploiting Movable-Element STARS for Rate Splitting Multiple Access

This paper investigates a movable-element simultaneously transmitting and reflecting reconfigurable intelligent surface (ME-STARS) assisted rate-splitting multiple access (RSMA) system under imperfect channel state information (CSI). Unlike conventional STARS with fixed element positions, the elements of ME-STARS can be repositioned within a predefined region, providing additional spatial degrees of freedom for improving the cascaded transmitter--STARS--user channels. To exploit this flexibility while accounting for CSI uncertainty, we formulate a robust sum-rate maximization problem that jointly optimizes the transmit beamforming, common-rate allocation, reflection and transmission coefficients, and ME-STARS element positions, subject to transmit-power, user-rate, minimum inter-element spacing, and movement-region constraints. The resulting problem is highly non-convex due to the strong coupling among the design variables and the position-dependent channels. To address this challenge, an iterative optimization framework is developed in which the transmit beamforming, STARS coefficients, and element positions are successively optimized through tractable convex reformulations. In particular, the element positions are updated sequentially using a majorization--minimization (MM) framework, where quadratic surrogate functions are constructed from the first- and second-order derivatives of the position-dependent channels while preserving the minimum inter-element spacing constraint. Simulation results demonstrate that the proposed ME-STARS design consistently outperforms the considered benchmark schemes. Moreover, the performance gains remain significant under increasing CSI uncertainty, highlighting the effectiveness of element repositioning for robust RSMA transmission.

eess.SP↗

arXiv2026

QuMIMO Diversity over Discrete-Variable Free-Space Optical Channels

Free-space optical (FSO) links carry quantum states without fiber, but diffraction, pointing error, and atmospheric turbulence couple spatial modes and reduce end-to-end fidelity. Classical multiple-input multiple-output (MIMO) uses spatial channels for multiplexing or diversity. For unknown quantum states, however, the no-cloning theorem prevents classical replication. We therefore formulate an FSO quantum multiple-input multiple-output (QuMIMO) link for an unknown polarization qubit as a single completely positive and trace-preserving (CPTP) map. It combines passive field transfer, bosonic pure loss lifted to Fock space, a receiver map to erasure-augmented polarization qubits, and effective per-port polarization noise. The plane-wave Rytov variance parameterizes turbulence, while an internal-state Gram matrix captures partial photon distinguishability and its effects on path coherence and multiphoton interference. Using Haar-averaged state fidelity, we compare direct transmission, fixed quantum error correction (QEC), approximate quantum cloning, coherent path superposition, and channel-adapted encoder and recovery maps, while distinguishing channel state information (CSI) from endpoint availability. With Full CSI on the two-rail channel, asymmetric cloning and coherent path superposition exceed the fixed single-input single-output (SISO) baseline in average fidelity. Adding rails and their admitted photon-number sectors enlarges the attained general-CPTP gain over the fixed SISO baseline, with the widest margin at moderate turbulence. Fixed stabilizer encoders perform poorly as turbulence makes rail survival unequal and produces errors unlike erasures at known code positions. Thus, QuMIMO realizes channel-adapted spatial diversity without requiring multiple copies of the logical qubit.

quant-ph↗

arXiv2026

Energy Efficient Multi-User Beamforming and 3D Position Optimization for SIM-Assisted UAVs

This paper studies energy-efficient downlink multi-user transmissions with unmanned aerial vehicle (UAV) communication systems equipped with stacked intelligent metasurfaces (SIM), enabling wave-domain analog beamforming through multiple cascaded metasurface layers, while low-dimensional digital precoding is carried out using a limited number of transmit radio-frequency chains. This architecture enables flexible electromagnetic wave manipulation with reduced hardware complexity, making it particularly suitable for energy-constrained aerial platforms. We formulate a hardware-aware energy-efficiency (EE) maximization problem aiming to jointly optimize the digital precoder, the phase shifts of all SIM layers, and the three-dimensional UAV position under transmit-power, SIM operation, and UAV deployment constraints. The resulting problem is highly non-convex due to the fractional objective, the cascaded SIM structure and the unit-modulus phase constraints of the constituent metasurface layers, as well as the non-linear UAV-dependent channel. To address these challenges, we develop a transform-based alternating optimization framework that combines Dinkelbach's method, dual and quadratic transforms, to enable closed-form digital beamforming, Riemannian manifold optimization for SIM phase shifts, and successive convex approximation (SCA) for UAV positioning. Convergence and complexity analyses are provided to characterize the proposed algorithm. The presented numerical results showcase that the proposed joint design significantly improves EE compared with fully digital and maximum ratio transmission benchmark schemes, while revealing important design trade-offs among transmit power, SIM size, and the number of its constituent stacked layers.

eess.SP↗

arXiv2026

Extremely Large Beyond-Diagonal RIS: Low-Rank Modal Optimization for Near-Field Communications

Beyond-diagonal reconfigurable intelligent surfaces (BD-RIS) achieve their best performance when fully connected, at the price of an optimization and hardware burden that grows quadratically, and per iteration cubically, with the number of elements. Extremely large surfaces make this burden prohibitive, while their sheer aperture places both the base station and the users in the radiative near field, where far-field design tools break down. This paper introduces the extremely large BD-RIS (XL-BD-RIS) concept and shows that near-field geometry is precisely what makes fully connected performance affordable at scale. Modeling the cascade with the free-space Green function, we prove that the aperture fields live in a low-dimensional subspace spanned by the spherical-wave responses of the terminal positions, and we design a compact unitary modal matrix on this subspace, built from localization information alone, that provably attains the fully connected optimum with a number of reconfigurable entries set by the geometry and independent of the panel size. A weighted-MMSE Riemannian algorithm optimizes the beamformers and the modal matrix with monotone convergence at panel-size-independent cost. Numerical results show that a $24\times24$-element panel reaches the fully connected optimum with about two hundred entries instead of three hundred thousand. A mismatched DFT beamspace pays a sixty-fold entry penalty rooted in the beam spread of spherical wavefronts, while the classical block-wise architecture delivers strictly lower rates at any matched entry budget.

eess.SP↗

arXiv2026

Matrix Completion via Nonsmooth Regularization of Fully Connected Neural Networks

Conventional matrix completion methods approximate the missing values by assuming the matrix to be low-rank, which leads to a linear approximation of missing values. It has been shown that enhanced performance could be attained by using nonlinear estimators such as deep neural networks. Deep fully connected neural networks (FCNNs), one of the most suitable architectures for matrix completion, suffer from over-fitting due to their high capacity, which leads to low generalizability. In this paper, we control over-fitting by regularizing the FCNN model in terms of the $\ell_{1}$ norm of intermediate representations and nuclear norm of weight matrices. As such, the resulting regularized objective function becomes nonsmooth and nonconvex, i.e., existing gradient-based methods cannot be applied to our model. We propose a variant of the proximal gradient method and investigate its convergence to a critical point. In the initial epochs of FCNN training, the regularization terms are ignored, and through epochs, the effect of that increases. The gradual addition of nonsmooth regularization terms is the main reason for the better performance of the deep neural network with nonsmooth regularization terms (DNN-NSR) algorithm. Our simulations indicate the superiority of the proposed algorithm in comparison with existing linear and nonlinear algorithms.

cs.IT↗

arXiv2026

Wavenumber-Domain Virtual Arrays for Holographic Near-Field Localization

Monostatic localization of multiple point targets is studied for a holographic aperture operated through wavenumber-domain modes. A specular-point condition delimits the validity of the spectral model as a near-field approximation. A single snapshot observes a projection of dimension at most the target count times the polarization components, while invertible coding recovers the full channel and places the decoded data on the difference lattice of transmit and receive wavenumbers. Rank conditions settle identifiability, and the Fisher matrix reduces to a covariance over the lattice, dictating a nested mode selection that attains full-aperture resolution with only tens of RF chains.

eess.SP↗

arXiv2026

Quantum Decision Theory for Displacement Detection with Finite-Energy GKP States

We develop a quantum-decision-theoretic framework for detecting phase-space displacements with finite-energy, $d$-level Gottesman-Kitaev-Preskill (GKP) probes. For single-mode and entanglement-assisted architectures, we derive the Bayesian minimum-error probability, the optimal Neyman-Pearson receiver-operating characteristic, and the corresponding minimum detectable displacement. Finite-energy effects are treated through exact theta-series displacement kernels, while pure loss followed by quantum-limited amplification is mapped to an effective Gaussian random-displacement channel. Entanglement removes preparation-dependent blind directions and preserves both logical displacement labels, although it does not surpass the pointwise optimized single-mode strategy in the noiseless pure-state setting. We benchmark the resulting protocols against coherent-state, direction-matched squeezed-vacuum, and twin-beam schemes at equal nominal squeezing. Numerical results identify finite-squeezing and lossy regimes in which GKP probes achieve both a lower Bayesian error and a smaller minimum detectable perturbation than the selected Gaussian receivers.

quant-ph↗

arXiv2026

GAPSL: A Gradient-Aligned Parallel Split Learning over Data-Heterogeneous Edge Computing Systems

The increasing complexity of neural networks poses significant challenges for democratizing federated learning (FL) on resource-constrained edge devices. Parallel split learning (PSL) has emerged as a promising solution by offloading substantial computing workload to a server via model partitioning, shrinking client-side computing load, and eliminating the client-side model aggregation for reduced communication and deployment costs. However, the highly heterogeneous nature of client data in edge computing systems causes aggregation-free PSL to suffer from severe training divergence, stemming from gradient directional inconsistency across clients. To address this challenge, we propose GAPSL, a gradient-aligned PSL framework tailored for data-heterogeneous edge systems, which comprises two key components: leader gradient identification (LGI) and gradient direction alignment (GDA). LGI dynamically selects a set of directionally consistent device gradients to construct a leader gradient as a robust proxy for the global convergence trend. GDA employs a direction-aware regularization to align each client's gradient with the leader gradient, thereby mitigating inter-device gradient directional inconsistency and enhancing model convergence. We evaluate GAPSL on a prototype computing testbed. Extensive experiments demonstrate that GAPSL consistently outperforms state-of-the-art benchmarks in training accuracy, convergence latency, and system robustness under severe data heterogeneity.

cs.LG↗

arXiv2026

Measurement-Based Loss Tolerance in Graph-GKP Codes through Syndrome-Resolved Pauli-Frame Decoding

Graph codes offer multiple physical representatives of logical observables, while Gottesman-Kitaev-Preskill (GKP) codes retain analog information about bosonic displacement noise. We develop a causal framework that unifies these mechanisms for measurement-based loss tolerance under pure loss followed by quantum-limited amplification. In this framework, each local GKP recovery produces a refreshed logical block, a continuous syndrome record, and a confidence score for the inferred Pauli class. Low-confidence outcomes are deliberately converted into located erasures, so the availability pattern is generated directly from the bosonic data rather than sampled independently. Both accepted and rejected syndromes contribute to a syndrome-resolved posterior over the graph branch, which determines accessible logical representatives and the outgoing logical Pauli frame. We derive decoder-conditioned branch restriction, signed-outcome reconstruction, Pauli-frame updating, recursive concatenation of graph-GKP modules, and syndrome-resolved logical fusion. Numerical simulations across several squeezing levels identify task-dependent loss-tolerance behavior and finite-depth pseudothresholds for square and hexagonal GKP lattices. The resulting graph-GKP interface provides a unified causal control layer for fault-tolerant MBQC, fusion-based computation, and all-photonic repeaters.

quant-ph↗

arXiv2026

Onboard Satellite Image Classification for Earth Observation: A Comparative Study of ViT Models

Remote sensing (RS) image classification is central to Earth observation, but onboard deployment requires models that are accurate, efficient, and robust to sensor and transmission degradation. Following a train-on-ground, infer-onboard workflow, we evaluate 14 backbones, including CNNs, ResNets, compact Transformers trained from scratch, and pre-trained Vision Transformers, on EuroSAT and PatternNet. We assess clean-data performance, computational cost, power consumption, and robustness to Gaussian noise, motion blur, and an end-to-end DVB-S2(X) transmission chain with channel impairments and JPEG compression. Pre-trained Vision Transformers generally outperform models trained from scratch while providing better efficiency and corruption resilience. MobileViTV2 achieves the highest clean EuroSAT accuracy at 99.09%, whereas EfficientViT-M2 provides the strongest overall trade-off. It attains 98.76% accuracy, precision, and recall on EuroSAT and 99.52% accuracy on PatternNet, with 203.53 MFLOPs, a 38.19 MB footprint, and the best overall robustness score of 0.79. It also degrades most gracefully under transmission loss and consumes 63.35% less power than MobileViTV2 and 73.33% less than Swin Transformer. These results identify EfficientViT-M2 as a strong backbone for reliable, energy-efficient onboard RS image classification. Code for data augmentation, corruption generation, training, and inference is publicly available.

cs.CV↗

arXiv2026

Stacked Intelligent Metasurfaces Assisted UAV Communications

In this paper, we investigate an unmanned aerial vehicle (UAV) communication system assisted by stacked intelligent metasurfaces (SIMs), which enable programmable wave-domain signal processing through multiple cascaded metasurface layers. By shifting part of the beamforming functionality from the RF/digital domain to the electromagnetic domain, SIMs allow the realization of energy-efficient hybrid beamforming architectures suitable for aerial platforms. We formulate the joint design of digital precoding, SIM phase configuration, and UAV positioning for multi-user downlink sum-rate maximization. To solve the resulting non-convex problem, we develop an alternating optimization framework that guarantees monotonic improvement of the objective. Numerical results demonstrate that the proposed SIM-assisted architecture significantly improves spectral efficiency while maintaining low hardware complexity, and highlight the impact of the number of metasurface layers and size of each layer on system performance.

eess.SP↗

arXiv2026

GLUSE: Enhanced Channel-Wise Adaptive Gated Linear Units SE for Onboard Satellite Earth Observation Image Classification

This study introduces ResNet-GLUSE, a lightweight ResNet variant enhanced with Gated Linear Unit-enhanced Squeeze-and-Excitation (GLUSE), an adaptive channel-wise attention mechanism. By integrating dynamic gating into the traditional SE framework, GLUSE improves feature recalibration while maintaining computational efficiency. Experiments on EuroSAT and PatternNet datasets confirm its effectiveness, achieving exceeding \textbf{94\% and 98\% accuracy}, respectively. While \textbf{MobileViT achieves 99\% accuracy}, ResNet-GLUSE offers \textbf{33x fewer parameters, 27x fewer FLOPs, 33x smaller model size (MB), $\approx$6x lower power consumption (W), and $\approx$3x faster inference time (s)}, making it significantly more efficient for onboard satellite deployment. Furthermore, due to its simplicity, ResNet-GLUSE can be easily mimicked for \textbf{neuromorphic computing}, enabling ultra-low power inference at just \textbf{852.30 mW} on Akida Brainchip. This balance between high accuracy and ultra-low resource consumption establishes ResNet-GLUSE as a practical solution for real-time Earth Observation (EO) tasks. Reproducible codes are available in our shared repository.

eess.IV↗

arXiv2026

Quantum Reservoir Computing: Recent Advances and Future Directions

Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout. This separation reduces reliance on repeated quantum parameter updates and avoids the barren plateaus associated with variational circuit training. Its computational power is often attributed to the exponentially large Hilbert space of the quantum system. However, the memory, nonlinearity, and expressivity that determine what a reservoir can actually compute depend jointly on the input encoding, quantum evolution, observables, measurement, and readout, not on Hilbert space dimension alone. On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables, so a large state space alone does not guarantee useful computation. In this survey, we develop a common system model that connects these components and use it to organize QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations. We examine spin, photonic, superconducting, bosonic, neutral atom, and other analog platforms, together with applications, software and high performance computing support, benchmarking, and reproducibility. The analysis distinguishes hardware demonstrations from simulations and identifies the assumptions and resources that govern comparisons across implementations. Current results do not establish a broad quantum advantage over well matched classical reservoirs. We therefore specify the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.

quant-ph↗

arXiv2026

Digital-Twin-Aided Dynamic Spectrum Sharing and Resource Management in Integrated Satellite-Terrestrial Networks

The explosive growth in wireless service demand has prompted the evolution of integrated satellite-terrestrial networks (ISTNs) to overcome the limitations of traditional terrestrial networks (TNs) in terms of coverage, spectrum efficiency, and deployment cost. Particularly, leveraging LEO satellites and dynamic spectrum sharing (DSS), ISTNs offer promising solutions but face significant challenges due to diverse terrestrial environments, user and satellite mobility, and long propagation LEO-to-ground distance. To address these challenges, digitial-twin (DT) has emerged as a promising technology to offer virtual replicas of real-world systems, facilitating prediction for resource management. In this work, we study a time-window-based DT-aided DSS framework for ISTNs, enabling joint long-term and short-term resource decisions to reduce system congestion. Based on that, two optimization problems are formulated, which aim to optimize resource management using DT information and to refine obtained solutions with actual real-time information, respectively. To efficiently solve these problems, we proposed algorithms using compressed-sensing-based and successive convex approximation techniques. Simulation results using actual traffic data and the London 3D map demonstrate the superiority in terms of congestion minimization of our proposed algorithms compared to benchmarks. Additionally, it shows the adaptation ability and practical feasibility of our proposed solutions.

eess.SP↗

arXiv2026

Seeing Through WiFi: Lightweight Human Pose Estimation with Dynamic Kernel Attention

WiFi-based human pose estimation (HPE) enables the detection and interpretation of human body positions and movements without the need for wearable devices while preserving individual privacy concerns. Implementing this solution requires enhancing model performance and maintaining efficiency, especially on resource-constrained devices. This paper introduces a novel framework, WiLHPE, for lightweight and efficient human pose estimation using WiFi CSI signals. Empowered by a camera-based model during training, WiLHPE processes raw WiFi signals directly to estimate human poses in the testing phase. It employs a novel neural network architecture to dynamically learn convolutional kernels and apply attention mechanisms across channel and frequency spaces. This innovative method diversifies the kernels to improve the recognition capabilities of WiFi signals without adding complexity, ensuring efficiency. Additionally, the Tree-Structured Parzen Estimator algorithm is employed to optimize the critical hyperparameters of the neural network efficiently, minimizing the time required for optimal hyperparameter search compared to heuristic methods. Results from experiments on both the MM-Fi and WiPose datasets highlight the superiority of WiLHPE over state-of-the-art approaches, achieving 85.96% and 94.27% at PCK50, respectively, with minimal computational overhead. Notably, WiLHPE performs impressively even under challenging conditions, maintaining around 80% at PCK50 under AWGN noise with an error variance of 0.5.

cs.CV↗

arXiv2026

Robust Transmission Design for RIS-Assisted RSMA-SWIPT Systems With Movable Antennas Under Hardware Distortions

This paper investigates a robust transmission design for a multi-user rate-splitting multiple access (RSMA)-based simultaneous wireless information and power transfer (SWIPT) system empowered by movable antennas (MAs) and a reconfigurable intelligent surface (RIS) under channel state information (CSI) uncertainty and residual hardware impairments (HIs). The effective channels in MAs-enabled systems depend on antenna positions, causing CSI uncertainty to affect not only active and passive beamforming but also antenna position optimization. Furthermore, residual HIs distort the effective SINRs, creating additional coupling among beamforming, RIS reflection control, common-rate allocation, power-splitting ratio optimization, and antenna position optimization. Consequently, the joint impact of CSI uncertainty and HIs leads to a highly coupled and challenging resource allocation problem. To address this challenge, we propose a robust resource allocation framework that jointly optimizes common-rate allocation, transmit beamforming, RIS reflection coefficients, power-splitting ratios, and MAs positions to maximize the achievable sum-rate while satisfying practical system constraints. To obtain an efficient solution, the original problem is decomposed into active beamforming, RIS reflection design, power-splitting ratio optimization, and MAs position optimization subproblems, where tractable convex surrogate functions are constructed to handle the non-convex objective and constraints. Simulation results verify the effectiveness of the proposed framework and demonstrate substantial improvements in achievable sum-rate, robustness against CSI uncertainty and hardware impairments, and convergence performance compared with benchmark schemes.

eess.SP↗

arXiv2026

Multi-Timescale Latent-Action DRL for Joint Optimization in Edge-Cloud Networks

Load imbalance across edge and cloud layers degrades latency performance in hierarchical edge-cloud computing (HECC) systems under dynamic task arrivals and heterogeneous resources, leading to severe queuing delays and inefficient resource utilization. To address this challenge, we study a joint service placement, computational delegation, and power control (JSCP) problem to minimize the average end-to-end (e2e) latency. The resulting JSCP problem is a mixed-integer nonconvex and NP-hard optimization problem due to the strong coupling between discrete and continuous variables. To enable tractable optimization and stable system adaptation, we exploit the inherent difference in decision dynamics and decompose the problem into long-term system configuration and short-term resource allocation subproblems. Based on this formulation, we propose a two-timescale multi-layer deep reinforcement learning framework with a latent action space (2T-MDRL-LA) to jointly optimize service placement, user association, computational delegation, task offloading, and user transmit power. A latent action representation based on a variational autoencoder is introduced to efficiently compress the high-dimensional combinatorial action space. Simulation results demonstrate that the proposed framework effectively adapts to dynamic network conditions and achieves near-optimal performance compared to branch-and-bound solutions. It achieves up to a 20.8% reduction in average e2e latency and a 13% improvement in resource utilization over the scheme without the computational delegation, while converging approximately 50% faster than conventional proximal policy optimization.

cs.LG↗

arXiv2026

Quantum Key Distribution Without Shared Reference Frame Under Unital Noise

We consider a general and practical scenario of quantum key distribution (QKD) over an unknown, stationary, unital qubit channel. Furthermore, due to practical limitations, e.g., relative movement and rotation of communicating parties, a global shared reference frame cannot be established. This scenario can routinely appear in satellite QKD. We propose two methods to overcome the physical qubit noise and the lack of shared reference frame. The first proposed approach involves constructing the Pauli transfer matrix (PTM) description of the channel, which we achieve without requiring a shared reference frame, by absorbing the lack of shared reference frame in the channel definition. This is followed by the identification of singular vectors of PTM as the Bloch vectors for optimal signal states. In the optimized local bases, the resulting correlations are equivalent, up to outcome relabeling, to those of a Pauli channel, allowing us to show the optimality of the BB84 and six-state QKD protocols under these conditions. The second approach, called the sequential basis matching (SBM) involves sequentially identifying the channel-optimized local bases that enable QKD. We show that both of these approaches result in the same effective key exchange rate for QKD.

quant-ph↗