arXiv subjects

Zheyu Wu

Publications and source records attributed to Zheyu Wu.

At least 37 records · Page 2Linked to original sources

arXiv2026

Direct Observation of the Spillover of High Magnetic Field-induced SC3 Superconductivity Outside the Spin-Polarized State in UTe2

In our recent study of the high magnetic field phase landscape of UTe$_2$ [Phys. Rev. X 15, 021019 (2025)] we found indirect evidence that the SC3 superconducting phase spills out beyond the first-order phase boundary of the spin-polarized state. This prior study was limited to a maximal field strength of 41.5 T, and mapped the $b-ac$ rotation plane. Here we measure a high quality sample with residual resistivity ratio RRR = 605 under rotations in the $b-c$ plane up to 45 T. This extended field range helps to unambiguously demonstrate the spillover of SC3 outside the polarized paramagnetic state. This is identified by the observation of zero resistance at low temperatures, for magnetic field strengths lower than the metamagnetic transition field resolved at higher temperatures. This observation is consistent with the scenario that electronic pairing of the SC3 phase is mediated by quantum critical fluctuations.

cond-mat.supr-con↗

arXiv2026

An AMP-Based Asymptotic Analysis For Nonlinear One-Bit Precoding

This paper focuses on the asymptotic analysis of a class of nonlinear one-bit precoding schemes under Rayleigh fading channels. The considered scheme employs a convex-relaxation-then-quantization (CRQ) approach to the well-known minimum mean square error (MMSE) model, which includes the classical one-bit precoder SQUID as a special case. To analyze its asymptotic behavior, we develop a novel analytical framework based on approximate message passing (AMP). We show that, the statistical properties of the considered scheme can be asymptotically characterized by a scalar ``signal plus Gaussian noise'' model. Based on this, we further derive a closed-form expression for the symbol error probability (SEP) in the large-system limit, which quantitatively characterizes the impact of both system and model parameters on SEP performance. Simulation results validate our analysis and also demonstrate that performance gains over SQUID can be achieved by appropriately tuning the parameters involved in the considered model.

cs.IT↗

arXiv2026

Microwave Linear Analog Computer (MiLAC)-aided Multiuser MISO: Fundamental Limits and Beamforming Design

As wireless communication systems evolve toward the 6G era, ultra-massive/gigantic MIMO is envisioned as a key enabling technology. Recently, microwave linear analog computer (MiLAC) has emerged as a promising approach to realize beamforming entirely in the analog domain, thereby alleviating the scalability challenges associated with gigantic MIMO. In this paper, we investigate the fundamental beamforming flexibility and design of lossless and reciprocal MiLAC-aided beamforming for MU-MISO systems. We first provide a rigorous characterization of the set of beamforming matrices achievable by MiLAC. Based on this characterization, we prove that MiLAC-aided beamforming does not generally achieve the full flexibility of digital beamforming, while offering greater flexibility than conventional phase-shifter-based analog beamforming. Furthermore, we propose a hybrid digital-MiLAC architecture and show that it achieves digital beamforming flexibility when the number of radio frequency (RF) chains equals the number of data streams, halving that required by conventional hybrid beamforming. We then formulate the MiLAC-aided sum-rate maximization problem for MU-MISO systems. To solve the problem efficiently, we reformulate the MiLAC-related constraints as a convex linear matrix inequality and establish a low-dimensional subspace property that significantly reduces the problem dimension. Leveraging these results, we propose WMMSE-based algorithms for solving the resulting problem. Simulation results demonstrate that MiLAC-aided beamforming achieves performance close to that of digital beamforming in gigantic MIMO systems. Compared with hybrid beamforming, it achieves comparable or superior performance with lower hardware and computational complexity by avoiding symbol-level digital processing and enabling low-resolution digital-to-analog converters (DACs).

eess.SP↗

arXiv2025

Lossy Beyond Diagonal Reconfigurable Intelligent Surfaces: Modeling and Optimization

Beyond diagonal reconfigurable intelligent surface (BD-RIS) has emerged as an advancement and generalization of the conventional diagonal RIS (D-RIS) by introducing tunable interconnections between RIS elements, enabling smarter wave manipulation and enlarged coverage. While BD-RIS has demonstrated advantages over D-RIS in various aspects, most existing works rely on the assumption of a lossless model, leaving practical considerations unaddressed. This paper thus proposes a lossy BD-RIS model and develops corresponding optimization algorithms for various BD-RIS-aided communication systems. First, by leveraging admittance parameter analysis, we model each tunable admittance based on a lumped circuit with losses and derive an expression of a circle characterizing the real and imaginary parts of each tunable admittance. We then consider the received signal power maximization in single-user single-input single-output (SISO) systems with the proposed lossy BD-RIS model. To solve the optimization problem, we design an effective algorithm by carefully exploiting the problem structure. Specifically, an alternating direction method of multipliers (ADMM) framework is custom-designed to deal with the complicated constraints associated with lossy BD-RIS. Furthermore, we extend the proposed algorithmic framework to more general multiuser multiple-input single-output (MU-MISO) systems, where the transmit precoder and BD-RIS scattering matrix are jointly designed to maximize the sum-rate of the system. Finally, simulation results demonstrate that all BD-RIS architectures still outperform D-RIS in the presence of losses, but the optimal BD-RIS architectures in the lossless case are not necessarily optimal in the lossy case, e.g. group-connected BD-RIS can outperform fully- and tree-connected BD-RISs in SISO systems with relatively high losses, whereas the opposite always holds true in the lossless case.

eess.SP↗

arXiv2025

Beyond Diagonal RIS in Multiuser MIMO: Graph Theoretic Modeling and Optimal Architectures with Low Complexity

Reconfigurable intelligent surfaces (RIS) is regarded as a key enabler of wave/analog-domain beamforming, processing, and computing in future wireless communication systems. Recently, Beyond Diagonal RIS (BD-RIS) has been proposed as a generalization of conventional RIS, offering enhanced design flexibility thanks to the presence of tunable impedances that connect RIS elements. However, increased interconnections lead to high circuit complexity, which poses a significant practical challenge. In this paper, we address the fundamental open question: What is the class of BD-RIS architectures that achieves the optimal performance in a RIS-aided multiuser multi-input multi-output (MIMO) system? By modeling BD-RIS architectures using graph theory, we identify a class of BD-RIS architectures that achieves the optimal performance--matching that of fully-connected RIS--while maintaining low circuit complexity. Our result holds for a broad class of performance metrics, including the commonly used sum channel gain/sum-rate/energy efficiency maximization, transmit power minimization, and the information-theoretic capacity region. The number of tunable impedances in the proposed class is ${O}(N\min\{D,N/2\})$, where $N$ denotes the number of RIS elements and $D$ is the degree of freedom of the multiuser MIMO channel, i.e., the minimum between the number of transmit antennas and the total number of received antennas across all users. Since $D$ is much smaller than $N$ in practice, the complexity scales as ${O}(ND)$, which is substantially lower than the ${O}(N^2)$ complexity of fully-connected RIS. We further introduce two novel BD-RIS architectures--band-connected RIS and stem-connected RIS--and show that they belong to the optimal architecture class under certain conditions. Simulation results validate the optimality and enhanced performance-complexity tradeoff of our proposed architectures.

cs.IT↗

arXiv2025

Magnetic signatures of pressure-induced multicomponent superconductivity in UTe$_2$

The phase diagram of the heavy fermion compound UTe$_2$ contains multiple superconducting phases, several of which show characteristics of odd-parity pairing. We have investigated the pressure dependence of the superconducting transition in high-quality crystals of UTe$_2$ by tracking its signature in the magnetic susceptibility $χ(T)$. A single, sharp superconducting transition is observed at low pressures 0.3 GPa. At higher pressure, a second feature emerges in $χ(T)$, which is located at the lower-temperature thermodynamic phase boundary previously identified in specific heat measurements. This second transition anomaly in $χ(T)$ can be attributed to a step change in the London penetration depth, providing direct evidence for a change in the superconducting order parameter of UTe$_2$. Thermodynamic constraints suggest that the low temperature, high pressure superconducting state is distinct from zero pressure superconductivity as well as from the high pressure, high temperature superconducting state, raising the possibility of multicomponent superconductivity in high pressure UTe$_2$.

cond-mat.supr-con↗

arXiv2025

The Fermi surface of RuO2 measured by quantum oscillations

The metallic oxide RuO$_2$ has emerged as a promising altermagnet candidate, owing to reports of this material hosting antiferromagnetic ordering accompanied by a spin-split electronic band structure characteristic of time-reversal symmetry-breaking. However, recent studies have robustly questioned this scenario. Here we map the Fermi surface of pristine single-crystalline RuO$_2$. By measuring magnetic quantum oscillations of a bulk thermodynamic property, our study resolves the electronic structure present in the bulk of RuO$_2$. Several Fermi sheets are discerned, with a range of effective quasiparticle masses up to five times that of the bare electron mass. We compare our measurements with the predictions for altermagnetic and nonmagnetic Fermi surfaces deduced from density functional theory calculations. The quantum oscillatory frequency spectra correspond very poorly to the profile expected for the case of altermagnetism; by contrast, they correspond well to the nonmagnetic scenario. Our findings place significant constraints on the bulk magnetic properties of RuO$_2$, and strongly suggest that this material is a paramagnet.

cond-mat.mtrl-sci↗

arXiv2025

Metamagnetic ripples in the UTe2 high magnetic field phase diagram

The heavy fermion metamagnet uranium ditelluride possesses two distinct magnetic field--induced superconducting states. One of these superconductive phases resides at magnetic fields immediately below a first-order metamagnetic transition to a field--polarized paramagnetic state at a field strength $H_m$, while the other exists predominantly above $H_m$. However, little is known about the microscopic properties of this polarized paramagnetic state. Here we report pulsed magnetic field measurements tracking the evolution of $H_m$ for polar and azimuthal inclinations in the vicinity of the crystallographic $b-a$ plane. We uncover a region of the phase diagram at high fields $>$ 50 T with a ripple-like non-monotonic dependence of $H_m$ on the orientation of field. Within this ripple in the metamagnetic transition surface, $H_m$ exhibits an anomalous temperature dependence. Our results point towards the presence of complex magnetic interactions and possible magnetic sub-phases at high magnetic fields in UTe$_2$, which may have important implications for the manifestation of exotic field-induced superconductivity.

cond-mat.str-el↗

arXiv2024

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing

This paper considers the network slicing (NS) problem which attempts to map multiple customized virtual network requests to a common shared network infrastructure and allocate network resources to meet diverse service requirements. This paper proposes an efficient customized Benders decomposition algorithm for globally solving the large-scale NP-hard NS problem. The proposed algorithm decomposes the hard NS problem into two relatively easy function placement (FP) and traffic routing (TR) subproblems and iteratively solves them enabling the information feedback between each other, which makes it particularly suitable to solve large-scale problems. Specifically, the FP subproblem is to place service functions into cloud nodes in the network, and solving it can return a function placement strategy based on which the TR subproblem is defined; and the TR subproblem is to find paths connecting two nodes hosting two adjacent functions in the network, and solving it can either verify that the solution of the FP subproblem is an optimal solution of the original problem, or return a valid inequality to the FP subproblem that cuts off the current infeasible solution. The proposed algorithm is guaranteed to find the globally optimal solution of the NS problem. By taking the special structure of the NS problem into consideration, we successfully develop two families of valid inequalities that render the proposed algorithm converge much more quickly and thus much more efficient. Numerical results demonstrate that the proposed valid inequalities effectively accelerate the convergence of the decomposition algorithm, and the proposed algorithm significantly outperforms the existing algorithms in terms of both solution efficiency and quality.

cs.IT↗

arXiv2024

An Efficient Convex-Hull Relaxation Based Algorithm for Multi-User Discrete Passive Beamforming

Intelligent reflecting surface (IRS) is an emerging technology to enhance spatial multiplexing in wireless networks. This letter considers the discrete passive beamforming design for IRS in order to maximize the minimum signal-to-interference-plus-noise ratio (SINR) among multiple users in an IRS-assisted downlink network. The main design difficulty lies in the discrete phase-shift constraint. Differing from most existing works, this letter advocates a convex-hull relaxation of the discrete constraints which leads to a continuous reformulated problem equivalent to the original discrete problem. This letter further proposes an efficient alternating projection/proximal gradient descent and ascent algorithm for solving the reformulated problem. Simulation results show that the proposed algorithm outperforms the state-of-the-art methods significantly.

cs.IT↗

arXiv2024

A Survey of Recent Advances in Optimization Methods for Wireless Communications

Mathematical optimization is now widely regarded as an indispensable modeling and solution tool for the design of wireless communications systems. While optimization has played a significant role in the revolutionary progress in wireless communication and networking technologies from 1G to 5G and onto the future 6G, the innovations in wireless technologies have also substantially transformed the nature of the underlying mathematical optimization problems upon which the system designs are based and have sparked significant innovations in the development of methodologies to understand, to analyze, and to solve those problems. In this paper, we provide a comprehensive survey of recent advances in mathematical optimization theory and algorithms for wireless communication system design. We begin by illustrating common features of mathematical optimization problems arising in wireless communication system design. We discuss various scenarios and use cases and their associated mathematical structures from an optimization perspective. We then provide an overview of recently developed optimization techniques in areas ranging from nonconvex optimization, global optimization, and integer programming, to distributed optimization and learning-based optimization. The key to successful solution of mathematical optimization problems is in carefully choosing or developing suitable algorithms (or neural network architectures) that can exploit the underlying problem structure. We conclude the paper by identifying several open research challenges and outlining future research directions.

cs.IT↗

arXiv2024

Supervised Training of Neural-Network Quantum States for the Next Nearest Neighbor Ising model

Different neural network architectures can be unsupervisedly or supervisedly trained to represent quantum states. We explore and compare different strategies for the supervised training of feed forward neural network quantum states. We empirically and comparatively evaluate the performance of feed forward neural network quantum states in different phases of matter for variants of the architecture, for different hyper-parameters, and for two different loss functions, to which we refer as \emph{mean-squared error} and \emph{overlap}, respectively. We consider the next-nearest neighbor Ising model for the diversity of its phases and focus on its paramagnetic, ferromagnetic, and pair-antiferromagnetic phases. We observe that the overlap loss function allows better training of the model across all phases, provided a rescaling of the neural network.

cond-mat.stat-mech↗

arXiv2024

Quantized Constant-Envelope Waveform Design for Massive MIMO DFRC Systems

Both dual-functional radar-communication (DFRC) and massive multiple-input multiple-output (MIMO) have been recognized as enabling technologies for 6G wireless networks. This paper considers the advanced waveform design for hardware-efficient massive MIMO DFRC systems. Specifically, the transmit waveform is imposed with the quantized constant-envelope (QCE) constraint, which facilitates the employment of low-resolution digital-to-analog converters (DACs) and power-efficient amplifiers. The waveform design problem is formulated as the minimization of the mean square error (MSE) between the designed and desired beampatterns subject to the constructive interference (CI)-based communication quality of service (QoS) constraints and the QCE constraint. To solve the formulated problem, we first utilize the penalty technique to transform the discrete problem into an equivalent continuous penalty model. Then, we propose an inexact augmented Lagrangian method (ALM) algorithm for solving the penalty model. In particular, the ALM subproblem at each iteration is solved by a custom-built block successive upper-bound minimization (BSUM) algorithm, which admits closed-form updates, making the proposed inexact ALM algorithm computationally efficient. Simulation results demonstrate the superiority of the proposed approach over existing state-of-the-art ones. In addition, extensive simulations are conducted to examine the impact of various system parameters on the trade-off between communication and radar performances.

cs.IT↗

arXiv2023

Efficient CI-Based One-Bit Precoding for Multiuser Downlink Massive MIMO Systems with PSK Modulation

In this paper, we consider the one-bit precoding problem for the multiuser downlink massive multiple-input multiple-output (MIMO) system with phase shift keying (PSK) modulation. We focus on the celebrated constructive interference (CI)-based problem formulation. We first establish the NP-hardness of the problem (even in the single-user case), which reveals the intrinsic difficulty of globally solving the problem. Then, we propose a novel negative $\ell_1$ penalty model for the considered problem, which penalizes the one-bit constraint into the objective by a negative $\ell_1$-norm term, and show the equivalence between (global and local) solutions of the original problem and the penalty problem when the penalty parameter is sufficiently large. We further transform the penalty model into an equivalent min-max problem and propose an efficient alternating proximal/projection gradient descent ascent (APGDA) algorithm for solving it, which performs a proximal gradient decent over one block of variables and a projection gradient ascent over the other block of variables alternately. The APGDA algorithm enjoys a low per-iteration complexity and is guaranteed to converge to a stationary point of the min-max problem and a local minimizer of the penalty problem. To further reduce the computational cost, we also propose a low-complexity implementation of the APGDA algorithm, where the values of the variables will be fixed in later iterations once they satisfy the one-bit constraint. Numerical results show that, compared to the state-of-the-art CI-based algorithms, both of the proposed algorithms generally achieve better bit-error-rate (BER) performance with lower computational cost.

cs.IT↗

arXiv2023

Asymptotic SEP Analysis and Optimization of Linear-Quantized Precoding in Massive MIMO Systems

A promising approach to deal with the high hardware cost and energy consumption of massive MIMO transmitters is to use low-resolution digital-to-analog converters (DACs) at each antenna element. This leads to a transmission scheme where the transmitted signals are restricted to a finite set of voltage levels. This paper is concerned with the analysis and optimization of a low-cost quantized precoding strategy, referred to as linear-quantized precoding, for a downlink massive MIMO system under Rayleigh fading. In linear-quantized precoding, the signals are first processed by a linear precoding matrix and subsequently quantized component-wise by the DAC. In this paper, we analyze both the signal-to-interference-plus-noise ratio (SINR) and the symbol error probability (SEP) performances of such linear-quantized precoding schemes in an asymptotic framework where the number of transmit antennas and the number of users grow large with a fixed ratio. Our results provide a rigorous justification for the heuristic arguments based on the Bussgang decomposition that are commonly used in prior works. Based on the asymptotic analysis, we further derive the optimal precoder within a class of linear-quantized precoders that includes several popular precoders as special cases. Our numerical results demonstrate the excellent accuracy of the asymptotic analysis for finite systems and the optimality of the derived precoder.

cs.IT↗

arXiv2023

Robust Super-Resolution Imaging Based on a Ring Core Fiber with Orbital Angular Momentum

Single fiber imaging technology offers unique insights for research and inspection in difficult to reach and narrow spaces. In particular, ultra-compact multimode fiber (MMF) imaging, has received increasing interest over the past decade. However, MMF imaging will be seriously distorted when subjected to dynamic perturbations due to time-varying mode coupling, and the imaging of space objects via Gaussian beam will be relatively degraded at the edge due to insufficient contrast. Here, a robust super-resolution imaging method based on a ring core fiber (RCF) with orbital angular momentum (OAM) has been proposed and experimentally demonstrated. The OAM modes propagating in the RCF form a series of weakly-coupled mode groups, making our imaging system robust to external perturbations. In addition, a spiral phase plate is used as a vortex filter to produce OAM for edge enhancement, thus improving the image resolution. Furthermore, a few-shot U-Transformer neural network is proposed to enhance the resilience of the developed RCF-OAM imaging system against environmental perturbations. Finally, the developed RCF-OAM imaging system achieves biological image transmission, demonstrating the practicality of our scheme. This pioneering RCF OAM imaging system may have broad applications, potentially revolutionising fields such as biological imaging and industrial non-destructive testing.

physics.optics↗

arXiv2023

Linear One-Bit Precoding in Massive MIMO: Asymptotic SEP Analysis and Optimization

This paper focuses on the analysis and optimization of a class of linear one-bit precoding schemes for a downlink massive MIMO system under Rayleigh fading channels. The considered class of linear one-bit precoding is fairly general, including the well-known matched filter (MF) and zero-forcing (ZF) precoding schemes as special cases. Our analysis is based on an asymptotic framework where the numbers of transmit antennas and users in the system grow to infinity with a fixed ratio. We show that, under the asymptotic assumption, the symbol error probability (SEP) of the considered linear one-bit precoding schemes converges to that of a scalar ``signal plus independent Gaussian noise'' model. This result enables us to provide accurate predictions for the SEP of linear one-bit precoding. Additionally, we also derive the optimal linear one-bit precoding scheme within the considered class based on our analytical results. Simulation results demonstrate the excellent accuracy of the SEP prediction and the optimality of the derived precoder.

cs.IT↗

arXiv2023

Efficient Quantized Constant Envelope Precoding for Multiuser Downlink Massive MIMO Systems

Quantized constant envelope (QCE) precoding, a new transmission scheme that only discrete QCE transmit signals are allowed at each antenna, has gained growing research interests due to its ability of reducing the hardware cost and the energy consumption of massive multiple-input multiple-output (MIMO) systems. However, the discrete nature of QCE transmit signals greatly complicates the precoding design. In this paper, we consider the QCE precoding problem for a massive MIMO system with phase shift keying (PSK) modulation and develop an efficient approach for solving the constructive interference (CI) based problem formulation. Our approach is based on a custom-designed (continuous) penalty model that is equivalent to the original discrete problem. Specifically, the penalty model relaxes the discrete QCE constraint and penalizes it in the objective with a negative $\ell_2$-norm term, which leads to a non-smooth non-convex optimization problem. To tackle it, we resort to our recently proposed alternating optimization (AO) algorithm. We show that the AO algorithm admits closed-form updates at each iteration when applied to our problem and thus can be efficiently implemented. Simulation results demonstrate the superiority of the proposed approach over the existing algorithms.

cs.IT↗