Search arXiv⌕ Search

arXiv subjects

Jun Zhang

Publications and source records attributed to Jun Zhang.

At least 847 records · Page 47Linked to original sources

18.8 Gbps real-time quantum random number generator with a photonic integrated chip

Quantum random number generators (QRNGs) can produce true random numbers. Yet, the two most important QRNG parameters highly desired for practical applications, i.e., speed and size, have to be compromised during implementations. Here, we present the fastest and miniaturized QRNG with a record real-time output rate as high as 18.8 Gbps by combining a photonic integrated chip and the technology of optimized randomness extraction. We assemble the photonic integrated circuit designed for vacuum state QRNG implementation, InGaAs homodyne detector and high-bandwidth transimpedance amplifier into a single chip using hybrid packaging, which exhibits the excellent characteristics of integration and high-frequency response. With a sample rate of 2.5 GSa/s in a 10-bit analog-to-digital converter and subsequent paralleled postprocessing in a field programmable gate array, the QRNG outputs ultrafast random bitstreams via a fiber optic transceiver, whose real-time speed is validated in a personal computer.

quant-ph↗

Privacy Inference Attacks and Defenses in Cloud-based Deep Neural Network: A Survey

Deep Neural Network (DNN), one of the most powerful machine learning algorithms, is increasingly leveraged to overcome the bottleneck of effectively exploring and analyzing massive data to boost advanced scientific development. It is not a surprise that cloud computing providers offer the cloud-based DNN as an out-of-the-box service. Though there are some benefits from the cloud-based DNN, the interaction mechanism among two or multiple entities in the cloud inevitably induces new privacy risks. This survey presents the most recent findings of privacy attacks and defenses appeared in cloud-based neural network services. We systematically and thoroughly review privacy attacks and defenses in the pipeline of cloud-based DNN service, i.e., data manipulation, training, and prediction. In particular, a new theory, called cloud-based ML privacy game, is extracted from the recently published literature to provide a deep understanding of state-of-the-art research. Finally, the challenges and future work are presented to help researchers to continue to push forward the competitions between privacy attackers and defenders.

cs.CR↗

Hamiltonian knottedness and lifting paths from the shape invariant

The Hamiltonian shape invariant of a domain $X \subset \mathbb R^4$, as a subset of $\mathbb R^2$, describes the product Lagrangian tori which may be embedded in $X$. We provide necessary and sufficient conditions to determine whether or not a path in the shape invariant can lift, that is, be realized as a smooth family of embedded Lagrangian tori, when $X$ is a basic $4$-dimensional toric domain such as a ball $B^4(R)$, an ellipsoid $E(a,b)$ with $\frac{b}{a} \in {\mathbb N}_{\geq 2}$, or a polydisk $P(c,d)$. As applications, via the path lifting, we can detect knotted embeddings of product Lagrangian tori in many toric $X$. We also obtain novel obstructions to symplectic embeddings between domains that are more general than toric concave or toric convex.

math.SG↗

Measurement-Device-Independent Verification of a Quantum Memory

In this paper we report an experiment that verifies an atomic-ensemble quantum memory via a measurement-device-independent scheme. A single photon generated via Rydberg blockade in one atomic ensemble is stored in another atomic ensemble via electromagnetically induced transparency. After storage for a long duration, this photon is retrieved and interfered with a second photon to perform joint Bell-state measurement (BSM). Quantum state for each photon is chosen based on a quantum random number generator respectively in each run. By evaluating correlations between the random states and BSM results, we certify that our memory is genuinely entanglement-preserving.

quant-ph↗

Communication-Efficient Federated Learning with Dual-Side Low-Rank Compression

Federated learning (FL) is a promising and powerful approach for training deep learning models without sharing the raw data of clients. During the training process of FL, the central server and distributed clients need to exchange a vast amount of model information periodically. To address the challenge of communication-intensive training, we propose a new training method, referred to as federated learning with dual-side low-rank compression (FedDLR), where the deep learning model is compressed via low-rank approximations at both the server and client sides. The proposed FedDLR not only reduces the communication overhead during the training stage but also directly generates a compact model to speed up the inference process. We shall provide convergence analysis, investigate the influence of the key parameters, and empirically show that FedDLR outperforms the state-of-the-art solutions in terms of both the communication and computation efficiency.

cs.LG↗

Triangulation and persistence: Algebra 101

This paper lays the foundations of triangulated persistence categories (TPC), which brings together persistence modules with the theory of triangulated categories. As a result we introduce several measurements and metrics on the set of objects of some triangulated categories. We also provide examples of TPCs coming from algebra, algebraic topology, microlocal sheaf theory and symplectic topology.

math.AT↗

Affine-modeled video extraction from a single motion blurred image

A motion-blurred image is the temporal average of multiple sharp frames over the exposure time. Recovering these sharp video frames from a single blurred image is nontrivial, due to not only its strong ill-posedness, but also various types of complex motion in reality such as rotation and motion in depth. In this work, we report a generalized video extraction method using the affine motion modeling, enabling to tackle multiple types of complex motion and their mixing. In its workflow, the moving objects are first segemented in the alpha channel. This allows separate recovery of different objects with different motion. Then, we reduce the variable space by modeling each video clip as a series of affine transformations of a reference frame, and introduce the $l0$-norm total variation regularization to attenuate the ringing artifact. The differentiable affine operators are employed to realize gradient-descent optimization of the affine model, which follows a novel coarse-to-fine strategy to further reduce artifacts. As a result, both the affine parameters and sharp reference image are retrieved. They are finally input into stepwise affine transformation to recover the sharp video frames. The stepwise retrieval maintains the nature to bypass the frame order ambiguity. Experiments on both public datasets and real captured data validate the state-of-the-art performance of the reported technique.

cs.CV↗

Large-scale phase retrieval

High-throughput computational imaging requires efficient processing algorithms to retrieve multi-dimensional and multi-scale information. In computational phase imaging, phase retrieval (PR) is required to reconstruct both amplitude and phase in complex space from intensity-only measurements. The existing PR algorithms suffer from the tradeoff among low computational complexity, robustness to measurement noise and strong generalization on different modalities. In this work, we report an efficient large-scale phase retrieval technique termed as LPR. It extends the plug-and-play generalized-alternating-projection framework from real space to nonlinear complex space. The alternating projection solver and enhancing neural network are respectively derived to tackle the measurement formation and statistical prior regularization. This framework compensates the shortcomings of each operator, so as to realize high-fidelity phase retrieval with low computational complexity and strong generalization. We applied the technique for a series of computational phase imaging modalities including coherent diffraction imaging, coded diffraction pattern imaging, and Fourier ptychographic microscopy. Extensive simulations and experiments validate that the technique outperforms the existing PR algorithms with as much as 17dB enhancement on signal-to-noise ratio, and more than one order-of-magnitude increased running efficiency. Besides, we for the first time demonstrate ultra-large-scale phase retrieval at the 8K level (7680$\times$4320 pixels) in minute-level time.

eess.IV↗

Decentralized Statistical Inference with Unrolled Graph Neural Networks

In this paper, we investigate the decentralized statistical inference problem, where a network of agents cooperatively recover a (structured) vector from private noisy samples without centralized coordination. Existing optimization-based algorithms suffer from issues of model mismatch and poor convergence speed, and thus their performance would be degraded, provided that the number of communication rounds is limited. This motivates us to propose a learning-based framework, which unrolls well-noted decentralized optimization algorithms (e.g., Prox-DGD and PG-EXTRA) into graph neural networks (GNNs). By minimizing the recovery error via end-to-end training, this learning-based framework resolves the model mismatch issue. Our convergence analysis (with PG-EXTRA as the base algorithm) reveals that the learned model parameters may accelerate the convergence and reduce the recovery error to a large extent. The simulation results demonstrate that the proposed GNN-based learning methods prominently outperform several state-of-the-art optimization-based algorithms in convergence speed and recovery error.

cs.LG↗

A Deep Neural Network Surrogate Modeling Benchmark for Temperature Field Prediction of Heat Source Layout

Thermal issue is of great importance during layout design of heat source components in systems engineering, especially for high functional-density products. Thermal analysis generally needs complex simulation, which leads to an unaffordable computational burden to layout optimization as it iteratively evaluates different schemes. Surrogate modeling is an effective way to alleviate computation complexity. However, temperature field prediction (TFP) with complex heat source layout (HSL) input is an ultra-high dimensional nonlinear regression problem, which brings great difficulty to traditional regression models. The Deep neural network (DNN) regression method is a feasible way for its good approximation performance. However, it faces great challenges in both data preparation for sample diversity and uniformity in the layout space with physical constraints, and proper DNN model selection and training for good generality, which necessitates efforts of both layout designer and DNN experts. To advance this cross-domain research, this paper proposes a DNN based HSL-TFP surrogate modeling task benchmark. With consideration for engineering applicability, sample generation, dataset evaluation, DNN model, and surrogate performance metrics, are thoroughly studied. Experiments are conducted with ten representative state-of-the-art DNN models. Detailed discussion on baseline results is provided and future prospects are analyzed for DNN based HSL-TFP tasks.

cs.LG↗

Large System Achievable Rate Analysis of RIS-Assisted MIMO Wireless Communication with Statistical CSIT

Reconfigurable intelligent surface (RIS) is an emerging technology to enhance wireless communication in terms of energy cost and system performance by equipping a considerable quantity of nearly passive reflecting elements. This study focuses on a downlink RIS-assisted multiple-input multiple-output (MIMO) wireless communication system that comprises three communication links of Rician channel, including base station (BS) to RIS, RIS to user, and BS to user. The objective is to design an optimal transmit covariance matrix at BS and diagonal phase-shifting matrix at RIS to maximize the achievable ergodic rate by exploiting the statistical channel state information at BS. Therefore, a large-system approximation of the achievable ergodic rate is derived using the replica method in large dimension random matrix theory. This large-system approximation enables the identification of asymptotic-optimal transmit covariance and diagonal phase-shifting matrices using an alternating optimization algorithm. Simulation results show that the large-system results are consistent with the achievable ergodic rate calculated by Monte Carlo averaging. The results verify that the proposed algorithm can significantly enhance the RIS-assisted MIMO system performance.

cs.IT↗

Reconstructing 3D Magnetic Topology of On-disk Prominence Bubbles from Stereoscopic Observations

Bubbles, the semi-circular voids below quiescent prominences (filaments), have been extensively investigated in the past decade. However, hitherto the magnetic nature of bubbles cannot be verified due to the lack of on-disk photospheric magnetic field observations. Here for the first time, we find and investigate an on-disk prominence bubble around a filament barb on 2019 March 18 based on stereoscopic observations from NVST, SDO, and STEREO-A. In high-resolution NVST H$α$ images, this bubble has a sharp arch-like boundary and a projected width of $\thicksim$26 Mm. Combining SDO and STEREO-A images, we further reconstruct 3D structure of the bubble boundary, whose maximum height is $\thicksim$15.6 Mm. The squashing factor Q map deduced from extrapolated 3D magnetic fields around the bubble depicts a distinct arch-shaped interface with a height of $\thicksim$11 Mm, which agrees well with the reconstructed 3D structure of the observed bubble boundary. Under the interface lies a set of magnetic loops, which is rooted on a surrounding photospheric magnetic patch. To be more persuasive, another on-disk bubble on 2019 June 10 is presented as a supplement. According to these results obtained from on-disk bubble observations, we suggest that the bubble boundary corresponds to the interface between the prominence dips (barb) and the underlying magnetic loops rooted nearby. It is thus reasonable to speculate that the bubble can form around a filament barb below which there is a photospheric magnetic patch.

astro-ph.SR↗

Single-photon imaging over 200 km

Long-range active imaging has widespread applications in remote sensing and target recognition. Single-photon light detection and ranging (lidar) has been shown to have high sensitivity and temporal resolution. On the application front, however, the operating range of practical single-photon lidar systems is limited to about tens of kilometers over the Earth's atmosphere, mainly due to the weak echo signal mixed with high background noise. Here, we present a compact coaxial single-photon lidar system capable of realizing 3D imaging at up to 201.5 km. It is achieved by using high-efficiency optical devices for collection and detection, and what we believe is a new noise-suppression technique that is efficient for long-range applications. We show that photon-efficient computational algorithms enable accurate 3D imaging over hundreds of kilometers with as few as 0.44 signal photons per pixel. The results represent a significant step toward practical, low-power lidar over extra-long ranges.

eess.IV↗

Towards a Bias-Free Selection Function in Shear Measurement

Sample selection is a necessary preparation for weak lensing measurement. It is well-known that selection itself may introduce bias in the measured shear signal. Using image simulation and the Fourier_Quad shear measurement pipeline, we quantify the selection bias in various commonly used selection function (signal-to-noise-ratio, magnitude, etc.). We proposed a new selection function defined in the power spectrum of the galaxy image. This new selection function has low selection bias, and it is particularly convenient for shear measurement pipelines based on Fourier transformation.

astro-ph.CO↗

s-d coupling enhanced phonon anharmonicity in copper-based compounds

Materials with ultralow thermal conductivity are of great interest for efficient energy conversion and thermal barrier coating. Copper-based semiconductors such as copper chalcogenides and copper halides are known to possess extreme low thermal conductivity, whereas the fundamental origin of the low thermal conductivity observed in the copper-based materials remains elusive. Here, we reveal that s-d coupling induced giant phonon anharmonicity is the fundamental mechanism responsible for the ultralow thermal conductivity of copper compounds. The symmetry controlled strong coupling of high-lying occupied copper 3d orbital with the unoccupied 4s state under thermal vibration remarkably lowers the lattice potential barrier, which enhances anharmonic scattering between phonons. This understanding is confirmed by temperature-dependent Raman spectra measurements. Our study offers an insight at atomic level connecting electronic structures with phonon vibration modes, and thus sheds light on materials properties that rely on electron-phonon coupling, such as thermoelectricity and superconductivity.

cond-mat.mtrl-sci↗

Supporting More Active Users for Massive Access via Data-assisted Activity Detection

Massive machine-type communication (mMTC) has been regarded as one of the most important use scenarios in the fifth generation (5G) and beyond wireless networks, which demands scalable access for a large number of devices. While grant-free random access has emerged as a promising mechanism for massive access, its potential has not been fully unleashed. Particularly, the two key tasks in massive access systems, namely, user activity detection and data detection, were handled separately in most existing studies, which ignored the common sparsity pattern in the received pilot and data signal. Moreover, error detection and correction in the payload data provide additional mechanisms for performance improvement. In this paper, we propose a data-assisted activity detection framework, which aims at supporting more active users by reducing the activity detection error, consisting of false alarm and missed detection errors. Specifically, after an initial activity detection step based on the pilot symbols, the false alarm users are filtered by applying energy detection for the data symbols; once data symbols of some active users have been successfully decoded, their effect in activity detection will be resolved via successive pilot interference cancellation, which reduces the missed detection error. Simulation results show that the proposed algorithm effectively increases the activity detection accuracy, and it is able to support $\sim 20\%$ more active users compared to a conventional method in some sample scenarios.

eess.SP↗

Experimental Realization of Device-Independent Quantum Randomness Expansion

Randomness expansion where one generates a longer sequence of random numbers from a short one is viable in quantum mechanics but not allowed classically. Device-independent quantum randomness expansion provides a randomness resource of the highest security level. Here, we report the first experimental realization of device-independent quantum randomness expansion secure against quantum side information established through quantum probability estimation. We generate $5.47\times10^8$ quantum-proof random bits while consuming $4.39\times10^8$ bits of entropy, expanding our store of randomness by $1.08\times10^8$ bits at a latency of about $13.1$ h, with a total soundness error $4.6\times10^{-10}$. Device-independent quantum randomness expansion not only enriches our understanding of randomness but also sets a solid base to bring quantum-certifiable random bits into realistic applications.

quant-ph↗

Symplectic structure perturbations and continuity of symplectic invariants

This paper studies how symplectic invariants created from Hamiltonian Floer theory change under the perturbations of symplectic structures, not necessarily in the same cohomology class. These symplectic invariants include spectral invariants, boundary depth, and (partial) symplectic quasi-states. This paper can split into two parts. In the first part, we prove some energy estimations that control the shifts of symplectic action functionals. These directly imply positive conclusions on the continuity of spectral invariants and boundary depth, in some important cases including any symplectic surface $Σ_{g \geq1}$ and any closed symplectic manifold $M$ with $\dim_{\mathcal K} H^2(M; \mathcal K) = 1$. This follows by applications on some rigidity of the subsets of a symplectic manifold in terms of heaviness and superheaviness, as well as on the continuity property of some symplectic capacities. In the second part, we generalize the construction in the first part to any closed symplectic manifold. In particular, to deal with the change of Novikov rings from symplectic structure perturbations, we construct a family of variant Floer chain complexes over a common Novikov-type ring. In this set-up, we define a new family of spectral invariants called $t$-spectral invariants, and prove that they are upper semicontinuous under the symplectic structure perturbations. This implies a quasi-isometric embedding from $(\mathbb R^{\infty}, |-|_{\infty})$ to $({\widetilde {\rm Ham}}(M, ω), |-|_{\rm Hofer})$ under some dynamical assumption, imitating a result from Usher.

math.SG↗