Haimeng Zhao

Haimeng Zhao

Auto-generated profile, based on publicly available information

Haimeng Zhao

Center for Quantum Information, IIIS, Tsinghua University, Beijing, China

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 October 2024 in PRX Quantum
Verified
Journal Article
Open access
HZHaimeng Zhao
Haimeng Zhao
LLLaura Lewis
Laura Lewis
IKIshaan Kannan
Ishaan Kannan
YQYihui Quek
Yihui Quek
Hsin-Yuan HuangHsin-Yuan Huang
Hsin-Yuan Huang
MCMatthias C. Caro
Matthias C. Caro
While quantum state tomography is notoriously hard, most states hold little interest to practically minded tomographers. Given that states and unitaries appearing in nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G . While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G . We illustrate how these results establish fundamental limitations on the expressivity of quantum machine-learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries. Published by the American Physical Society 2024

18 January 2023 in Quantum Machine Intelligence
Verified
Journal Article
Closed access
PDF file
HZHaimeng Zhao
Haimeng Zhao

9 January 2024 in ACM Transactions on Sensor Networks
Verified
Journal Article
Open access
JLJunyi Liu
Junyi Liu
YTYifu Tang
Yifu Tang
HZHaimeng Zhao
Haimeng Zhao
XWXieheng Wang
Xieheng Wang
FLFangyu Li
Fangyu Li
JZJingyi Zhang
Jingyi Zhang
Cybersecurity breaches are common anomalies for distributed cyber-physical systems (CPS). However, the cyber security breach classification is still a difficult problem, even using cutting-edge artificial intelligence (AI) approaches. In this article, we study a multi-class classification problem in cyber security for attack detection. A challenging multi-node data-censoring case is considered. In such a case, data within each data center/node cannot be shared while the local data is incomplete. Particularly, local nodes contain only a part of the multiple classes. In order to train a global multi-class classifier without sharing the raw data across all nodes, we design a multi-node multi-class classification ensemble approach which is the main result of our study. By gathering the estimated parameters of the binary classifiers and data densities from each local node, the missing information for each local node is completed to build the global multi-class classifier. Numerical experiments are given to validate the effectiveness of the proposed approach under the multi-node data-censoring case. Under such a case, we even show the out-performance of the proposed approach over the full-data approach.

29 July 2025 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
HZHaimeng Zhao
Haimeng Zhao
DDDong-Ling Deng
Dong-Ling Deng
Quantum computing holds unparalleled potentials to enhance machine learning. However, a demonstration of quantum learning advantage has not been achieved so far. We make a step forward by rigorously establishing a noise-robust, unconditional quantum learning advantage in expressivity, inference speed, and training efficiency, compared to commonly-used classical models. Our proof is information-theoretic and pinpoints the origin of this advantage: entanglement can be used to reduce the communication required by non-local tasks. In particular, we design a task that can be solved with certainty by quantum models with a constant number of parameters using entanglement, whereas commonly-used classical models must scale linearly to achieve a larger-than-exponentially-small accuracy. We show that the quantum model is trainable with constant resources and robust against constant noise. Through numerical and trapped-ion experiments on IonQ Aria, we demonstrate the desired advantage. Our results provide valuable guidance for demonstrating quantum learning advantages with current noisy intermediate-scale devices.

14 October 2022 in The Astronomical Journal
Verified
Journal Article
Open access
HAHaimeng海萌Zhao赵
Haimeng海萌Zhao赵
WEWei伟Zhu祝
Wei伟Zhu祝
The modeling of binary microlensing light curves via the standard sampling-based method can be challenging, because of the time-consuming light-curve computation and the pathological likelihood landscape in the high-dimensional parameter space. In this work, we present MAGIC, which is a machine-learning framework to efficiently and accurately infer the microlensing parameters of binary events with realistic data quality. In MAGIC, binary microlensing parameters are divided into two groups and inferred separately with different neural networks. The key feature of MAGIC is the introduction of a neural controlled differential equation, which provides the capability to handle light curves with irregular sampling and large data gaps. Based on simulated light curves, we show that MAGIC can achieve fractional uncertainties of a few percent on the binary mass ratio and separation. We also test MAGIC on a real microlensing event. MAGIC is able to locate degenerate solutions even when large data gaps are introduced. As irregular samplings are common in astronomical surveys, our method also has implications for other studies that involve time series.

25 October 2018 in Journal of Spatial Science
Verified
Journal Article
Closed access
HZHaimeng Zhao
Haimeng Zhao
Bin YangBin Yang
Bin Yang
QWQiang WANG
Qiang WANG
YWYi Wu
Yi Wu
SSShanlin Sun
Shanlin Sun
In this paper, we propose a modified model which takes the variation of leaf orientation in zenithal space into consideration. It is special because of the linkage between the parameterization of leaf inclination angle and polarized reflectance modelling. The modified model is compared to the Rondeaux-Herman model, the Nadal-Bréon model and a one-parametric linear model using remotely sensed polarized data which was obtained by the Research Scanning Polarimeter (RSP) over Oklahoma on 16 September 2005. The comparison suggests the modified model accurately captures the polarized reflectance of dense vegetation and works more precisely than the other models.