Wei Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wei Zhang has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Tianming Liu
University of Georgia
7 shared publications - Afrar Jahin
Department of Computer and Cyber Science Augusta University GA USA
4 shared publications - Arif Hassan Zidan
School of Computer and Cyber Sciences, Augusta University, Augusta, GA 30912, USA
4 shared publications - Yingfeng Wang
University of Tennessee at Chattanooga
4 shared publications - Yu Bao
Department of Graduate Psychology, James Madison University, Harrisonburg, VA 22807, USA
4 shared publications Afrar Jahin
2 shared publications
Latest Publications
- Open Access
- 12 November 2026
- Published by Springer Nature in Research Square
Precision Limits of Hamiltonian Learning for Quantum Processors under Calibration Uncertainty
Learning the Hamiltonian of a quantum processor is important for controlling and certifying quantum devices, but the state preparation and measurement used to probe it are themselves imperfect. Even when exact data identify an interaction uniquely, identifiability alone does not determine finite-data precision. Here we show, for n-qubit Markovian dynamics under geometric regularity conditions, that the local uncertainty of a Hamiltonian coefficient scales either linearly or as the square root of the entrywise error in the generator matrix in the readout gauge. Square-root scaling occurs exactly when a gauge transformation moves the coefficient at first order while noise positivity can be restored at second order, and real noise correlations drive this first-order change. As a consequence, under suitable dynamical and readout conditions, square-root scaling forces uniformly valid confidence intervals from N shots to have expected length Ω(N⁻¹⁄⁴), even for adaptive local experiments. Under a common generator norm bound, estimating this matrix attains this rate up to logarithmic factors. Experiments on three superconducting processors show that additional measurement bases increase the visibility of injected rotations at a matched number of shots. Whether a coupling admits the usual N⁻¹⁄² scaling is therefore set by how noise correlations and positivity constrain its gauge directions.
- 12 November 2026
- Published by Springer Nature in Research Square
Open AccessPrecision Limits of Hamiltonian Learning for Quantum Processors under Calibration Uncertainty
Learning the Hamiltonian of a quantum processor is important for controlling and certifying quantum devices, but the state preparation and measurement used to probe it are themselves imperfect. Even when exact data identify an interaction uniquely, identifiability alone does not determine finite-data precision. Here we show, for n-qubit Markovian dynamics under geometric regularity conditions, that the local uncertainty of a Hamiltonian coefficient scales either linearly or as the square root of the entrywise error in the generator matrix in the readout gauge. Square-root scaling occurs exactly when a gauge transformation moves the coefficient at first order while noise positivity can be restored at second order, and real noise correlations drive this first-order change. As a consequence, under suitable dynamical and readout conditions, square-root scaling forces uniformly valid confidence intervals from N shots to have expected length Ω(N⁻¹⁄⁴), even for adaptive local experiments. Under a common generator norm bound, estimating this matrix attains this rate up to logarithmic factors. Experiments on three superconducting processors show that additional measurement bases increase the visibility of injected rotations at a matched number of shots. Whether a coupling admits the usual N⁻¹⁄² scaling is therefore set by how noise correlations and positivity constrain its gauge directions.
- Open Access
- 2 October 2026
- Published by Springer Nature in Research Square
Efficient and identifiable noise models for symmetry-preserving quantum circuits
Noise models support quantum-circuit simulation and need recalibration as hardware and workloads change. For circuits whose ideal outputs occupy one Hamming-weight sector, independent bit-flip (IBF) models tie leakage from the sector to the flip rate. We introduce SA-IBF, a two-parameter closed-form model whose sector-preserving weight mixes independent bit flips with flips conditioned on the sector to control this leakage separately. For nonzero weights, no mixture of product bit-flip channels reproduces its kernel. Given ideal distributions, we derive local identifiability conditions and a rank diagnostic for each fit. Across two data sets on four IBM Heron processors, SA-IBF predicts test data with lower Hellinger distance than IBF on every execution. On molecular quantum-autoencoder circuits, it matches a 21-parameter noise model fitted by Bayesian optimization to within 0.01 in Hellinger distance at three of four qubit numbers, at over 200-fold lower computational cost. This enables low-cost noise modeling of small symmetry-preserving circuits.
- 2 October 2026
- Published by Springer Nature in Research Square
Open AccessEfficient and identifiable noise models for symmetry-preserving quantum circuits
Noise models support quantum-circuit simulation and need recalibration as hardware and workloads change. For circuits whose ideal outputs occupy one Hamming-weight sector, independent bit-flip (IBF) models tie leakage from the sector to the flip rate. We introduce SA-IBF, a two-parameter closed-form model whose sector-preserving weight mixes independent bit flips with flips conditioned on the sector to control this leakage separately. For nonzero weights, no mixture of product bit-flip channels reproduces its kernel. Given ideal distributions, we derive local identifiability conditions and a rank diagnostic for each fit. Across two data sets on four IBM Heron processors, SA-IBF predicts test data with lower Hellinger distance than IBF on every execution. On molecular quantum-autoencoder circuits, it matches a 21-parameter noise model fitted by Bayesian optimization to within 0.01 in Hellinger distance at three of four qubit numbers, at over 200-fold lower computational cost. This enables low-cost noise modeling of small symmetry-preserving circuits.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Quantum Machine Learning: Bridging Quantum Computing & Machine Learning
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessQuantum Machine Learning: Bridging Quantum Computing & Machine Learning
- Open Access
- 2 April 2026
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 2382-2403
A Theoretical and Experimental Exploration in Permutation Randomization on Nonsmooth Nonconvex Optimization
While gradient-based optimizers that incorporate randomization often demonstrate superior performance on complex optimizations, the theoretical foundations of this advantage remain underexplored. A central question arises: What role does randomization play in dimension-free, nonsmooth, nonconvex optimization? To address this gap, we examine both the theoretical and empirical impact of permutation randomization within gradient-based optimization frameworks, using it as a representative case to investigate broader implications. From a theoretical perspective, our analysis reveals that permutation randomization disrupts the shrinkage behavior characteristic of gradient-based optimizers, allowing for continued progress toward the global optimum with sufficient iterations. Moreover, we prove that permutation randomization preserves the convergence rate of the underlying optimizer. Empirically, we conduct extensive numerical experiments comparing permutation-randomized optimizers with three baseline methods. These experiments span tasks such as training deep neural networks with stacked architectures and optimizing noisy objective functions. The results not only support our theoretical findings but also demonstrate the practical benefits of permutation randomization. In summary, this work provides both rigorous theoretical justification and compelling empirical evidence for the effectiveness of permutation randomization, establishing a foundation for extending such analyses to broader implications of randomized strategies.
- 2 April 2026
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 2382-2403
Open AccessA Theoretical and Experimental Exploration in Permutation Randomization on Nonsmooth Nonconvex Optimization
While gradient-based optimizers that incorporate randomization often demonstrate superior performance on complex optimizations, the theoretical foundations of this advantage remain underexplored. A central question arises: What role does randomization play in dimension-free, nonsmooth, nonconvex optimization? To address this gap, we examine both the theoretical and empirical impact of permutation randomization within gradient-based optimization frameworks, using it as a representative case to investigate broader implications. From a theoretical perspective, our analysis reveals that permutation randomization disrupts the shrinkage behavior characteristic of gradient-based optimizers, allowing for continued progress toward the global optimum with sufficient iterations. Moreover, we prove that permutation randomization preserves the convergence rate of the underlying optimizer. Empirically, we conduct extensive numerical experiments comparing permutation-randomized optimizers with three baseline methods. These experiments span tasks such as training deep neural networks with stacked architectures and optimizing noisy objective functions. The results not only support our theoretical findings but also demonstrate the practical benefits of permutation randomization. In summary, this work provides both rigorous theoretical justification and compelling empirical evidence for the effectiveness of permutation randomization, establishing a foundation for extending such analyses to broader implications of randomized strategies.
- Open Access
Quantum-Classical Hybrid Molecular Autoencoder for Advancing Classical Decoding
Although recent advances in quantum machine learning (QML) offer significant potential for enhancing generative models, particularly in molecular design, a large array of classical approaches still face challenges in achieving high fidelity and validity. In particular, the integration of QML with sequence-based tasks, such as Simplified Molecular Input Line Entry System (SMILES) string reconstruction, remains underexplored and usually suffers from fidelity degradation. In this work, we propose a hybrid quantum-classical architecture for SMILES reconstruction that integrates quantum encoding with classical sequence modeling to improve quantum fidelity and classical similarity. Our approach achieves a quantum fidelity of approximately 84% and a classical reconstruction similarity of 60%, surpassing existing quantum baselines. Our work lays a promising foundation for future QML applications, striking a balance between expressive quantum representations and classical sequence models and catalyzing broader research on quantum-aware sequence models for molecular and drug discovery.
Open AccessQuantum-Classical Hybrid Molecular Autoencoder for Advancing Classical Decoding
Although recent advances in quantum machine learning (QML) offer significant potential for enhancing generative models, particularly in molecular design, a large array of classical approaches still face challenges in achieving high fidelity and validity. In particular, the integration of QML with sequence-based tasks, such as Simplified Molecular Input Line Entry System (SMILES) string reconstruction, remains underexplored and usually suffers from fidelity degradation. In this work, we propose a hybrid quantum-classical architecture for SMILES reconstruction that integrates quantum encoding with classical sequence modeling to improve quantum fidelity and classical similarity. Our approach achieves a quantum fidelity of approximately 84% and a classical reconstruction similarity of 60%, surpassing existing quantum baselines. Our work lays a promising foundation for future QML applications, striking a balance between expressive quantum representations and classical sequence models and catalyzing broader research on quantum-aware sequence models for molecular and drug discovery.
- 22 July 2025
- Published by Elsevier in Acta Biomaterialia
- Vol. 203, 181-213
Mechanical characterization of brain tissue: experimental techniques, human testing considerations, and perspectives
- 22 July 2025
- Published by Elsevier in Acta Biomaterialia
- Vol. 203, 181-213
Mechanical characterization of brain tissue: experimental techniques, human testing considerations, and perspectives
- Open Access
Permutation Randomization on Nonsmooth Nonconvex Optimization: A Theoretical and Experimental Study
While gradient-based optimizers that incorporate randomization often showcase superior performance on complex optimization, the theoretical foundations underlying this superiority remain insufficiently understood. A particularly pressing question has emerged: What is the role of randomization in dimension-free nonsmooth nonconvex optimization? To address this gap, we investigate the theoretical and empirical impact of permutation randomization within gradient-based optimization frameworks, using it as a representative case to explore broader implications. From a theoretical perspective, our analyses reveal that permutation randomization disrupts the shrinkage behavior of gradient-based optimizers, facilitating continuous convergence toward the global optimum given a sufficiently large number of iterations. Additionally, we prove that permutation randomization can preserve the convergence rate of the underlying optimizer. On the empirical side, we conduct extensive numerical experiments comparing permutation-randomized optimizer against three baseline methods. These experiments span tasks such as training deep neural networks with stacked architectures and optimizing noisy objective functions. The results not only corroborate our theoretical insights but also highlight the practical benefits of permutation randomization. In summary, this work delivers both rigorous theoretical justification and compelling empirical evidence for the effectiveness of permutation randomization. Our findings and evidence lay a foundation for extending analytics to encompass a wide array of randomization.
Open AccessPermutation Randomization on Nonsmooth Nonconvex Optimization: A Theoretical and Experimental Study
While gradient-based optimizers that incorporate randomization often showcase superior performance on complex optimization, the theoretical foundations underlying this superiority remain insufficiently understood. A particularly pressing question has emerged: What is the role of randomization in dimension-free nonsmooth nonconvex optimization? To address this gap, we investigate the theoretical and empirical impact of permutation randomization within gradient-based optimization frameworks, using it as a representative case to explore broader implications. From a theoretical perspective, our analyses reveal that permutation randomization disrupts the shrinkage behavior of gradient-based optimizers, facilitating continuous convergence toward the global optimum given a sufficiently large number of iterations. Additionally, we prove that permutation randomization can preserve the convergence rate of the underlying optimizer. On the empirical side, we conduct extensive numerical experiments comparing permutation-randomized optimizer against three baseline methods. These experiments span tasks such as training deep neural networks with stacked architectures and optimizing noisy objective functions. The results not only corroborate our theoretical insights but also highlight the practical benefits of permutation randomization. In summary, this work delivers both rigorous theoretical justification and compelling empirical evidence for the effectiveness of permutation randomization. Our findings and evidence lay a foundation for extending analytics to encompass a wide array of randomization.
- Open Access
HOME-3: High-Order Momentum Estimator with Third-Power Gradient for Convex and Smooth Nonconvex Optimization
Momentum-based gradients are essential for optimizing advanced machine learning models, as they not only accelerate convergence but also advance optimizers to escape stationary points. While most state-of-the-art momentum techniques utilize lower-order gradients, such as the squared first-order gradient, there has been limited exploration of higher-order gradients, particularly those raised to powers greater than two. In this work, we introduce the concept of high-order momentum, where momentum is constructed using higher-power gradients, with a focus on the third-power of the first-order gradient as a representative case. Our research offers both theoretical and empirical support for this approach. Theoretically, we demonstrate that incorporating third-power gradients can improve the convergence bounds of gradient-based optimizers for both convex and smooth nonconvex problems. Empirically, we validate these findings through extensive experiments across convex, smooth nonconvex, and nonsmooth nonconvex optimization tasks. Across all cases, high-order momentum consistently outperforms conventional low-order momentum methods, showcasing superior performance in various optimization problems.
Open AccessHOME-3: High-Order Momentum Estimator with Third-Power Gradient for Convex and Smooth Nonconvex Optimization
Momentum-based gradients are essential for optimizing advanced machine learning models, as they not only accelerate convergence but also advance optimizers to escape stationary points. While most state-of-the-art momentum techniques utilize lower-order gradients, such as the squared first-order gradient, there has been limited exploration of higher-order gradients, particularly those raised to powers greater than two. In this work, we introduce the concept of high-order momentum, where momentum is constructed using higher-power gradients, with a focus on the third-power of the first-order gradient as a representative case. Our research offers both theoretical and empirical support for this approach. Theoretically, we demonstrate that incorporating third-power gradients can improve the convergence bounds of gradient-based optimizers for both convex and smooth nonconvex problems. Empirically, we validate these findings through extensive experiments across convex, smooth nonconvex, and nonsmooth nonconvex optimization tasks. Across all cases, high-order momentum consistently outperforms conventional low-order momentum methods, showcasing superior performance in various optimization problems.
- Open Access
- 30 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (3) , 554
Semi-Nonlinear Deep Efficient Reconstruction for Unveiling Linear and Nonlinear Spatial Features of the Human Brain
Deep learning has become indispensable for identifying hierarchical spatial features (SFs), which are crucial for linking neurological disorders to brain functionality, from functional Magnetic Resonance Imaging (fMRI). Unfortunately, existing methods are constrained by architectures that are either linear or nonlinear, limiting a comprehensive categorization of spatial features. To overcome this limitation, we introduce the Semi-Nonlinear Deep Efficient Reconstruction (SENDER) framework, a novel hybrid approach designed to simultaneously capture both linear and nonlinear spatial features, providing a holistic understanding of brain functionality. In our approach, linear SFs are formed by directly integrating multiple spatial features at shallow layers, whereas nonlinear SFs emerge from combining partial regions of these features, yielding complex patterns at deeper layers. We validated SENDER through extensive qualitative and quantitative evaluations with four state-of-the-art methods. Results demonstrate its superior performance, identifying five reproducible linear SFs and eight reproducible nonlinear SFs.
- 30 January 2025
- Published by MDPI AG in Electronics
- Vol. 14 (3) , 554
Open AccessSemi-Nonlinear Deep Efficient Reconstruction for Unveiling Linear and Nonlinear Spatial Features of the Human Brain
Deep learning has become indispensable for identifying hierarchical spatial features (SFs), which are crucial for linking neurological disorders to brain functionality, from functional Magnetic Resonance Imaging (fMRI). Unfortunately, existing methods are constrained by architectures that are either linear or nonlinear, limiting a comprehensive categorization of spatial features. To overcome this limitation, we introduce the Semi-Nonlinear Deep Efficient Reconstruction (SENDER) framework, a novel hybrid approach designed to simultaneously capture both linear and nonlinear spatial features, providing a holistic understanding of brain functionality. In our approach, linear SFs are formed by directly integrating multiple spatial features at shallow layers, whereas nonlinear SFs emerge from combining partial regions of these features, yielding complex patterns at deeper layers. We validated SENDER through extensive qualitative and quantitative evaluations with four state-of-the-art methods. Results demonstrate its superior performance, identifying five reproducible linear SFs and eight reproducible nonlinear SFs.
- Open Access
- 4 December 2024
- Published by Elsevier in IBRO Neuroscience Reports
- Vol. 19, 1128-1140
Mapping longitudinally consistent intrinsic connectivity networks in macaque brain via longitudinal sparse dictionary learning
- 4 December 2024
- Published by Elsevier in IBRO Neuroscience Reports
- Vol. 19, 1128-1140
Open AccessMapping longitudinally consistent intrinsic connectivity networks in macaque brain via longitudinal sparse dictionary learning