arXiv subjects

Zhendong Li

Publications and source records attributed to Zhendong Li.

At least 55 records · Page 3Linked to original sources

arXiv2025

Movable Antenna Assisted Flexible Beamforming for Integrated Sensing and Communication in Vehicular Networks

Integrated sensing and communication (ISAC) has been recognized as a key technology in sixth-generation wireless networks, and the additional spatial degrees of freedom obtained by movable antenna (MA) technology can significantly improve the performance of ISAC systems. This paper considers an ISAC-assisted vehicle-to-infrastructure (V2I) network, where extended kalman filter-based prediction is combined with real-time optimization to jointly optimize transmit antenna positions and beamforming and power allocation vectors in dynamic environments. We propose two algorithms: a preprocessing-schur complement-projected gradient ascent algorithm for scenarios without sensing quality of service (QoS) constraints, which explores the potential range of sensing performance to provide reference and warm-starting for subsequent constrained optimization; and a heuristic reflective projected dynamic particle swarm optimization algorithm for sensing QoS-constrained scenarios, which achieves substantial performance gains under non-convex constraints with a small number of iterations. Simulation results demonstrate that these approaches enhance both the communication sum-rate and the lower of the Cramér-Rao lower bound of motion parameter estimation, validating the effectiveness of MA-assisted beamforming in dynamic V2I ISAC networks.

eess.SP↗

arXiv2025

Beamforming for Transmissive RIS Transceiver Enabled Simultaneous Wireless Information and Power Transfer Systems

This paper investigates a novel transmissive reconfigurable intelligent surface (TRIS) transceiver-empowered simultaneous wireless information and power transfer (SWIPT) system with multiple information decoding (ID) and energy harvesting (EH) users. Under the considered system model, we formulate an optimization problem that maximizes the sum-rate of all ID users via the design of the TRIS transceiver's active beamforming. The design is constrained by per-antenna power limits at the TRIS transceiver and by the minimum harvested energy demand of all EH users. Due to the non-convexity of the objective function and the energy harvesting constraint, the sum-rate problem is difficult to tackle. To solve this challenging optimization problem, by leveraging the weighted minimum mean squared error (WMMSE) framework and the majorization-minimization (MM) method, we propose a second-order cone programming (SOCP)-based algorithm. Per-element power constraints introduce a large number of constraints, making the problem considerably more difficult. By applying the alternating direction method of multipliers (ADMM) method, we successfully develop an analytical, computationally efficient, and highly parallelizable algorithm to address this challenge. Numerical results are provided to validate the convergence and effectiveness of the proposed algorithms. Furthermore, the low-complexity algorithm significantly reduces computational complexity without performance degradation.

eess.SP↗

arXiv2025

Fair Rate Maximization for Multi-User Multi-Cell MISO Communication Systems via Novel Transmissive RIS Transceiver

This paper explores a multi-cell multiple-input single-output (MISO) downlink communication system enabled by a unique transmissive reconfigurable intelligent surface (TRIS) transceiver configuration. Within this system framework, we formulate an optimization problem for the purpose of maximizing the minimum rate of users for each cell via designing the transmit beamforming of the TRIS transceiver, subject to the power constraints of each TRIS transceiver unit. Since the objective function is non-differentiable, the max-min rate problem is difficult to solve. In order to tackle this challenging optimization problem, an efficient low-complexity optimization algorithm is developed. Specifically, the log-form rate function is transformed into a tractable form by employing the fractional programming (FP) methodology. Next, the max-min objective function can be approximated using a differentiable function derived from smooth approximation theory. Moreover, by applying the majorization-minimization (MM) technique and examining the optimality conditions, a solution is proposed that updates all variables analytically without relying on any numerical solvers. Numerical results are presented to demonstrate the convergence and effectiveness of the proposed low-complexity algorithm. Additionally, the algorithm can significantly reduce the computational complexity without performance loss. Furthermore, the simulation results illustrate the clear superiority of the deployment of the TRIS transceiver over the benchmark schemes.

eess.SP↗

arXiv2025

Spin-adapted open-shell time-dependent density functional theory: towards a simple and accurate method for spin-flip-down excitations

A major challenge in using spin-flip time-dependent density functional theory (SF-TD-DFT) for spin-flip-down excitations is the presence of spin contamination. While several improved methods have been developed in the past, a simple and accurate method remains elusive. Here, based on our previous development on spin-adapted open-shell TD-DFT for spin-conserving excitations (X-TD-DFT) [Z. Li and W. Liu, J. Chem. Phys. 135, 194106 (2011)], we introduce a method termed as XSF-TDA for modeling spin-flip-down excitations, and provide an in-depth comparison of different methodologies for mitigating spin contamination in SF-TDA. Pilot applications to prototype systems demonstrate the promise of XSF-TDA over existing SF-TDA methods, including unrestricted SF-TDA (USF-TDA) and mixed-reference SF-TDA (MRSF-TDA), in describing bond breakings and inverted singlet-triplet gap systems.

physics.chem-ph↗

arXiv2025

Representational power of selected neural network quantum states in second quantization

Neural network quantum states emerge as a promising tool for solving quantum many-body problems. However, its successes and limitations are still not well-understood in particular for Fermions with complex sign structures. Based on our recent work [J. Chem. Theory Comput. 21, 10252-10262 (2025)], we generalizes the restricted Boltzmann machine to a more general class of states for Fermions, formed by product of `neurons' and hence will be referred to as neuron product states (NPS). NPS builds correlation in a very different way, compared with the closely related correlator product states (CPS) [H. J. Changlani, et al. Phys. Rev. B, 80, 245116 (2009)], which use full-rank local correlators. In constrast, each correlator in NPS contains long-range correlations across all the sites, with its representational power constrained by the simple function form. We prove that products of such simple nonlocal correlators can approximate any wavefunction arbitrarily well under certain mild conditions on the form of activation functions. In addition, we also provide elementary proofs for the universal approximation capabilities of feedforward neural network (FNN) and neural network backflow (NNBF) in second quantization. Together, these results provide a deeper insight into the neural network representation of many-body wavefunctions in second quantization.

quant-ph↗

arXiv2025

Joint Discrete Antenna Positioning and Beamforming Optimization in Movable Antenna Enabled Full-Duplex ISAC Networks

In this paper, we propose a full-duplex integrated sensing and communication (ISAC) system enabled by a movable antenna (MA). By leveraging the characteristic of MA that can increase the spatial diversity gain, the performance of the system can be enhanced. We formulate a problem of minimizing the total transmit power consumption via jointly optimizing the discrete position of MA elements, beamforming vectors, sensing signal covariance matrix and user transmit power. Given the significant coupling of optimization variables, the formulated problem presents a non-convex optimization challenge that poses difficulties for direct resolution. To address this challenging issue, the discrete binary particle swarm optimization (BPSO) algorithm framework is employed to solve the formulated problem. Specifically, the discrete positions of MA elements are first obtained by iteratively solving the fitness function. The difference-of-convex (DC) programming and successive convex approximation (SCA) are used to handle non-convex and rank-1 terms in the fitness function. Once the BPSO iteration is complete, the discrete positions of MA elements can be determined, and we can obtain the solutions for beamforming vectors, sensing signal covariance matrix and user transmit power. Numerical results demonstrate the superiority of the proposed system in reducing the total transmit power consumption compared with fixed antenna arrays.

eess.SP↗

arXiv2025

Movable Antennas Enabled ISAC Systems: Fundamentals, Opportunities, and Future Directions

The movable antenna (MA)-enabled integrated sensing and communication (ISAC) system attracts widespread attention as an innovative framework. The ISAC system integrates sensing and communication functions, achieving resource sharing across various domains, significantly enhancing communication and sensing performance, and promoting the intelligent interconnection of everything. Meanwhile, MA utilizes the spatial variations of wireless channels by dynamically adjusting the positions of MA elements at the transmitter and receiver to improve the channel and further enhance the performance of the ISAC systems. In this paper, we first outline the fundamental principles of MA and introduce the application scenarios of MA-enabled ISAC systems. Then, we summarize the advantages of MA-enabled ISAC systems in enhancing spectral efficiency, achieving flexible and precise beamforming, and making the signal coverage range adjustable. Besides, a specific case is studied to show the performance gains in terms of transmit power that MA brings to ISAC systems. Finally, we discuss the challenges of MA-enabled ISAC and future research directions, aiming to provide insights for future research on MA-enabled ISAC systems.

eess.SP↗

arXiv2025

Analysis and Algorithm for Multi IRS Collaborative Localization via Hybrid Time Angle Estimation

This paper proposes a novel multiple intelligent reflecting surfaces (IRSs) collaborative hybrid localization system, which involves deploying multiple IRSs near the target area and achieving target localization through joint time delay and angle estimation. Specifically, echo signals from all reflective elements are received by each sensor and jointly processed to estimate the time delay and angle parameters. Based on the above model, we derive the Fisher Information Matrix (FIM) for cascaded delay, Angle of Arrival (AOA), and Angle of Departure (AOD) estimation in semi passive passive models, along with the corresponding Cramer Rao Bound (CRB). To achieve precise estimation close to the CRB, we design efficient algorithms for angle and location estimation. For angle estimation, reflective signals are categorized into three cases based on their rank, with different signal preprocessing. By constructing an atomic norm set and minimizing the atomic norm, the joint angle estimation problem is transformed into a convex optimization problem, and low-complexity estimation of multiple AOA and AOD pairs is achieved using the Alternating Direction Method of Multipliers (ADMM). For location estimation, we propose a three-stage localization algorithm that combines weighted least squares, total least squares, and quadratic correction to handle errors in the coefficient matrix and observation vector, thus improving accuracy. Numerical simulations validate the superiority of the proposed system, demonstrating that the system's collaboration, hybrid localization, and distributed deployment provide substantial benefits, as well as the accuracy of the proposed estimation algorithms, particularly in low signal to noise ratio (SNR) condition.

eess.SP↗

arXiv2025

Joint Spatial Registration and Resource Allocation for Transmissive RIS Enabled Cooperative ISCC Networks

In this paper, we propose a novel transmissive reconfigurable intelligent surface (TRIS) transceiver-driven cooperative integrated sensing, computing, and communication (ISCC) network to meet the requirement for a diverse network with low energy consumption. The cooperative base stations (BSs) are equipped with TRIS transceivers to accomplish sensing data acquisition, communication offloading, and computation in a time slot. In order to obtain higher cooperation gain, we utilize a signal-level spatial registration algorithm, which is realized by adjusting the beamwidth. Meanwhile, for more efficient offloading of the computational task, multistream communication is considered, and rank-$N$ constraints are introduced, which are handled using an iterative rank minimization (IRM) scheme. We construct an optimization problem with the objective function of minimizing the total energy consumption of the network to jointly optimize the beamforming matrix, time slot allocation, sensing data allocation and sensing beam scheduling variables. Due to the coupling of the variables, the proposed problem is a non-convex optimization problem, which we decouple and solve using a block coordinate descent (BCD) scheme. Finally, numerical simulation results confirm the superiority of the proposed scheme in improving the overall network performance and reducing the total energy consumption of the network.

cs.IT↗

arXiv2025

Learning-Based Blockage-Resilient Beam Training in Near-Field Terahertz Communications

Terahertz (THz) band is considered a promising candidate to meet the high-throughput requirement for future sixth-generation (6G) wireless communications due to its ultrawide bandwidth. However, due to the high penetration loss at high-frequencies, blockage becomes a serious problem in THz communications, especially in near-field indoor communications with numerous obstacles. To address this issue, this paper investigates blockage-resilient near-field beam training based on self-accelerating Airy beam, which can propagate along a curved trajectory to circumvent obstacles. Specifically, we first analyze the trajectory of the Airy beam and the beam pattern at the receiver using a discrete Fourier transform (DFT) codebook in the presence of obstacles. Interestingly, we reveal that the beam pattern not only captures the receiver's location information but also implicitly encodes the spatial relationship between the receiver and obstacle, which facilitates identifying the optimal Airy beam configuration. Based on this insight, we formulate the blockage-resilient beam training task as a multitask learning problem and propose a lightweight attention-based multi-parameter beam training network (AMPBT-Net) to jointly predict the angle, distance, and curvature parameters of the optimal Airy beam based on the beam pattern. Finally, simulation results demonstrate that the Airy beam effectively mitigates blockage effects and the proposed scheme achieves comparable performance to exhaustive beam sweeping while significantly reducing training overhead.

eess.SP↗

arXiv2025

Cooperative Multi-Static ISAC Networks: A Unified Design Framework for Active and Passive Sensing

Multi-static cooperative sensing emerges as a promising technology for advancing integrated sensing and communication (ISAC), enhancing sensing accuracy and range. In this paper, we develop a unified design framework for joint active and passive sensing (JAPS). In particular, we consider a JAPSbased cooperative multi-static ISAC system for coexisting downlink (DL) and uplink (UL) communications. An optimization problem is formulated for maximizing the sum rate of both the DL and UL transmissions via jointly optimizing beamforming, receive filters and power allocation, while guaranteeing the sensing requirements and transmission power constraints. However, the formulated problem is a non-convex optimization problem that is challenging to solve directly due to the tight coupling among optimization variables. To tackle this complicated issue, we employ an efficient algorithm architecture leveraging alternating optimization (AO). Specifically, with the given receive filters and transmission power for UL communication, the transmit beamforming subproblem is addressed by successive convex approximation (SCA)-based and penalty-based algorithms. A fractional programming (FP)-based algorithm is developed to tackle the receive filters and transmission power for UL communication optimization subproblem. Extensive numerical results validate the performance improvement of our proposed JAPS scheme and demonstrate the effectiveness of our proposed algorithms.

eess.SP↗

arXiv2025

A unified diagrammatic formulation of single-reference and multi-reference random phase approximations: the particle-hole and particle-particle channels

A diagrammatic multi-reference generalization of many-body perturbation theory was recently introduced [J. Phys. Chem. Lett., 2025, 16, 3047]. This framework allows us to extend single-reference (SR) Green's function methods defined at the diagrammatic level naturally into multi-reference case, as previously exemplified by the formulation of multi-reference direct random phase approximation (MR-dRPA) and the multi-reference second-order screened exchange approximation (MR-SOSEX). In this work, we further elaborate this framework and use it to develop MR generalizations of two other RPA variants, namely, particle-hole (ph) RPA with exchange (MR-RPAx) and particle-particle RPA (MR-ppRPA). We define these two MR generalizations by infinite order resummations of the generalized `ring' and `ladder' diagrams with antisymmetrized interaction vertices, respectively, which incorporate the contributions from the active-space connected two-body Green's functions. As for MR-dRPA, we derive unified sets of equations that hold at both SR and MR levels for RPAx and ppRPA, respectively. We perform numerical studies of prototypical systems using the three MR-RPA methods and carry out a perturbative analysis to gain a deeper understanding of their behaviors. We find that error cancellation between the second and third orders is a key factor for both SR-RPA and MR-RPA. In addition, we observe that MR-phRPA (MR-dRPA and MR-RPAx) and MR-ppRPA tend to overestimate and underestimate correlation energies, respectively, suggesting that a better accuracy can be achieved by further combining these two channels in the future.

quant-ph↗

arXiv2025

Hybrid tensor network and neural network quantum states for quantum chemistry

Neural network quantum states (NQS) have emerged as a powerful and flexible framework for addressing quantum many-body problems. While successful for model Hamiltonians, their application to molecular systems remains challenging for several reasons. In this work, we introduce three innovations to overcome some of the key limitations. (1) We propose two novel ansätzet hat hybridize tensor network and neural network states for addressing initialization challenges and enhancing the expressivity of tensor networks. First, we develop a bounded-degree graph recurrent neural network (BDG-RNN) ansatz that leverages graph-based updates, enabling applications to molecular electronic structure problems. Second, we introduce restricted Boltzmann machine (RBM) inspired correlators to further enhance expressivity and improve accuracy, without dramatically modifying the underlying variational Monte Carlo (VMC) optimization framework. (2) We introduce a semi-stochastic algorithm for local energy evaluation, which significantly reduces computational cost while maintaining high accuracy. Combining these advances, we demonstrate that our approaches can achieve chemical accuracy in challenging systems, including the one-dimensional hydrogen chain H50, the iron-sulfur cluster [Fe2S2(SCH3)4]^{2-}, and a three-dimensional $3 \times 3 \times 2$ hydrogen cluster H18. These methods are implemented in an open-source package - PyNQS (https://github.com/Quantum-Chemistry-Group-BNU/PyNQS) to advance NQS methodologies for quantum chemistry.

physics.chem-ph↗

arXiv2025

Exploiting Movable Antennas in NOMA Networks: Joint Beamforming, Power Allocation and Antenna Position Optimization

This paper investigates the movable antenna (MA)- assisted downlink non-orthogonal multiple access (NOMA) network to maximize system throughput. In the considered scenario, both the base station (BS) and users are equipped with MA, and a predetermined successive interference cancellation (SIC) decoding order is adopted. Based on the field-response channel model, we formulate a complex, non-convex problem to jointly optimize the BS beamforming, power allocation, and MA positions at both the transmitter and receivers. To address this, we propose an efficient algorithm based on an alternating optimization (AO) framework, which decomposes the original problem into three distinct subproblems. By employing sequential parametric convex approximation (SPCA) and successive convex approximation (SCA) techniques, the non-convex constraints within each subproblem are transformed into tractable. This methodology ensures the algorithm converges to a stable, locally optimal solution. Numerical results validate that the proposed system, which fully exploits the degrees of freedom from antenna mobility at both ends, significantly outperforms benchmarks in terms of throughput.

eess.SP↗

arXiv2025

Max-Min Rate Optimization for Multigroup Multicast MISO Systems Via Novel Transmissive RIS Transceiver

This paper investigates a novel transmissive reconfigurable intelligent surface (RIS) transceiver architectureenabled multigroup multicast downlink communication system. Under this setup, an optimization problem is formulated to maximize the minimum rate of users across all groups, subject to the maximum available power of each RIS unit. Due to the nondifferentiable nature of the objective function, the max-min rate problem is challenging to solve. To tackle this difficult problem, we develop an iterative solution by leveraging the successive convex approximation (SCA) and the penalty function method. However, the above approach has high computational complexity and may lead to compromised performance. To overcome these drawbacks, we design an efficient second-order cone programming (SOCP)-based method using the weighted minimum mean squared error (WMMSE) framework to reduce computational complexity. Furthermore, to further reduce the computational complexity, we also propose a low-complexity and solver-free algorithm that analytically updates all variables by combining the smooth approximation theory and the majorization-minimization (MM) method. Numerical results are provided to verify the convergence and effectiveness of our proposed three algorithms. It is also demonstrated that the SOCP-based method outperforms the penalty-based algorithm in terms of both the achieved min rate and the computational complexity. In contrast, the lowcomplexity design achieves significantly lower complexity with only slightly degraded performance.

eess.SP↗

arXiv2025

Entanglement-minimized orbitals enable faster quantum simulation of molecules

Quantum computation offers significant potential for accelerating the simulation of molecules and materials through algorithms such as quantum phase estimation (QPE). However, the expected speedup in ground-state energy estimation depends critically on the ability to efficiently prepare an initial state with high overlap with the true ground state. For strongly correlated molecules such as iron-sulfur clusters, this overlap is demonstrated to decay exponentially with system size. To alleviate this problem, we introduce an efficient classical algorithm to find entanglement-minimized orbitals (EMOs) using spin-adapted matrix product states (MPS) with small bond dimensions. The EMO basis yields a more compact ground-state representation, significantly easing initial state preparation for challenging systems. Our algorithm improves initial state overlap by nearly an order of magnitude over prior orbital optimization approaches for an iron-sulfur cluster with four irons, and is scalable to larger systems with many unpaired electrons, including the P-cluster and FeMo-cofactor in nitrogenase with eight transition metal centers. For these systems, we achieve substantial enhancements on initial state overlap by factors of $O(10^2)$ and $O(10^5)$, respectively, compared to results obtained using localized orbitals. Our results show that initial state preparation for these challenging systems requires far fewer resources than prior estimates suggested.

quant-ph↗

arXiv2025

Quantum-assisted variational Monte Carlo

Solving the ground state of quantum many-body systems remains a fundamental challenge in physics and chemistry. Recent advancements in quantum hardware have opened new avenues for addressing this challenge. Inspired by the quantum-enhanced Markov chain Monte Carlo (QeMCMC) algorithm [Nature, 619, 282-287 (2023)], which was originally designed for sampling the Boltzmann distribution of classical spin models using quantum computers, we introduce a quantum-assisted variational Monte Carlo (QA-VMC) algorithm for solving the ground state of quantum many-body systems by adapting QeMCMC to sample the distribution of a (neural-network) wave function in VMC. The central question is whether such quantum-assisted proposal can potentially offer a computational advantage over classical methods. Through numerical investigations for the Fermi-Hubbard model and molecular systems, we demonstrate that the quantum-assisted proposal exhibits larger absolute spectral gaps and reduced autocorrelation times compared to conventional classical proposals, leading to more efficient sampling and faster convergence to the ground state in VMC as well as more accurate and precise estimation of physical observables. This advantage is especially pronounced for specific parameter ranges, where the ground-state configurations are more concentrated in some configurations separated by large Hamming distances. Our results underscore the potential of quantum-assisted algorithms to enhance classical variational methods for solving the ground state of quantum many-body systems.

quant-ph↗

arXiv2025

Reinforcement Learning Optimization for Large-Scale Learning: An Efficient and User-Friendly Scaling Library

We introduce ROLL, an efficient, scalable, and user-friendly library designed for Reinforcement Learning Optimization for Large-scale Learning. ROLL caters to three primary user groups: tech pioneers aiming for cost-effective, fault-tolerant large-scale training, developers requiring flexible control over training workflows, and researchers seeking agile experimentation. ROLL is built upon several key modules to serve these user groups effectively. First, a single-controller architecture combined with an abstraction of the parallel worker simplifies the development of the training pipeline. Second, the parallel strategy and data transfer modules enable efficient and scalable training. Third, the rollout scheduler offers fine-grained management of each sample's lifecycle during the rollout stage. Fourth, the environment worker and reward worker support rapid and flexible experimentation with agentic RL algorithms and reward designs. Finally, AutoDeviceMapping allows users to assign resources to different models flexibly across various stages.

cs.LG↗