Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tianze Zhu

dblp:356/1105 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2026
0009-0006-8350-0351ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Quantum computing and quantum information · 86% Mathematical optimization · 14%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information
quantum communication
1.012026
Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network · IEEE Trans. Commun. 2026
Quantum computing and quantum information
quantum network
1.012026
Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network · IEEE Trans. Commun. 2026
Quantum computing and quantum information › quantum network
quantum repeater
1.012026
Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network · IEEE Trans. Commun. 2026
Quantum computing and quantum information › quantum communication
quantum teleportation
1.012026
Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network · IEEE Trans. Commun. 2026
Emerging computing paradigms
quantum computing
0.912025
Rasengan: A Transition Hamiltonian-based Approximation Algorithm for Solving Constrained Binary Optimization Problems · MICRO 2025
Mathematical optimization › integer programming
binary optimization
0.912025
Rasengan: A Transition Hamiltonian-based Approximation Algorithm for Solving Constrained Binary Optimization Problems · MICRO 2025
Quantum computing and quantum information
quantum algorithms
0.912025
SAPO: Improving the Scalability and Accuracy of Quantum Linear Solver for Portfolio Optimization · DAC 2025
Computational finance and economics › portfolio management
portfolio optimization
0.312025
SAPO: Improving the Scalability and Accuracy of Quantum Linear Solver for Portfolio Optimization · DAC 2025

Methods — techniques the papers use, named apart from their topics

min-max eigenvalue model · 1.7approximation algorithm · 1.7HHL algorithm · 1.7
YearPublicationVenuePosition
2026 Reliable Multi-Qubit Teleportation in a Thousand-Node Quantum Network
Xiaofeng Jiang, Tianze Zhu, Sen Kuang, Yiyang Yu, Luying Zhang, Shuangwu Chen, Huasen He, Jian Yang 0014
IEEE Trans. Commun.2
2025 SAPO: Improving the Scalability and Accuracy of Quantum Linear Solver for Portfolio Optimization
abstract
Portfolio optimization is one of the most important financial problem, suffering from huge computational pressure due to arithmetic complexity. Quantum computing offers polynomial or even exponential speedup that turns out to be a promising approach. However, existing quantum methods is fundamentally limited by either poor scalability or insufficient accuracy. In this paper, we propose SAPO, which formally articulates the quantum circuit that seamlessly integrates financial theory and historical data characteristics with quantum algebra. The circuit design is extended from the HHL algorithm incorporating mean-variance theory, which promotes scalability by equivalent transformation. Then, we present a min-max eigenvalue model that leverages historical financial information to refine parameter settings with high accuracy. Experiments conducted on market data demonstrate that SAPO can effectively reduce the complexity by $\mathbf{3 6. 9 4 \%}$ compared to basic HHL [1], [2] and improve the accuracy by $1.46 \times$ compared to hybrid HHL [3].
Tianze Zhu, Liqiang Lu, Hengrui Chen, Meng Xi 0002, Jinshan Zhang 0001, Jianwei Yin
DAC1
2025 Efficient Gate-Encoded Quantum Convolutional Neural Network with Channel Attention for Image Classification
abstract
This paper presents an improved Quantum Convolutional Neural Network (QCNN) architecture that overcomes key limitations of current quantum-classical hybrid models for image classification. To address challenges in expressivity and feature extraction on noisy intermediate-scale quantum (NISQ) devices, we propose two key innovations: (1) Gate Encoding Optimization, which reduces quantum bit (qubit) usage while retaining spatial information, and (2) Quantum Channel Attention (QCA), a novel attention mechanism tailored for hybrid QCNNs which utilizes measurement-driven feedback to capture inter-channel dependencies. Evaluated on the MNIST dataset, our model achieves 95.68 % accuracy—on par with classical CNNs (95.73 %) and significantly better than a baseline QCNN (93.23%)—while reducing parameters by 49.6 %. These results demonstrate the proposed model's effectiveness and practicality for quantum machine learning in the NISQ era.
Yongzhe Lin, Guanting Yu, Tianze Zhu, Xiaofeng Jiang
ICTAI3
2025 Rasengan: A Transition Hamiltonian-based Approximation Algorithm for Solving Constrained Binary Optimization Problems
Qifan Jiang 0001, Liqiang Lu, Debin Xiang, Tianyao Chu, Tianze Zhu, Jingwen Leng, Yun Liang 0001, Xiaoming Sun 0001, Jianwei Yin
MICRO5
2023 Integrating Climate Variable Data in Machine Learning Models for Predictive Analytics of Tomato Yields in California
abstract
Traditionally, agricultural forecasting has relied on empirical methods and basic statistical analysis, such as applying average values from previous years’ yields or using a simple linear fit for next year’s predictions. However, the emergence of data-driven approaches, particularly machine learning algorithms, has revolutionized yield prediction in agriculture. Machine learning techniques have demonstrated their potential to provide accurate predictions. However, existing models often rely on a limited number of input variables for crop yield predictions, which makes them only suitable for specific scenarios. In this study, we have developed four distinct machine learning-based predictors, incorporating various climate factors, including daytime temperature, nighttime temperature, precipitation (rainfall), vegetation index, and evapotranspiration as input variables to predict tomato acreage yields in counties of California, USA. Our results show that regression models constructed using neural networks and linear regression exhibited better performance than other predictors, achieving an average accuracy rate of 70% to 80%. Compared to most of the existing crop yield predictors, our models offer versatility while maintaining a desirable level of predictive accuracy. Expanding the number of input variables, such as nitrogen fertilizer usage etc, and introducing larger spatial and temporal high-resolution datasets for model training can improve our model performance, enabling us to obtain better results in tomato yield prediction.
Tianze Zhu, Tingyi Tan, Shuheng Wang, Thilanka Munasinghe, Heidi Tubbs, Assaf Anyamba
IEEE Big Data1