Qi Zhao

Prof. Qi Zhao


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
7 October 2019 in Quantum
Verified
Journal Article
Open access
XYXiao Yuan
Xiao Yuan
SESuguru Endo
Suguru Endo
QZQi Zhao
Qi Zhao
YLYing Li
Ying Li
SBSimon C. Benjamin
Simon C. Benjamin
The variational method is a versatile tool for classical simulation of a variety of quantum systems. Great efforts have recently been devoted to its extension to quantum computing for efficiently solving static many-body problems and simulating real and imaginary time dynamics. In this work, we first review the conventional variational principles, including the Rayleigh-Ritz method for solving static problems, and the Dirac and Frenkel variational principle, the McLachlan's variational principle, and the time-dependent variational principle, for simulating real time dynamics. We focus on the simulation of dynamics and discuss the connections of the three variational principles. Previous works mainly focus on the unitary evolution of pure states. In this work, we introduce variational quantum simulation of mixed states under general stochastic evolution. We show how the results can be reduced to the pure state case with a correction term that takes accounts of global phase alignment. For variational simulation of imaginary time evolution, we also extend it to the mixed state scenario and discuss variational Gibbs state preparation. We further elaborate on the design of ansatz that is compatible with post-selection measurement and the implementation of the generalised variational algorithms with quantum circuits. Our work completes the theory of variational quantum simulation of general real and imaginary time evolution and it is applicable to near-term quantum hardware.

19 September 2018 in Nature
Verified
Journal Article
Closed access
PDF file
YLYang Liu
Yang Liu
QZQi Zhao
Qi Zhao
MLMing-Han Li
Ming-Han Li
JGJian-Yu Guan
Jian-Yu Guan
YZYanbao Zhang
Yanbao Zhang
JPJian-Wei Pan
Jian-Wei Pan

4 March 2016 in Physical Review X
Verified
Journal Article
Open access
PDF file
YTYan-Lin Tang
Yan-Lin Tang
Hua-Lei YinHua-Lei Yin
Hua-Lei Yin
QZQi Zhao
Qi Zhao
HLHui Liu
Hui Liu
XSXiang-Xiang Sun
Xiang-Xiang Sun
JPJian-Wei Pan
Jian-Wei Pan
Quantum cryptography holds the promise to establish an information-theoretically secure global network. All field tests of metropolitan-scale quantum networks to date are based on trusted relays. The security critically relies on the accountability of the trusted relays, which will break down if the relay is dishonest or compromised. Here, we construct a measurement-device-independent quantum key distribution (MDIQKD) network in a star topology over a 200-square-kilometer metropolitan area, which is secure against untrustful relays and against all detection attacks. In the field test, our system continuously runs through one week with a secure key rate 10 times larger than previous results. Our results demonstrate that the MDIQKD network, combining the best of both worlds—security and practicality, constitutes an appealing solution to secure metropolitan communications.

27 January 2017 in Physical Review A
Verified
Journal Article
Closed access
PDF file
ZZZhen Zhang
Zhen Zhang
QZQi Zhao
Qi Zhao
Mohsen RazaviMohsen Razavi
Mohsen Razavi
XMXiongfeng Ma
Xiongfeng Ma
The decoy-state scheme is the most widely implemented quantum-key-distribution protocol in practice. In order to account for the finite-size key effects on the achievable secret key generation rate, a rigorous statistical fluctuation analysis is required. Originally, a heuristic Gaussian-approximation technique was used for this purpose, which, despite its analytical convenience, was not sufficiently rigorous. The fluctuation analysis has recently been made rigorous by using the Chernoff bound. There is a considerable gap, however, between the key-rate bounds obtained from these techniques and that obtained from the Gaussian assumption. Here we develop a tighter bound for the decoy-state method, which yields a smaller failure probability. This improvement results in a higher key rate and increases the maximum distance over which secure key exchange is possible. By optimizing the system parameters, our simulation results show that our method almost closes the gap between the two previously proposed techniques and achieves a performance similar to that of conventional Gaussian approximations.

3 January 2018 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
YLYang Liu
Yang Liu
XYXiao Yuan
Xiao Yuan
MLMing-Han Li
Ming-Han Li
WZWeijun Zhang
Weijun Zhang
QZQi Zhao
Qi Zhao
JPJian-Wei Pan
Jian-Wei Pan
Quantum mechanics provides the means of generating genuine randomness that is impossible with deterministic classical processes. Remarkably, the unpredictability of randomness can be certified in a manner that is independent of implementation devices. Here, we present an experimental study of device-independent quantum random number generation based on a detection-loophole-free Bell test with entangled photons. In the randomness analysis, without the independent identical distribution assumption, we consider the worst case scenario that the adversary launches the most powerful attacks against the quantum adversary. After considering statistical fluctuations and applying an 80  Gb×45.6  Mb Toeplitz matrix hashing, we achieve a final random bit rate of 114  bits/s, with a failure probability less than 10−5. This marks a critical step towards realistic applications in cryptography and fundamental physics tests.

20 July 2021 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
XYXiao Yuan
Xiao Yuan
JSJinzhao Sun
Jinzhao Sun
JLJunyu Liu
Junyu Liu
QZQi Zhao
Qi Zhao
YZYou Zhou
You Zhou
Tensor network theory and quantum simulation are, respectively, the key classical and quantum computing methods in understanding quantum many-body physics. Here, we introduce the framework of hybrid tensor networks with building blocks consisting of measurable quantum states and classically contractable tensors, inheriting both their distinct features in efficient representation of many-body wave functions. With the example of hybrid tree tensor networks, we demonstrate efficient quantum simulation using a quantum computer whose size is significantly smaller than the one of the target system. We numerically benchmark our method for finding the ground state of 1D and 2D spin systems of up to 8×8 and 9×8 qubits with operations only acting on 8+1 and 9+1 qubits, respectively. Our approach sheds light on simulation of large practical problems with intermediate-scale quantum computers, with potential applications in chemistry, quantum many-body physics, quantum field theory, and quantum gravity thought experiments.