Searcharxiv⌕ Search

arXiv subjects

Weijie Wu

Publications and source records attributed to Weijie Wu.

43 records · Page 3Linked to original sources

Symmetry-protected privacy: beating the rate-distance linear bound over a noisy channel

There are two main factors limiting the performance of quantum key distribution --- channel transmission loss and noise. Previously, a linear bound was believed to put an upper limit on the rate-transmittance performance. Remarkably, the recently proposed twin-field and phase-matching quantum key distribution schemes have been proven to overcome the linear bound. In practice, due to the intractable phase fluctuation of optical signals in transmission, these schemes suffer from large error rates, which renders the experimental realization extremely challenging. Here, we close this gap by proving the security based on a different principle --- encoding symmetry. With the symmetry-based security proof, we can decouple the privacy from the channel disturbance, and eventually remove the limitation of secure key distribution on bit error rates. That is, the phase-matching scheme can yield positive key rates even with high bit error rates up to 50%. In simulation, with typical experimental parameters, the key rate is able to break the linear bound with an error rate of 13%. Meanwhile, we provide a finite-data size analysis for the scheme, which can break the bound with a reasonable data size of $10^{12}$. Encouraged by high loss- and error-tolerance, we expect the approach based on symmetry-protected privacy will provide a new insight to the security of quantum key distribution.

quant-ph↗

Surpassing the rate-transmittance linear bound of quantum key distribution

Quantum key distribution (QKD offers a long-term solution to establish information-theoretically secure keys between two distant users. In practice, with a careful characterization of quantum sources and the decoy-state method, measure-device-independent quantum key distribution (MDI-QKD) provides secure key distribution. While short-distance fibre-based QKD has already been available for real-life implementation, the bottleneck of practical QKD lies on the limited transmission distance. Due to photon losses in transmission, it was believed that the key generation rate is bounded by a linear function of the channel transmittance, $O(η)$, without a quantum repeater, which puts an upper bound on the maximal secure transmission distance. Interestingly, a new phase-encoding MDI-QKD scheme, named twin-field QKD, has been suggested to beat the linear bound, while another variant, named phase-matching quantum key distribution (PM-QKD), has been proven to have a quadratic key-rate improvement, $O(\sqrtη)$. In reality, however, the intrinsic optical mode mismatch of independent lasers, accompanied by phase fluctuation and drift, impedes the successful experimental implementation of the new schemes. Here, we solve this problem with the assistance of the laser injection technique and the phase post-compensation method. In the experiment, the key rate surpasses the linear key-rate bound via 302 km and 402 km commercial-fibre channels, achieving a key rate over 4 orders of magnitude higher than the existing results in literature. Furthermore, with a 502 km ultralow-loss fibre, our system yields a secret key rate of 0.118 bps. We expect this new type of QKD schemes to become a new standard for future QKD.

quant-ph↗

Weak-value amplification forWeyl-point separation in momentum space

The existence of Weyl nodes in the momentum space is a hallmark of a Weyl semimetal (WSM). A WSM can be confirmed by observing its Fermi arcs with separated Weyl nodes. In this paper, we study the spin- orbit interaction of light on the surface of WSM in the limit that the thickness is ultra-thin and the incident surface does not support Fermi arc. Our results show that the spin-dependent splitting induced by the spin-orbit interaction is related to the separation of Weyl nodes. By proposing an amplification technique called weak measurements, the distance of the nodes can be precisely determined. This system may have application in characterizing other parameters of WSM.

cond-mat.mes-hall↗

Giant quantized Goos-Hänchen effect on the surface of graphene in quantum Hall regime

We theoretically predict a giant quantized Goos-Hänchen (GH) effect on the surface of graphene in quantum Hall regime. The giant quantized GH effect manifests itself as an angular shift whose quantized step reaches the order of mrad for light beams impinging on a graphene-on-substrate system. The quantized GH effect can be attributed to quantized Hall conductivity, which corresponds to the discrete Landau levels in quantum Hall regime. We find that the quantized step can be greatly enhanced for incident angles near the Brewster angle. Moreover, the Brewster angle is sensitive to the Hall conductivity, and therefore the quantized GH effect can be modulated by the Fermi energy and the external magnetic field. The giant quantized GH effect offers a convenient way to determine the quantized Hall conductivity and the discrete Landau levels by a direct optical measurement.

physics.optics↗

A Unified Framework for Information Consumption Based on Markov Chains

This paper establishes a Markov chain model as a unified framework for understanding information consumption processes in complex networks, with clear implications to the Internet and big-data technologies. In particular, the proposed model is the first one to address the formation mechanism of the "trichotomy" in observed probability density functions from empirical data of various social and technical networks. Both simulation and experimental results demonstrate a good match of the proposed model with real datasets, showing its superiority over the classical power-law models.

cs.SI↗

Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods

A fundamental class of matrix optimization problems that arise in many areas of science and engineering is that of quadratic optimization with orthogonality constraints. Such problems can be solved using line-search methods on the Stiefel manifold, which are known to converge globally under mild conditions. To determine the convergence rate of these methods, we give an explicit estimate of the exponent in a Lojasiewicz inequality for the (non-convex) set of critical points of the aforementioned class of problems. By combining such an estimate with known arguments, we are able to establish the linear convergence of a large class of line-search methods. A key step in our proof is to establish a local error bound for the set of critical points, which may be of independent interest.

math.OC↗

A model for semantic integration of business components

Today, reusable components are available in several repositories. These last are certainly conceived for the reusing However, this re-use is not immediate; it requires, in the fact, to pass through some essential conceptual operations, among them in particular, research, integration, adaptation, and composition. We are interested in the present work to the problem of semantic integration of heterogeneous Business Components. This problem is often put in syntactical terms, while the real stake is of semantic order. Our contribution concerns a model proposal for Business components integration as well as resolution method of semantic naming conflicts, met during the integration of Business Components.

cs.SE↗