arXiv subjects

Hao Liang

Publications and source records attributed to Hao Liang.

At least 181 records · Page 10Linked to original sources

arXiv2021

Implementation of a 46-node quantum metropolitan area network

Quantum key distribution (QKD) enables secure key exchanges between two remote users. The ultimate goal of secure communication is to establish a global quantum network. The existing field tests suggest that quantum networks are feasible. To achieve a practical quantum network, we need to overcome several challenges, including realising versatile topologies for large scales, simple network maintenance, extendable configuration, and robustness to node failures. To this end, we present a field operation of a quantum metropolitan-area network with 46 nodes and show that all these challenges can be overcome with cutting-edge quantum technologies. In particular, we realise different topological structures and continuously run the network for 31 months, by employing standard equipment for network maintenance with an extendable configuration. We realise QKD pairing and key management with a sophisticated key control center. In this implementation, the final keys have been used for secure communication such as real-time voice telephone, text messaging, and file transmission with one-time pad encryption, which can support 11 pairs of users to make audio calls simultaneously. Combined with inter-city quantum backbone and ground-satellite links, our metropolitan implementation paves the way toward a global quantum network.

quant-ph↗

arXiv2021

Controlled AutoEncoders to Generate Faces from Voices

Multiple studies in the past have shown that there is a strong correlation between human vocal characteristics and facial features. However, existing approaches generate faces simply from voice, without exploring the set of features that contribute to these observed correlations. A computational methodology to explore this can be devised by rephrasing the question to: "how much would a target face have to change in order to be perceived as the originator of a source voice?" With this in perspective, we propose a framework to morph a target face in response to a given voice in a way that facial features are implicitly guided by learned voice-face correlation in this paper. Our framework includes a guided autoencoder that converts one face to another, controlled by a unique model-conditioning component called a gating controller which modifies the reconstructed face based on input voice recordings. We evaluate the framework on VoxCelab and VGGFace datasets through human subjects and face retrieval. Various experiments demonstrate the effectiveness of our proposed model.

cs.CV↗

arXiv2020

Discrete representations of finitely generated groups into ${\rm PSL}(2,\mathbb{R})$

We prove a factorization theorem for Fuchsian groups similar to those proved by Agol and Liu for 3-manifold groups. As an application, we build Makanin-Razborov diagrams, which parametrize the collection of all discrete representations from an arbitrary but fixed finitely generated group $G$ to ${\rm PSL}(2, \mathbb{R})$. We define a new class of groups called ${\rm PSL}(2, \mathbb{R})$-discrete limit groups and then use the factorization theorem to obtain useful information about this class of groups.

math.GR↗

arXiv2020

Derivative over Wasserstein spaces along curves of densities

In this paper, given any random variable $ξ$ defined over a probability space $(Ω,\mathcal{F},Q)$, we focus on the study of the derivative of functions of the form $L\mapsto F_Q(L):=f\big((LQ)_ξ\big),$ defined over the convex cone of densities $L\in\mathcal{L}^Q:=\{ L\in L^1(Ω,\mathcal{F},Q;\mathbb{R}_+):\ E^Q[L]=1\}$ in $L^1(Ω,\mathcal{F},Q).$ Here $f$ is a function over the space $\mathcal{P}(\mathbb{R}^d)$ of probability laws over $\mathbb{R}^d$ endowed with its Borel $σ$-field $\mathcal{B}(\mathbb{R}^d)$. The problem of the differentiability of functions $F_Q$ of the above form has its origin in the study of mean-field control problems for which the controlled dynamics admit only weak solutions. Inspired by P.-L. Lions' results [18] we show that, if for given $L\in\mathcal{L}^Q$, $L'\mapsto F_{LQ}(L'):\mathcal{L}^{LQ}\rightarrow\mathbb{R}$ is differentiable at $L'=1$, the derivative is of the form $g(ξ)$, where $g:\mathbb{R}^d\rightarrow\mathbb{R}$ is a Borel function which depends on $(Q,L,ξ)$ only through the law $(LQ)_ξ$. Denoting this derivative by $\partial_1F((LQ)_ξ,x):=g(x),\, x\in\mathbb{R}^d$, we study its properties, and we relate it to partial derivatives, recently investigated in [6], and, moreover, in the case when $f$ restricted to the 2-Wasserstein space $\mathcal{P}_2(\mathbb{R}^d)$ is differentiable in P.-L. Lions' sense and $(LQ)_ξ\in\mathcal{P}_2(\mathbb{R}^d)$, we investigate the relation between the derivative with respect to the density of $F_Q(L)=f\big((LQ)_ξ\big)$ and the derivative of $f$ with respect to the probability measure. Our main result here shows that $\partial_x\partial_1F((LQ)_ξ,x)=\partial_μf((LQ)_ξ,x),\ x\in \mathbb{R}^d,$ where $\partial_μf((LQ)_ξ,x)$ denotes the derivative of $f:\mathcal{P}_2(\mathbb{R}^d)\rightarrow \mathbb{R}$ at $(LQ)_ξ$.

math.PR↗

arXiv2020

Scalable Light-Weight Integration of FPGA Based Accelerators with Chip Multi-Processors

Modern multicore systems are migrating from homogeneous systems to heterogeneous systems with accelerator-based computing in order to overcome the barriers of performance and power walls. In this trend, FPGA-based accelerators are becoming increasingly attractive, due to their excellent flexibility and low design cost. In this paper, we propose the architectural support for efficient interfacing between FPGA-based multi-accelerators and chip-multiprocessors (CMPs) connected through the network-on-chip (NoC). Distributed packet receivers and hierarchical packet senders are designed to maintain scalability and reduce the critical path delay under a heavy task load. A dedicated accelerator chaining mechanism is also proposed to facilitate intra-FPGA data reuse among accelerators to circumvent prohibitive communication overhead between the FPGA and processors. In order to evaluate the proposed architecture, a complete system emulation with programmability support is performed using FPGA prototyping. Experimental results demonstrate that the proposed architecture has high-performance, and is light-weight and scalable in characteristics.

cs.AR↗

arXiv2020

Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimization

In federated optimization, heterogeneity in the clients' local datasets and computation speeds results in large variations in the number of local updates performed by each client in each communication round. Naive weighted aggregation of such models causes objective inconsistency, that is, the global model converges to a stationary point of a mismatched objective function which can be arbitrarily different from the true objective. This paper provides a general framework to analyze the convergence of federated heterogeneous optimization algorithms. It subsumes previously proposed methods such as FedAvg and FedProx and provides the first principled understanding of the solution bias and the convergence slowdown due to objective inconsistency. Using insights from this analysis, we propose FedNova, a normalized averaging method that eliminates objective inconsistency while preserving fast error convergence.

cs.LG↗

arXiv2020

DTCA: Decision Tree-based Co-Attention Networks for Explainable Claim Verification

Recently, many methods discover effective evidence from reliable sources by appropriate neural networks for explainable claim verification, which has been widely recognized. However, in these methods, the discovery process of evidence is nontransparent and unexplained. Simultaneously, the discovered evidence only roughly aims at the interpretability of the whole sequence of claims but insufficient to focus on the false parts of claims. In this paper, we propose a Decision Tree-based Co-Attention model (DTCA) to discover evidence for explainable claim verification. Specifically, we first construct Decision Tree-based Evidence model (DTE) to select comments with high credibility as evidence in a transparent and interpretable way. Then we design Co-attention Self-attention networks (CaSa) to make the selected evidence interact with claims, which is for 1) training DTE to determine the optimal decision thresholds and obtain more powerful evidence; and 2) utilizing the evidence to find the false parts in the claim. Experiments on two public datasets, RumourEval and PHEME, demonstrate that DTCA not only provides explanations for the results of claim verification but also achieves the state-of-the-art performance, boosting the F1-score by 3.11%, 2.41%, respectively.

cs.CL↗

arXiv2020

Overlap Local-SGD: An Algorithmic Approach to Hide Communication Delays in Distributed SGD

Distributed stochastic gradient descent (SGD) is essential for scaling the machine learning algorithms to a large number of computing nodes. However, the infrastructures variability such as high communication delay or random node slowdown greatly impedes the performance of distributed SGD algorithm, especially in a wireless system or sensor networks. In this paper, we propose an algorithmic approach named Overlap-Local-SGD (and its momentum variant) to overlap the communication and computation so as to speedup the distributed training procedure. The approach can help to mitigate the straggler effects as well. We achieve this by adding an anchor model on each node. After multiple local updates, locally trained models will be pulled back towards the synchronized anchor model rather than communicating with others. Experimental results of training a deep neural network on CIFAR-10 dataset demonstrate the effectiveness of Overlap-Local-SGD. We also provide a convergence guarantee for the proposed algorithm under non-convex objective functions.

cs.LG↗

arXiv2019

An Experimentally Verified Approach to non-Entanglement-Breaking Channel Certification

Ensuring the non-entanglement-breaking (non-EB) property of quantum channels is crucial for the effective distribution and storage of quantum states. However, a practical method for direct and accurate certification of the non-EB feature is highly desirable. Here, we propose and verify a realistic source based measurement device independent certification of non-EB channels. Our method is resilient to repercussions on the certification from experimental conditions, such as multiphotons and imperfect state preparation, and can be implemented with information incomplete set. We achieve good agreement between experimental outcomes and theoretical predictions, which is validated by the expected results of the ideal semi-quantum signaling game, and accurately certify the non-EB channels. Furthermore, our approach is highly robust to effects from noise. Therefore, the proposed approach can be expected to play a significant role in the design and evaluation of realistic quantum channels.

quant-ph↗

arXiv2019

Detecting Statistically Significant Communities

Community detection is a key data analysis problem across different fields. During the past decades, numerous algorithms have been proposed to address this issue. However, most work on community detection does not address the issue of statistical significance. Although some research efforts have been made towards mining statistically significant communities, deriving an analytical solution of p-value for one community under the configuration model is still a challenging mission that remains unsolved. The configuration model is a widely used random graph model in community detection, in which the degree of each node is preserved in the generated random networks. To partially fulfill this void, we present a tight upper bound on the p-value of a single community under the configuration model, which can be used for quantifying the statistical significance of each community analytically. Meanwhile, we present a local search method to detect statistically significant communities in an iterative manner. Experimental results demonstrate that our method is comparable with the competing methods on detecting statistically significant communities.

cs.SI↗

arXiv2019

Experimental demonstration of high-rate measurement-device-independent quantum key distribution over asymmetric channels

Measurement-device-independent quantum key distribution (MDI-QKD) can eliminate all detector side channels and it is practical with current technology. Previous implementations of MDI-QKD all use two symmetric channels with similar losses. However, the secret key rate is severely limited when different channels have different losses. Here we report the results of the first high-rate MDI-QKD experiment over $asymmetric$ channels. By using the recent 7-intensity optimization approach, we demonstrate $>$10x higher key rate than previous best-known protocols for MDI-QKD in the situation of large channel asymmetry, and extend the secure transmission distance by more than 20-50 km in standard telecom fiber. The results have moved MDI-QKD towards widespread applications in practical network settings, where the channel losses are asymmetric and user nodes could be dynamically added or deleted.

quant-ph↗

arXiv2019

Correlation-Based Community Detection

Mining community structures from the complex network is an important problem across a variety of fields. Many existing community detection methods detect communities through optimizing a community evaluation function. However, most of these functions even have high values on random graphs and may fail to detect small communities in the large-scale network (the so-called resolution limit problem). In this paper, we introduce two novel node-centric community evaluation functions by connecting correlation analysis with community detection. We will further show that the correlation analysis can provide a novel theoretical framework which unifies some existing evaluation functions in the context of a correlation-based optimization problem. In this framework, we can mitigate the resolution limit problem and eliminate the influence of random fluctuations by selecting the right correlation function. Furthermore, we introduce three key properties used in mining association rule into the context of community detection to help us choose the appropriate correlation function. Based on our introduced correlation functions, we propose a community detection algorithm called CBCD. Our proposed algorithm outperforms existing state-of-the-art algorithms on both synthetic benchmark networks and real-world networks.

cs.SI↗

arXiv2019

Precision Higgs Physics at CEPC

The discovery of the Higgs boson with its mass around 125 GeV by the ATLAS and CMS Collaborations marked the beginning of a new era in high energy physics. The Higgs boson will be the subject of extensive studies of the ongoing LHC program. At the same time, lepton collider based Higgs factories have been proposed as a possible next step beyond the LHC, with its main goal to precisely measure the properties of the Higgs boson and probe potential new physics associated with the Higgs boson. The Circular Electron Positron Collider~(CEPC) is one of such proposed Higgs factories. The CEPC is an $e^+e^-$ circular collider proposed by and to be hosted in China. Located in a tunnel of approximately 100~km in circumference, it will operate at a center-of-mass energy of 240~GeV as the Higgs factory. In this paper, we present the first estimates on the precision of the Higgs boson property measurements achievable at the CEPC and discuss implications of these measurements.

hep-ex↗

arXiv2018

Michelson Interferometry of High-order Harmonic Generation in Solids

For the high-order harmonic generation in solids, we find a distinct and clean interference pattern in the high-energy end of the spectrum which can be interpreted as a Michelson interferometer of the Bloch electron. Our results are achieved by a numerical solution to the time-dependent Schrödinger equation of the quasi-electron in solids and can be explained by an analytical model based on the principle of the Michelson interferometry. The present study deepens our understanding of the HHG mechanism in crystalline materials and may find potential applications in imaging of the dispersion relation or topological structure of the energy bands in solids.

physics.atom-ph↗

arXiv2018

Photon-momentum transfer in diatomic molecules: an ab initio study

For a molecule, the two-center interference and the molecular scattering phase of the electron are important for almost all the processes that may occur in a laser field. In this study, we investigate their effects in the transfer of linear photon momentum to the ionized electron by absorbing a single photon. The time-dependent Schrödinger equation of H$_2^+$ is numerically solved in {the multipolar} gauge in which the electric quadrupole term and the magnetic dipole term are explicitly expressed. This allows us to separate the contributions of the two terms in the momentum transfer. For different configurations of the molecular and the laser orientation, the transferred momentum to the electron is evaluated at different internuclear distances with various photon energies { and two-center interferences are identified in the whole region. At small electron energies and small internuclear distances, we find significant deviations from the prediction of the classical double-slit model due to the strong mediation of the Coulomb potential.} Finally, even for a large internuclear distance, our results show that a varying molecular scattering phase is important at all electron energies, which is beyond the simple prediction of the linear combination of the atomical orbitals.

physics.atom-ph↗

arXiv2018

Nondipole effects in atomic dynamic interference

Nondipole effects in the atomic dynamic interference are investigated by numerically solving the time-dependent Schrödinger equation~(TDSE) of hydrogen. It is found that the inclusion of nondipole corrections in the TDSE can induce momentum shifts of photoelectrons in the opposite direction of the laser propagation. The magnitude of the momentum shift is roughly proportional to the laser peak intensity and to the momentum component of the photoelectron along the laser propagation. By including the nondipole corrections of the Volkov phase into a semi-analytical model previously developed under the dipole approximation, all the main features of the momentum shifts can be nicely reproduced. Through an analytic expression, the origin of such momentum shifts is attributed to the nondipole phase difference between the two electron wave packets ejected in the rising edge and the falling edge, which will interfere with each other and result in the final fringe pattern. One important consequence of such momentum shifts is that they can smooth out the peak splitting induced by the dynamic interference in the photoelectron energy spectrum. Nevertheless, it should be emphasized that the dynamic interference persists in the photoelectron momentum distributions and is not suppressed at all for the laser parameters considered in this work.

physics.atom-ph↗

arXiv2018

Design of Voltage Pulse Control Module for Free Space Measurement-Device-Independent Quantum Key Distribution

Measurement-Device-Independent Quantum Key Distribution (MDIQKD) protocol has been proved that it is unaffected by all hacking attacks, and ensures the security of information theory even when the performance of single-photon detectors is not ideal. Fiber channel has been used by the previous MDIQKD experimental device. However, the signal attenuation increases exponentially as the transmission distance increases. In order to overcome this, we regard free space as the channel of signal transmission, and the signal attenuation increases square as the transmission distance increases (regardless of the atmospheric scattering), which can effectively reduce the signal attenuation trend. In order to implement the free space MDIQKD experiments, a modulation module is needed to modulate the wide pulse chopping, decoy-state, normalization, phase encoding and time encoding. In this paper, we present the design of the Voltage Pulse Control Module for the free space MDIQKD.

eess.SP↗

arXiv2018

Design of 32-channel TDC Based on Single FPGA for μSR Spectrometer at CSNS

Muon Spin Rotation, Relaxation and Resonance (μSR) technology has an irreplaceable role in studying the microstructure and properties of materials, especially micro-magnetic properties. An experimental muon source is being built in China Spallation Neutron Source (CSNS) now. At the same time, a 128-channel μSR spectrometer as China's first μSR spectrometer is being developed. The time spectrum of μSR can be obtained by fitting the curve of positron count rate with time. This paper presents a 32-channel Time-to-Digital Converter (TDC) implemented in a Xilinx Virtex-6 Field Programmable Gate Array (FPGA) for measuring the positron's flight time of μSR Spectrometer. Signal of each channel is sampled by 16 equidistant shifted-phase 200 MHz sampling clocks, so the TDC bin size is 312.5ps. The measuring range is up to 327us. This TDC has the ability to store multiple hit signals in a short time with a deep hit-buffer up to 512. Time tag is added to each data to record the moment when the data was detected. Programmable time window and channel shielding give the flexibility to choose the time range and channels of interest. The delay of each channel can be calibrated. The data is transmitted to data acquisition system (DAQ) through Gigabit Ethernet. TDC and control logic are configured in real time by DAQ. The results of test show that the Full Width at Half Maximum (FWHM) precision of single channel is better than 273 ps with a low sensitivity to temperature and the linearity is pretty well.

physics.ins-det↗