Yanbao Zhang

Yanbao Zhang


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
28 January 2021 in Nature Physics
Verified
Journal Article
Closed access
PDF file
LSLynden K. Shalm
Lynden K. Shalm
YZYanbao Zhang
Yanbao Zhang
JBJoshua C. Bienfang
Joshua C. Bienfang
CSCollin Schlager
Collin Schlager
MSMartin J. Stevens
Martin J. Stevens
EKEmanuel Knill
Emanuel Knill

7 January 2020 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
YZYanbao Zhang
Yanbao Zhang
LSLynden K. Shalm
Lynden K. Shalm
JBJoshua C. Bienfang
Joshua C. Bienfang
MSMartin J. Stevens
Martin J. Stevens
MMMichael D. Mazurek
Michael D. Mazurek
EKEmanuel Knill
Emanuel Knill
Applications of randomness such as private key generation and public randomness beacons require small blocks of certified random bits on demand. Device-independent quantum random number generators can produce such random bits, but existing quantum-proof protocols and loophole-free implementations suffer from high latency, requiring many hours to produce any random bits. We demonstrate device-independent quantum randomness generation from a loophole-free Bell test with a more efficient quantum-proof protocol, obtaining multiple blocks of 512 random bits with an average experiment time of less than 5 min per block and with a certified error bounded by 2−64≈5.42×10−20.

25 January 2021 in Physical Review Research
Verified
Journal Article
Open access
PDF file
YZYanbao Zhang
Yanbao Zhang
PCPatrick J. Coles
Patrick J. Coles
AWAdam Winick
Adam Winick
JLJie Lin
Jie Lin
NLNorbert Lütkenhaus
Norbert Lütkenhaus
Quantum key distribution (QKD) protocols with threshold detectors are driving high-performance QKD demonstrations. The corresponding security proofs usually assume that all physical detectors have the same detection efficiency. However, the efficiencies of the detectors used in practice might show a mismatch depending on the manufacturing and setup of these detectors. A mismatch can also be induced as the different spatial-temporal modes of an incoming signal might couple differently to a detector. Here we develop a method that allows to provide security proofs without the usual assumption. Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary. Especially, we do not rely on any photon-number cutoff of incoming signals such that our security proof is directly applicable to practical situations. We illustrate our method for a receiver that is designed for polarization encoding and is sensitive to a number of spatial-temporal modes. In our detector model, the absence of quantum interference between any pair of spatial-temporal modes is assumed. For a QKD protocol with this detector model, we can perform a security proof with characterized efficiency mismatch and without photon-number cutoff assumption. Our method also shows that in the absence of efficiency mismatch in our detector model, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control, as compared to the view where for a security proof this loss is attributed to the action of the adversary.

7 January 2020 in Physical Review Research
Verified
Journal Article
Open access
PDF file
YZYanbao Zhang
Yanbao Zhang
HFHonghao Fu
Honghao Fu
EKEmanuel Knill
Emanuel Knill
For practical applications of quantum randomness generation, it is important to certify and further produce a fixed block of fresh random bits with as few trials as possible. Consequently, protocols with high finite-data efficiency are preferred. To yield such protocols with respect to quantum side information, we develop quantum probability estimation. Our approach is applicable to device-independent as well as device-dependent scenarios, and it generalizes techniques from previous works [Miller and Shi, SIAM J. Comput. 46, 1304 (2017); Arnon-Friedman et al., Nat. Commun. 9, 459 (2018)]. Quantum probability estimation can adapt to changing experimental conditions, allows stopping the experiment as soon as the prespecified randomness goal is achieved, and can tolerate imperfect knowledge of the input distribution. Moreover, the randomness rate achieved at constant error is asymptotically optimal. For the device-independent scenario, our approach certifies the amount of randomness available in experimental results without first searching for relations between randomness and violations of fixed Bell inequalities. We implement quantum probability estimation for device-independent randomness generation in the CHSH Bell-test configuration, and we show significant improvements in finite-data efficiency, particularly at small Bell violations which are typical in current photonic loophole-free Bell tests.

31 October 2018 in Physical Review A
Verified
Journal Article
Open access
PDF file
YZYanbao Zhang
Yanbao Zhang
EKEmanuel Knill
Emanuel Knill
PBPeter Bierhorst
Peter Bierhorst
We introduce probability estimation, a broadly applicable framework to certify randomness in a finite sequence of measurements subject to verifiable physical constraints and with respect to classical side information. Examples include randomness from single-photon measurements and device-independent randomness from Bell tests. Advantages of probability estimation include unproblematic early stopping when goals are achieved, optimal randomness rates, applicability to Bell tests with small violations, and unsurpassed finite-data efficiency. We greatly reduce latencies for producing random bits and formulate an associated rate-tradeoff problem of independent interest. We also show that the latency is determined by an information-theoretic measure of nonlocality rather than the Bell violation.

24 February 2021 in Nature Communications
Verified
Journal Article
Open access
PDF file
YZYanbao Zhang
Yanbao Zhang
HLHsin-Pin Lo
Hsin-Pin Lo
AMAlan Mink
Alan Mink
TITakuya Ikuta
Takuya Ikuta
THToshimori Honjo
Toshimori Honjo
WMWilliam J. Munro
William J. Munro
Quantum random numbers distinguish themselves from others by their intrinsic unpredictability arising from the principles of quantum mechanics. As such they are extremely useful in many scientific and real-world applications with considerable efforts going into their realizations. Most demonstrations focus on high asymptotic generation rates. For this goal, a large number of repeated trials are required to accumulate a significant store of certifiable randomness, resulting in a high latency between the initial request and the delivery of the requested random bits. Here we demonstrate low-latency real-time certifiable randomness generation from measurements on photonic time-bin states. For this, we develop methods to certify randomness taking into account adversarial imperfections in both the state preparation and the measurement apparatus. Every 0.12 s we generate a block of 8192 random bits which are certifiable against all quantum adversaries with an error bounded by 2−64. Our quantum random number generator is thus well suited for realizing a continuously-operating, high-security and high-speed quantum randomness beacon.