Searcharxiv⌕ Search

arXiv subjects

Yuan Cao

Publications and source records attributed to Yuan Cao.

243 records · Page 14Linked to original sources

On a class of $(δ+αu^2)$-constacyclic codes over $\mathbb{F}_{q}[u]/\langle u^4\rangle$

Let $\mathbb{F}_{q}$ be a finite field of cardinality $q$, $R=\mathbb{F}_{q}[u]/\langle u^4\rangle=\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}+u^3\mathbb{F}_{q}$ $(u^4=0)$ which is a finite chain ring, and $n$ be a positive integer satisfying ${\rm gcd}(q,n)=1$. For any $δ,α\in \mathbb{F}_{q}^{\times}$, an explicit representation for all distinct $(δ+αu^2)$-constacyclic codes over $R$ of length $n$ is given, and the dual code for each of these codes is determined. For the case of $q=2^m$ and $δ=1$, all self-dual $(1+αu^2)$-constacyclic codes over $R$ of odd length $n$ are provided.

cs.IT↗

Training Conditional Random Fields with Natural Gradient Descent

We propose a novel parameter estimation procedure that works efficiently for conditional random fields (CRF). This algorithm is an extension to the maximum likelihood estimation (MLE), using loss functions defined by Bregman divergences which measure the proximity between the model expectation and the empirical mean of the feature vectors. This leads to a flexible training framework from which multiple update strategies can be derived using natural gradient descent (NGD). We carefully choose the convex function inducing the Bregman divergence so that the types of updates are reduced, while making the optimization procedure more effective by transforming the gradients of the log-likelihood loss function. The derived algorithms are very simple and can be easily implemented on top of the existing stochastic gradient descent (SGD) optimization procedure, yet it is very effective as illustrated by experimental results.

cs.LG↗

Local and Global Inference for High Dimensional Nonparanormal Graphical Models

This paper proposes a unified framework to quantify local and global inferential uncertainty for high dimensional nonparanormal graphical models. In particular, we consider the problems of testing the presence of a single edge and constructing a uniform confidence subgraph. Due to the presence of unknown marginal transformations, we propose a pseudo likelihood based inferential approach. In sharp contrast to the existing high dimensional score test method, our method is free of tuning parameters given an initial estimator, and extends the scope of the existing likelihood based inferential framework. Furthermore, we propose a U-statistic multiplier bootstrap method to construct the confidence subgraph. We show that the constructed subgraph is contained in the true graph with probability greater than a given nominal level. Compared with existing methods for constructing confidence subgraphs, our method does not rely on Gaussian or sub-Gaussian assumptions. The theoretical properties of the proposed inferential methods are verified by thorough numerical experiments and real data analysis.

stat.ML↗

Experimental round-robin differential phase-shift quantum key distribution

In conventional quantum key distribution (QKD) protocols, security is guaranteed by estimating the amount of leaked information through monitoring signal disturbance, which, in practice, is generally caused by environmental noise and device imperfections rather than eavesdropping. Such estimation therefore tends to overrate the amount of leaked information in practice, leads to a fundamental threshold of the bit error rate. The threshold becomes a bottleneck of the development of practical QKD systems. In classical communication, according to Shannon's communication theory, information can transform through a noisy channel even if the background noise is very strong compare to the signal and hence the threshold of the bit error rate tends to 50%. One might wonder whether a QKD scheme can also tolerate error rate as high as 50%. The question is answered affirmatively with the recent work of round-robin differential phase-shift (RRDPS) protocol, which breaks through the fundamental threshold of the bit error rate and indicates another potential direction in the field of quantum cryptography. The key challenge to realize the RRDPS scheme lies on the measurement device, which requires a variable-delay interferometer. The delay needs to be chosen from a set of predetermined values randomly. Such measurement can be realized by switching between many interferometers with different delays at a high speed in accordance with the system repetition rate. The more delay values can be chosen from, the higher error rate can be tolerated. By designing an optical system with multiple switches and employing an active phase stabilization technology, we successfully construct a variable-delay interferometer with 128 actively selectable delays. With this measurement, we experimentally demonstrate the RRDPS QKD protocol and obtain a final key rate of 15.54 bps via a total loss of 18 dB and 8.9% error rate.

quant-ph↗

Entanglement-based quantum key distribution with biased basis choice via free space

We report a free-space entanglement-based quantum key distribution experiment, implementing the biased basis protocol between two sites which are 15.3 km apart. Photon pairs from a polarization-entangled source are distributed through two 7.8-km free-space optical links. An optimal bias 20:80 between the X and Z basis is used. A post-processing scheme with finite-key analysis is applied to extract the final secure key. After three-hour continuous operation at night, a 4293-bit secure key is obtained, with a final key rate of 0.124 bit per raw key bit which increases the final key rate by 14.8% comparing to the standard BB84 case. Our results experimentally demonstrate that the efficient BB84 protocol, which increases key generation efficiency by biasing Alice and Bob's basis choices, is potentially useful for the ground-satellite quantum communication.

quant-ph↗

Experimental unconditionally secure bit commitment

Bit commitment is a fundamental cryptographic task that guarantees a secure commitment between two mutually mistrustful parties and is a building block for many cryptographic primitives, including coin tossing, zero-knowledge proofs, oblivious transfer and secure two-party computation. Unconditionally secure bit commitment was thought to be impossible until recent theoretical protocols that combine quantum mechanics and relativity were shown to elude previous impossibility proofs. Here we implement such a bit commitment protocol. In the experiment, the committer performs quantum measurements using two quantum key distribution systems and the results are transmitted via free-space optical communication to two agents separated with more than 20 km. The security of the protocol relies on the properties of quantum information and relativity theory. We show that, in each run of the experiment, a bit is successfully committed with less than 5.68*10^-2 cheating probability. Our result demonstrates unconditionally secure bit commitment and the experimental feasibility of relativistic quantum communication.

quant-ph↗

Bounding the speed of `spooky action at a distance'

In the well-known EPR paper, Einstein et al. called the nonlocal correlation in quantum entanglement as `spooky action at a distance'. If the spooky action does exist, what is its speed? All previous experiments along this direction have locality loopholes and thus can be explained without having to invoke any `spooky action' at all. Here, we strictly closed the locality loopholes by observing a 12-hour continuous violation of Bell inequality and concluded that the lower bound speed of `spooky action' was four orders of magnitude of the speed of light if the Earth's speed in any inertial reference frame was less than 10^(-3) times of the speed of light.

quant-ph↗

Experimental Single-Photon Transmission from Satellite to Earth

Free-space quantum communication with satellites opens a promising avenue for global secure quantum network and large-scale test of quantum foundations. Recently, numerous experimental efforts have been carried out towards this ambitious goal. However, one essential step - transmitting single photons from the satellite to the ground with high signal-to-noise ratio (SNR) at realistic environments - remains experimental challenging. Here, we report a direct experimental demonstration of the satellite-ground transmission of a quasi-single-photon source. In the experiment, single photons (~0.85 photon per pulse) are generated by reflecting weak laser pulses back to earth with a cube-corner retro-reflector on the satellite Champ, collected by a 600-mm diameter telescope at the ground station, and finally detected by single-photon counting modules (SPCMs) after 400-km free-space link transmission. With the help of high accuracy time synchronization, narrow receiver field-of-view (FOV) and high-repetition-rate pulses (76 MHz), a SNR of better than 16:1 is obtained, which is sufficient for a secure quantum key distribution. Our experimental results represent an important step towards satellite-ground quantum communication.

quant-ph↗

Quantum teleportation and entanglement distribution over 100-kilometre free-space channels

A long standing goal for quantum communication is to transfer a quantum state over arbitrary distances. Free-space quantum communication provides a promising solution towards this challenging goal. Here, through a 97-km free space channel, we demonstrate long distance quantum teleportation over a 35-53 dB loss one-link channel, and entanglement distribution over a 66-85 dB high-loss two-link channel. We achieve an average fidelity of {80.4(9)}% for teleporting six distinct initial states and observe the violation of the Clauser-Horne-Shimony-Holt inequality after distributing entanglement. Besides being of fundamental interest, our result represents a significant step towards a global quantum network. Moreover, the high-frequency and high-accuracy acquiring, pointing and tracking technique developed in our experiment provides an essential tool for future satellite-based quantum communication.

quant-ph↗