arXiv subjects

Zhu Cao

Publications and source records attributed to Zhu Cao.

41 records · Page 3Linked to original sources

arXiv2015

Loss-tolerant measurement-device-independent quantum random number generation

Quantum random number generators (QRNGs) output genuine random numbers based upon the uncertainty principle. A QRNG contains two parts in general --- a randomness source and a readout detector. How to remove detector imperfections has been one of the most important questions in practical randomness generation. We propose a simple solution, measurement-device-independent QRNG, which not only removes all detector side channels but is robust against losses. In contrast to previous fully device-independent QRNGs, our scheme does not require high detector efficiency or nonlocality tests. Simulations show that our protocol can be implemented efficiently with a practical coherent state laser and other standard optical components. The security analysis of our QRNG consists mainly of two parts: measurement tomography and randomness quantification, where several new techniques are developed to characterize the randomness associated with a positive-operator valued measure.

quant-ph↗

arXiv2015

Experimental Passive Round-Robin Differential Phase-Shift Quantum Key Distribution

In quantum key distribution (QKD), the bit error rate is used to estimate the information leakage and hence determines the amount of privacy amplification --- making the final key private by shortening the key. In general, there exists a threshold of the error rate for each scheme, above which no secure key can be generated. This threshold puts a restriction on the environment noises. For example, a widely used QKD protocol --- BB84 --- cannot tolerate error rates beyond 25%. A new protocol, round-robin differential phase shifted (RRDPS) QKD, essentially removes this restriction and can in principle tolerate more environment disturbance. Here, we propose and experimentally demonstrate a passive RRDPS QKD scheme. In particular, our 500 MHz passive RRDPS QKD system is able to generate a secure key over 50 km with a bit error rate as high as 29%. This scheme should find its applications in noisy environment conditions.

quant-ph↗

arXiv2015

Discrete-phase-randomized coherent state source and its application in quantum key distribution

Coherent state photon sources are widely used in quantum information processing. In many applications, such as quantum key distribution (QKD), a coherent state is functioned as a mixture of Fock states by assuming its phase is continuously randomized. In practice, such a crucial assumption is often not satisfied and, therefore, the security of existing QKD experiments is not guaranteed. To bridge this gap, we provide a rigorous security proof of QKD with discrete-phase-randomized coherent state sources. Our results show that the performance of the discrete-phase randomization case is close to its continuous counterpart with only a small number (say, 10) of discrete phases. Comparing to the conventional continuous phase randomization case, where an infinite amount of random bits are required, our result shows that only a small amount (say, 4 bits) of randomness is needed.

quant-ph↗

arXiv2014

Randomness Requirement on CHSH Bell Test in the Multiple Run Scenario

The Clauser-Horne-Shimony-Holt inequality test is widely used as a mean of invalidating the local deterministic theories and a tool of device independent quantum cryptographic tasks. There exists a randomness (freewill) loophole in the test, which is widely believed impossible to be closed perfectly. That is, certain random inputs are required for the test. Following a randomness quantification method used in literature, we investigate the randomness required in the test under various assumptions. By comparing the results, one can conclude that the key to make the test result reliable is to rule out correlations between multiple runs.

quant-ph↗

arXiv2010

Integer Matrix Exact Covering Systems and Product Identities for Theta Functions

In this paper, we prove that there is a natural correspondence between product identities for theta functions and integer matrix exact covering systems. We show that since $\mathbb{Z}^n$ can be taken as the disjoint union of a lattice generated by $n$ linearly independent vectors in $\mathbb{Z}^n$ and a finite number of its translates, certain products of theta functions can be written as linear combinations of other products of theta functions. We firstly give a general theorem to write a product of $n$ theta functions as a linear combination of other products of theta functions. Many known identities for products of theta functions are shown to be special cases of our main theorem. Several entries in Ramanujan's notebooks as well as new identities are proved as applications, including theorems for products of three and four theta functions that have not been obtained by other methods.

math.NT↗