Tianyao Chu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tianyao Chu has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Liqiang Lu
Zhejiang University, Hangzhou, China
4 shared publications - Jianwei Yin
School of Software Technology, Zhejiang University, Ningbo, China
3 shared publications - Siwei Tan
Zhejiang University, Hangzhou, Zhejiang, China
3 shared publications - Debin Xiang
Zhejiang University, Hangzhou, China
2 shared publications - Jingwen Leng
Shanghai Jiao Tong University, Shanghai, China
2 shared publications Congliang Lang
College of Computer Science, Zhejiang University, Hangzhou, Zhejiang, China
1 shared publication
Latest Publications
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 764-777
Rasengan: A Transition Hamiltonian-based Approximation Algorithm for Solving Constrained Binary Optimization Problems
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 764-777
Open AccessRasengan: A Transition Hamiltonian-based Approximation Algorithm for Solving Constrained Binary Optimization Problems
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 595-608
YOUTIAO: Hybrid Multiplexing with Dynamic Qubit Grouping for Low-cost and Scalable Quantum Wiring
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 595-608
Open AccessYOUTIAO: Hybrid Multiplexing with Dynamic Qubit Grouping for Low-cost and Scalable Quantum Wiring
- Open Access
- 11 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (2) , 1007-1020
HeteroQNN: Enabling Distributed QNN Under Heterogeneous Quantum Devices
In the current NISQ era, the performance of quantum neural network (QNN) models is strictly hindered by the limited qubit number and inevitable noise. A natural idea to improve the robustness of QNN is the implementation of a distributed system. Nevertheless, due to the heterogeneity and instability of quantum chips (e.g., noise, frequent online/offline), training and inference on distributed quantum devices may even destroy the accuracy. In this article, we propose HeteroQNN, a comprehensive QNN framework designed for efficient and high-accuracy distributed training and inference. The main innovation of HeteroQNN is it decouples the QNN circuit into two uniform representations: model vector and behavioral vector. The model vector specifies the gate parameters in the QNN model, while the behavioral vector captures the hardware features when implementing the QNN circuit. To handle the architectural heterogeneity, we introduce personalized QNN models in each quantum processing unit (QPU) and share the gradient among QPUs with homogeneous behavioral vectors. We propose shot-oriented distributed inference, which is much more fine-grained scheduling that can improve accuracy and balance the workload. Finally, by leveraging the hidden homogeneity in the model vector, we present the maintenance for QPU variability. The experiments show that HeteroQNN accelerates the training process by $4.03 \times $ with 7.87% loss reduction, compared with the previous distributed QNN framework.
- 11 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 45 (2) , 1007-1020
Open AccessHeteroQNN: Enabling Distributed QNN Under Heterogeneous Quantum Devices
In the current NISQ era, the performance of quantum neural network (QNN) models is strictly hindered by the limited qubit number and inevitable noise. A natural idea to improve the robustness of QNN is the implementation of a distributed system. Nevertheless, due to the heterogeneity and instability of quantum chips (e.g., noise, frequent online/offline), training and inference on distributed quantum devices may even destroy the accuracy. In this article, we propose HeteroQNN, a comprehensive QNN framework designed for efficient and high-accuracy distributed training and inference. The main innovation of HeteroQNN is it decouples the QNN circuit into two uniform representations: model vector and behavioral vector. The model vector specifies the gate parameters in the QNN model, while the behavioral vector captures the hardware features when implementing the QNN circuit. To handle the architectural heterogeneity, we introduce personalized QNN models in each quantum processing unit (QPU) and share the gradient among QPUs with homogeneous behavioral vectors. We propose shot-oriented distributed inference, which is much more fine-grained scheduling that can improve accuracy and balance the workload. Finally, by leveraging the hidden homogeneity in the model vector, we present the maintenance for QPU variability. The experiments show that HeteroQNN accelerates the training process by $4.03 \times $ with 7.87% loss reduction, compared with the previous distributed QNN framework.
- Open Access
- 19 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 2 (FSE) , 734-756
HornBro: Homotopy-Like Method for Automated Quantum Program Repair
Quantum programs provide exponential speedups compared to classical programs in certain areas, but they also inevitably encounter logical faults. Automatically repairing quantum programs is much more challenging than repairing classical programs due to the non-replicability of data, the vast search space of program inputs, and the new programming paradigm. Existing works based on semantic-based or learning-based program repair techniques are fundamentally limited in repairing efficiency and effectiveness. In this work, we propose HornBro, an efficient framework for automated quantum program repair. The key insight of HornBro lies in the homotopy-like method, which iteratively switches between the classical and quantum parts. This approach allows the repair tasks to be efficiently offloaded to the most suitable platforms, enabling a progressive convergence toward the correct program. We start by designing an implication assertion pragma to enable rigorous specifications of quantum program behavior, which helps to generate a quantum test suite automatically. This suite leverages the orthonormal bases of quantum programs to accommodate different encoding schemes. Given a fixed number of test cases, it allows the maximum input coverage of potential counter-example candidates. Then, we develop a Clifford approximation method with an SMT-based search to transform the patch localization program into a symbolic reasoning problem. Finally, we offload the computationally intensive repair of gate parameters to quantum hardware by leveraging the differentiability of quantum gates. Experiments suggest that HornBro increases the repair success rate by more than 62.5% compared to the existing repair techniques, supporting more types of quantum bugs. It also achieves 35.7× speedup in the repair and 99.9% gate reduction of the patch.
- 19 June 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 2 (FSE) , 734-756
Open AccessHornBro: Homotopy-Like Method for Automated Quantum Program Repair
Quantum programs provide exponential speedups compared to classical programs in certain areas, but they also inevitably encounter logical faults. Automatically repairing quantum programs is much more challenging than repairing classical programs due to the non-replicability of data, the vast search space of program inputs, and the new programming paradigm. Existing works based on semantic-based or learning-based program repair techniques are fundamentally limited in repairing efficiency and effectiveness. In this work, we propose HornBro, an efficient framework for automated quantum program repair. The key insight of HornBro lies in the homotopy-like method, which iteratively switches between the classical and quantum parts. This approach allows the repair tasks to be efficiently offloaded to the most suitable platforms, enabling a progressive convergence toward the correct program. We start by designing an implication assertion pragma to enable rigorous specifications of quantum program behavior, which helps to generate a quantum test suite automatically. This suite leverages the orthonormal bases of quantum programs to accommodate different encoding schemes. Given a fixed number of test cases, it allows the maximum input coverage of potential counter-example candidates. Then, we develop a Clifford approximation method with an SMT-based search to transform the patch localization program into a symbolic reasoning problem. Finally, we offload the computationally intensive repair of gate parameters to quantum hardware by leveraging the differentiability of quantum gates. Experiments suggest that HornBro increases the repair success rate by more than 62.5% compared to the existing repair techniques, supporting more types of quantum bugs. It also achieves 35.7× speedup in the repair and 99.9% gate reduction of the patch.