arXiv subjects

Zhao-Wei Wang

Publications and source records attributed to Zhao-Wei Wang.

7 recordsLinked to original sources

arXiv2026

Forked Physics-Informed Neural Networks for Non-Markovian Open Quantum Dynamics and Control

Physics-informed neural networks (PINNs) provide a pathway to reunify the simulation and control of quantum systems, in which these two tasks are typically decoupled in traditional strategies. However, most work remains confined to Markovian environments. When applied to non-Markovian systems, standard PINN architectures fail to converge reliably due to multi-objective optimization conflicts arising from the coupled differential equations. To address this fundamental limitation, we extend our previously proposed forked PINN (FPINN) by incorporating a dedicated control branch. By decoupling the optimization objectives at the gradient level via selective gradient flow, our method turns a previously intractable multi-task optimization into a well-conditioned one, allowing simulation and control to be optimized jointly without compromise. Numerical simulations on a two-qubit Heisenberg XXX model confirm that our framework faithfully reproduces the features of non-Markovian dynamics, including decoherence and information backflow. Taking a state-preparation task on the same model as an example, our FPINN achieves higher fidelity than gradient ascent pulse engineering, chopped random basis, and standard PINNs, with the advantage becoming more pronounced as the environment becomes more dissipative and more Markovian. The generated pulses are also noticeably smoother, which is advantageous for experimental implementation. Our framework thus provides a unified, end-to-end differentiable paradigm for simulation and control of open quantum systems, with potential implications for quantum computing, simulation, and control.

quant-ph↗

arXiv2026

Enhancing Presolve in Mixed Integer Programming by Combining Probing and Dual Fixing

Probing and dual fixing are two powerful presolve techniques in mixed integer programming (MIP) solvers. Probing tentatively sets some binary variables to 0 or 1, applies linear constraint based domain propagation techniques to derive better variable bounds, and extracts useful information such as stronger variable implications and better global variable bounds. Dual fixing attempts to fix variables to lower or upper bounds while ensuring that at least one optimal solution is retained, as long as the problem was feasible. In this paper, we investigate how to combine the two approaches in MIP solvers to achieve a better performance. In particular, we first embed dual fixing into the probing framework, deriving more useful variables' implications for enhancing the capability of probing. Then, we develop an improved dual fixing technique where more variable fixings can be applied, and use the probing framework to detect the reductions. Computational results on the MIPLIB 2017 benchmark instances demonstrate the potential of the two proposed techniques in combining probing and dual fixing on the open-source MIP solver HiGHS.

math.OC↗

arXiv2026

Exploiting Variable Implications in Presolve for Mixed Integer Programming

Presolve for mixed integer programming (MIP) problems aims to eliminate redundant information, strengthen the formulation, and extract useful structural information for the subsequent branch-and-cut process. An important type of such structural information is the variable implications (VIs), which describe how a bound on a variable depends on a bound of a binary variable. In this paper, we develop two new presolve techniques that exploit VIs to derive reductions for MIP problems. The first technique, called VI aggregation, aggregates multiple VIs into a single inequality by using implications between a variable and a set of binary variables that form a clique. This aggregation can reduce the number of constraints and tighten the linear programming relaxation. The second technique, called VI-aware linear constraint propagation (LCP), builds on the standard LCP but incorporates VIs associated with the variable being tightened to derive more reductions and can derive tighter variable bounds. We show that although VI information is additionally considered, the tightest lower or upper bound of a variable can still be derived in linear time. Moreover, compared with a state-of-the-art approach in the literature, the proposed VI-aware LCP can derive tighter variable bounds. Computational results on MIPLIB 2017 benchmark instances demonstrate the effectiveness of VI aggregation and VI-aware LCP in improving the performance of the open-source MIP solver HiGHS. In particular, using the two proposed presolve techniques, a reduction of 4% in solving time and 6% in node number on HiGHS can be achieved.

math.OC↗

arXiv2026

Forked Physics Informed Neural Networks for Coupled Systems of Differential equations

Solving coupled systems of differential equations (DEs) is a central problem across scientific computing. While Physics Informed Neural Networks (PINNs) offer a promising, mesh-free approach, their standard architectures struggle with the multi-objective optimization conflicts and local optima traps inherent in coupled problems. To address the first issue, we propose a Forked PINN (FPINN) framework designed for coupled systems of DEs. FPINN employs a shared base network with independent branches, isolating gradient pathways to stabilize training. We demonstrate the effectiveness of FPINN in simulating non-Markovian open quantum dynamics governed by coupled DEs, where multi-objective conflicts and local optima traps often cause evolutionary stagnation. To overcome this second challenge, we incorporate an evolution regularization loss that guides the model away from trivial solutions and ensures physically meaningful evolution. We demonstrate the effectiveness of FPINN in simulating non-Markovian open quantum dynamics governed by coupled DEs, where multi-objective conflicts and local optima traps often cause evolutionary stagnation. For the spin-boson and XXZ models, FPINN accurately captures hallmark non-Markovian features, such as quantum coherence revival and information backflow, significantly outperforming standard PINNs. The proposed FPINN architecture offers a general and effective framework for solving coupled systems of equations, which arise across a broad spectrum from classical physics to modern artificial intelligence, including applications in multi-body rotational dynamics, multi-asset portfolio optimization, chemical reaction kinetics, and deep representation learning.

quant-ph↗

arXiv2025

Machine-Learning-Assisted Pulse Design for State Preparation in a Noisy Environment

High-precision quantum control is essential for quantum computing and quantum information processing. However, its practical implementation is challenged by environmental noise, which affects the stability and accuracy of quantum systems. In this paper, using machine learning techniques we propose a quantum control approach that incorporates environmental factors into the design of control schemes, improving the control fidelity in noisy environments. Specifically, we investigate arbitrary quantum state preparation in a two-level system coupled to a bosonic bath. We use both Deep Reinforcement Learning (DRL) and Supervised Learning (SL) algorithms to design specific control pulses that mitigate the noise. These two neural network (NN) based algorithm both have the advantage that the well trained NN can output the optimal pulse sequence for any environmental parameters. Comparing the performance of these two algorithms, our results show that DRL is more effective in low-noise environments due to its strong optimization capabilities, while SL provides greater stability and performs better in high-noise conditions. These findings highlight the potential of machine learning techniques to enhance the quantum control fidelity in practical applications.

quant-ph↗

arXiv2024

Arbitrary quantum states preparation aided by deep reinforcement learning

The preparation of quantum states is essential in the realm of quantum information processing, and the development of efficient methodologies can significantly alleviate the strain on quantum resources. Within the framework of deep reinforcement learning (DRL), we integrate the initial and the target state information within the state preparation task together, so as to realize the control trajectory design between two arbitrary quantum states. Utilizing a semiconductor double quantum dots (DQDs) model, our results demonstrate that the resulting control trajectories can effectively achieve arbitrary quantum state preparation (AQSP) for both single-qubit and two-qubit systems, with average fidelities of 0.9868 and 0.9556 for the test sets, respectively. Furthermore, we consider the noise around the system and the control trajectories exhibit commendable robustness against charge and nuclear noise. Our study not only substantiates the efficacy of DRL in QSP, but also provides a new solution for quantum control tasks of multi-initial and multi-objective states, and is expected to be extended to a wider range of quantum control problems.

quant-ph↗

arXiv2024

Time series prediction of open quantum system dynamics

Time series prediction (TSP) has been widely used in various fields, such as life sciences and finance, to forecast future trends based on historical data. However, to date, there has been relatively little research conducted on the TSP for quantum physics. In this paper, we explore the potential application of TSP in forecasting the dynamical evolution of open quantum systems. We employ deep learning techniques to train a TSP model and evaluate its performance by comparison with exact solution. We use the ratio of the prediction step length and the sequence length to define short and long-term forecasting. Our results show that the trained model has the ability to effectively capture the inherent characteristics of time series for both short-term and long-term forecasting. Accurate predictions for different coupling intensities and initial states are obtained. Furthermore, we use our method to train another model and find that it can successfully predict the steady state of the system. These findings suggests that TSP is a valuable tool for the prediction of the dynamics in open quantum systems.

quant-ph↗