Catalog footprint

What is connected

84works
23topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

84 published item(s)

preprint2026arXiv

ITGPT: Generative Pretraining on Irregular Timeseries

Timeseries regression models often struggle to leverage large volumes of labeled multimodal data, particularly when the data are irregularly sampled or contain missing values. This is common in domains like healthcare and predictive maintenance, where data are collected from unreliable sources, and labeling requires expert knowledge or costly equipments. Transformer-based large language models have proven effective on structured data such as text through self-supervised learning (SSL) and generative pretraining (GPT) frameworks. However, such models lack the flexibility to efficiently process irregularly sampled multimodal timeseries data. In this paper, we introduce ITGPT, an attention-based architecture designed for handling multimodal, irregularly sampled timeseries by allowing training with both SSL losses and GPT-like objectives. We evaluate its performance on a healthcare task with the TIHM dataset, and a predictive maintenance task with the CompX dataset. Our results demonstrate that ITGPT achieves state-of-the-art performance without requiring resampling, feature fusion or explicit data imputation. Furthermore, when labels are scarce, ITGPT effectively leverages unlabeled data through SSL and GPT training, outperforming the purely supervised approach. This represents an important step towards efficiently using large and unstructured timeseries datasets for practical inference tasks.

preprint2026arXiv

Land-then-transport: A Flow Matching-Based Generative Decoder for Wireless Image Transmission

Due to strict rate and reliability demands, wireless image transmission remains difficult for both classical layered designs and joint source-channel coding (JSCC), especially under low latency. Diffusion-based generative decoders can deliver strong perceptual quality by leveraging learned image priors, but iterative stochastic denoising leads to high decoding delay. To enable low-latency decoding, we propose a flow-matching (FM) generative decoder under a new land-then-transport (LTT) paradigm that tightly integrates the physical wireless channel into a continuous-time probability flow. For AWGN channels, we build a Gaussian smoothing path whose noise schedule indexes effective noise levels, and derive a closed-form teacher velocity field along this path. A neural-network student vector field is trained by conditional flow matching, yielding a deterministic, channel-aware ODE decoder with complexity linear in the number of ODE steps. At inference, it only needs an estimate of the effective noise variance to set the ODE starting time. We further show that Rayleigh fading and MIMO channels can be mapped, via linear MMSE equalization and singular-value-domain processing, to AWGN-equivalent channels with calibrated starting times. Therefore, the same probability path and trained velocity field can be reused for Rayleigh and MIMO without retraining. Experiments on MNIST, Fashion-MNIST, and DIV2K over AWGN, Rayleigh, and MIMO demonstrate consistent gains over JPEG2000+LDPC, DeepJSCC, and diffusion-based baselines, while achieving good perceptual quality with only a few ODE steps. Overall, LTT provides a deterministic, physically interpretable, and computation-efficient framework for generative wireless image decoding across diverse channels.

preprint2023arXiv

Predicting the structural colors of films of disordered photonic balls

Photonic balls are spheres tens of micrometers in diameter containing assemblies of nanoparticles or nanopores with a spacing comparable to the wavelength of light. When these nanoscale features are disordered, but still correlated, the photonic balls can show structural color with low angle-dependence. Their colors, combined with the ability to add them to a liquid formulation, make photonic balls a promising new type of pigment particle for paints, coatings, and other applications. However, it is challenging to predict the color of materials made from photonic balls, because the sphere geometry and multiple scattering must be accounted for. To address these challenges, we develop a multiscale modeling approach involving Monte Carlo simulations of multiple scattering at two different scales: we simulate multiple scattering and absorption within a photonic ball and then use the results to simulate multiple scattering and absorption in a film of photonic balls. After validating against experimental spectra, we use the model to show that films of photonic balls scatter light in fundamentally different ways than do homogeneous films of nanopores or nanoparticles, because of their increased surface area and refraction at the interfaces of the balls. Both effects tend to sharply reduce color saturation relative to a homogeneous nanostructured film. We show that saturated colors can be achieved by placing an absorber directly in the photonic balls and mitigating surface roughness. With these design rules, we show that photonic-ball films have an advantage over homogeneous nanostructured films: their colors are even less dependent on the angle.

preprint2022arXiv

Asynchronous Parallel Incremental Block-Coordinate Descent for Decentralized Machine Learning

Machine learning (ML) is a key technique for big-data-driven modelling and analysis of massive Internet of Things (IoT) based intelligent and ubiquitous computing. For fast-increasing applications and data amounts, distributed learning is a promising emerging paradigm since it is often impractical or inefficient to share/aggregate data to a centralized location from distinct ones. This paper studies the problem of training an ML model over decentralized systems, where data are distributed over many user devices and the learning algorithm run on-device, with the aim of relaxing the burden at a central entity/server. Although gossip-based approaches have been used for this purpose in different use cases, they suffer from high communication costs, especially when the number of devices is large. To mitigate this, incremental-based methods are proposed. We first introduce incremental block-coordinate descent (I-BCD) for the decentralized ML, which can reduce communication costs at the expense of running time. To accelerate the convergence speed, an asynchronous parallel incremental BCD (API-BCD) method is proposed, where multiple devices/agents are active in an asynchronous fashion. We derive convergence properties for the proposed methods. Simulation results also show that our API-BCD method outperforms state of the art in terms of running time and communication costs.

preprint2022arXiv

Clinicopathological correlation of p40/TTF1 co-expression in NSCLC and review of related literature

TTF1 and ΔNp63/p40 have been used to differentiate ADC and SQC in hypofractionated NSCLC because of their sensitivity and specificity. There are few cases where TTF1 and ΔNp63/p40 are expressed together in the same tumour cells, and little is known about the clinicopathological features, treatment and prognosis of such cases. We investigated the electron microscopic features, immunohistochemical expression and molecular variation of a case of TTF1/p40 co-expressing NSCLC and reviewed and summarised the relevant literature. Our patient was a 58-year-old male with a CT showing a left-sided lung occupancy. As in all other cases reported in the literature, the tumour showed a solid growth pattern with polygonal cells, eosinophilic cytoplasm and clearly visible nuclear fission. Immunohistochemistry showed positive for TTF-1, p40, CK5/6, CK7, P63 and p53, and negative for NapsinA and ALK. Electron microscopy showed tumour cells characterised by bidirectional differentiation of adenocytes and squamous cells, consistent with previous reports. Second-generation sequencing suggested co-mutation of STK11/LKB1 and NF1 genes in this case. Mutations in STK11/LKB1 and NF1 genes have been found in ADC and SQC and are often associated with drug resistance and poor prognosis, but STK11/NF1 co-mutation has not been reported and more cases are needed to reveal the association. p40/TTF1 co-expression in NSCLC may be an under-recognised variant of NSCLC The origin may be a double positive stem cell-like basal cell located in the distal airway, with rapid clinical progression and poor prognosis.

preprint2022arXiv

Cooperative Beamforming for RIS-Aided Cell-Free Massive MIMO Networks

The combination of cell-free massive multiple-input multiple-output (CF-mMIMO) and reconfigurable intelligent surface (RIS) is envisioned as a promising paradigm to improve network capacity and enhance coverage capability. However, to reap full benefits of RIS-aided CF-mMIMO, the main challenge is to efficiently design cooperative beamforming (CBF) at base stations (BSs), RISs, and users. Firstly, we investigate the fractional programing to convert the weighted sum-rate (WSR) maximization problem into a tractable optimization problem. Then, the alternating optimization framework is employed to decompose the transformed problem into a sequence of subproblems, i.e., hybrid BF (HBF) at BSs, passive BF at RISs, and combining at users. In particular, the alternating direction method of multipliers algorithm is utilized to solve the HBF subproblem at BSs. Concretely, the analog BF design with unit-modulus constraints is solved by the manifold optimization (MO) while we obtain a closed-form solution to the digital BF design that is essentially a convex least-square problem. Additionally, the passive BF at RISs and the analog combining at users are designed by primal-dual subgradient and MO methods. Moreover, considering heavy communication costs in conventional CF-mMIMO systems, we propose a partially-connected CF-mMIMO (P-CF-mMIMO) framework to decrease the number of connections among BSs and users. To better compromise WSR performance and network costs, we formulate the BS selection problem in the P-CF-mMIMO system as a binary integer quadratic programming (BIQP) problem, and develop a relaxed linear approximation algorithm to handle this BIQP problem. Finally, numerical results demonstrate superiorities of our proposed algorithms over baseline counterparts.

preprint2022arXiv

Kähler-Einstein metrics and obstruction flatness of circle bundles

Obstruction flatness of a strongly pseudoconvex hypersurface $Σ$ in a complex manifold refers to the property that any (local) Kähler-Einstein metric on the pseudoconvex side of $Σ$, complete up to $Σ$, has a potential $-\log u$ such that $u$ is $C^\infty$-smooth up to $Σ$. In general, $u$ has only a finite degree of smoothness up to $Σ$. In this paper, we study obstruction flatness of hypersurfaces $Σ$ that arise as unit circle bundles $S(L)$ of negative Hermitian line bundles $(L, h)$ over Kähler manifolds $(M, g).$ We prove that if $(M,g)$ has constant Ricci eigenvalues, then $S(L)$ is obstruction flat. If, in addition, all these eigenvalues are strictly less than one and $(M,g)$ is complete, then we show that the corresponding disk bundle admits a complete Kähler-Einstein metric. Finally, we give a necessary and sufficient condition for obstruction flatness of $S(L)$ when $(M, g)$ is a Kähler surface $(\dim M=2$) with constant scalar curvature.

preprint2022arXiv

Monitoring AGNs with H$β$ Asymmetry. III. Long-term Reverberation Mapping Results of 15 Palomar-Green Quasars

In this third paper of the series reporting on the reverberation mapping (RM) campaign of active galactic nuclei with asymmetric H$β$ emission-line profiles, we present results for 15 Palomar-Green (PG) quasars using spectra obtained between the end of 2016 to May 2021. This campaign combines long time spans with relatively high cadence. For 8 objects, both the time lags obtained from the entire light curves and the measurements from individual observing seasons are provided. Reverberation mapping of 9 of our targets has been attempted for the first time, while the results for 6 others can be compared with previous campaigns. We measure the H$β$ time lags over periods of years and estimate their black hole masses. The long duration of the campaign enables us to investigate their broad line region (BLR) geometry and kinematics for different years by using velocity-resolved lags, which demonstrate signatures of diverse BLR geometry and kinematics. The BLR geometry and kinematics of individual objects are discussed. In this sample, the BLR kinematics of Keplerian/virialized motion and inflow is more common than outflow.

preprint2022arXiv

Short-Packet Interleaver against Impulse Interference in Practical Industrial Environments

The most common cause of transmission failure in Wireless High Performance (WirelessHP) target industry environments is impulse interference. As interleavers are commonly used to improve the reliability on the Orthogonal Frequency Division Multiplexing (OFDM) symbol level for long packet transmission, this paper considers the feasibility of applying short-packet bit interleaving to enhance the impulse/burst interference resisting capability on both OFDM symbol and frame level. Using the Universal Software Radio Peripherals (USRP) and PC hardware platform, the Packet Error Rate (PER) performance of interleaved coded short-packet transmission with Convolutional Codes (CC), Reed-Solomon codes (RS) and RS+CC concatenated codes are tested and analyzed. Applying the IEEE 1613 standard for impulse interference generation, extensive PER tests of CC(1=2) and RS(31; 21)+CC(1=2) concatenated codes are performed. With practical experiments, we prove the effectiveness of bit in terleaved coded short-packet transmission in real factory environments. We also investigate how PER performance depends on the interleavers, codes and impulse interference power and frequency.

preprint2022arXiv

Spectroastrometry and Reverberation Mapping: the Mass and Geometric Distance of the Supermassive Black Hole in the Quasar 3C 273

The quasar 3C 273 has been observed with infrared spectroastrometry (SA) on broad Pa$α$ line and optical reverberation mapping (RM) on broad H$β$ line. SA delivers information about the angular size and structure of the Pa$α$ broad-line region (BLR), while RM delivers information about the physical size and structure of the H$β$ BLR. Based on the fact that the two BLRs share the mass of the supermassive black hole (SMBH) and viewing inclination, a combination of SA and velocity-resolved RM (SARM) thereby allows us to simultaneously determine the SMBH mass and geometric distance through dynamically modeling the two BLRs. We construct a suite of dynamical models with different geometric configurations and apply a Bayesian approach to obtain the parameter inferences. Overall the obtained masses and distances are insensitive to specific BLR configurations but more or less depend on parameterizations of the vertical distributions. The most probable model, chosen in light of the Bayes factor, yields an angular-size distance of $\log\,(D_{\rm A}/{\rm Mpc}) = 2.83_{-0.28}^{+0.32}$ and SMBH mass of $\log\,(M_\bullet/M_\odot)=9.06_{-0.27}^{+0.21}$, which agrees with the relationships between SMBH masses and bulge properties. The BLRs have an inclination of $5_{-1}^{+1}$ degrees, consistent with that of the large-scale jet in 3C 273. Our approach reinforces the capability of SARM analysis to measure SMBH mass and distance of AGNs even though SA and RM observations are undertaken with different emission lines and/or in different periods.

preprint2020arXiv

Algebraicity of the Bergman Kernel

Our main result introduces a new way to characterize two-dimensional finite ball quotients by algebraicity of their Bergman kernels. This characterization is particular to dimension two and fails in higher dimensions, as is illustrated by a counterexample in dimension three constructed in this paper. As a corollary of our main theorem, we prove, e.g., that a smoothly bounded strictly pseudoconvex domain G in $\mathbb{C}^2$ has rational Bergman kernel if and only if there is a rational biholomorphism from G to the 2-dimensional unit ball.

preprint2020arXiv

Coherent phonon dynamics in spatially separated graphene mechanical resonators

Vibrational modes in mechanical resonators provide a promising candidate to interface and manipulate classical and quantum information. The observation of coherent dynamics between distant mechanical resonators can be a key step towards scalable phonon-based applications. Here we report tunable coherent phonon dynamics with an architecture comprising three graphene mechanical resonators coupled in series, where all resonators can be manipulated by electrical signals on control gates. We demonstrate coherent Rabi oscillations between spatially separated resonators indirectly coupled via an intermediate resonator serving as a phonon cavity. The Rabi frequency fits well with the microwave burst power on the control gate. We also observe Ramsey interference, where the oscillation frequency corresponds to the indirect coupling strength between these resonators. Such coherent processes indicate that information encoded in vibrational modes can be transferred and stored between spatially separated resonators, which can open the venue of on-demand phonon-based information processing.

preprint2020arXiv

Decentralized Beamforming Design for Intelligent Reflecting Surface-enhanced Cell-free Networks

Cell-free networks are considered as a promising distributed network architecture to satisfy the increasing number of users and high rate expectations in beyond-5G systems. However, to further enhance network capacity, an increasing number of high-cost base stations (BSs) are required. To address this problem and inspired by the cost-effective intelligent reflecting surface (IRS) technique, we propose a fully decentralized design framework for cooperative beamforming in IRS-aided cell-free networks. We first transform the centralized weighted sum-rate maximization problem into a tractable consensus optimization problem, and then an incremental alternating direction method of multipliers (ADMM) algorithm is proposed to locally update the beamformer. The complexity and convergence of the proposed method are analyzed, and these results show that the performance of the new scheme can asymptotically approach that of the centralized one as the number of iterations increases. Results also show that IRSs can significantly increase the system sum-rate of cell-free networks and the proposed method outperforms existing decentralized methods.

preprint2020arXiv

Deep Reinforcement Learning Based Spectrum Allocation in Integrated Access and Backhaul Networks

We develop a framework based on deep reinforce-ment learning (DRL) to solve the spectrum allocation problem inthe emerging integrated access and backhaul (IAB) architecturewith large scale deployment and dynamic environment. The avail-able spectrum is divided into several orthogonal sub-channels,and the donor base station (DBS) and all IAB nodes have thesame spectrum resource for allocation, where a DBS utilizes thosesub-channels for access links of associated user equipment (UE)as well as for backhaul links of associated IAB nodes, and anIAB node can utilize all for its associated UEs. This is one ofkey features in which 5G differs from traditional settings wherethe backhaul networks were designed independently from theaccess networks. With the goal of maximizing the sum log-rateof all UE groups, we formulate the spectrum allocation probleminto a mix-integer and non-linear programming. However, itis intractable to find an optimal solution especially when theIAB network is large and time-varying. To tackle this problem,we propose to use the latest DRL method by integrating anactor-critic spectrum allocation (ACSA) scheme and deep neuralnetwork (DNN) to achieve real-time spectrum allocation indifferent scenarios. The proposed methods are evaluated throughnumerical simulations and show promising results compared withsome baseline allocation policies.

preprint2020arXiv

Design and Analysis of Online Fountain Codes for Intermediate Performance

For the benefit of improved intermediate performance, recently online fountain codes attract much research attention. However, there is a trade-off between the intermediate performance and the full recovery overhead for online fountain codes, which prevents them to be improved simultaneously. We analyze this trade-off, and propose to improve both of these two performance. We first propose a method called Online Fountain Codes without Build-up phase (OFCNB) where the degree-1 coded symbols are transmitted at first and the build-up phase is removed to improve the intermediate performance. Then we analyze the performance of OFCNB theoretically. Motivated by the analysis results, we propose Systematic Online Fountain Codes (SOFC) to further reduce the full recovery overhead. Theoretical analysis shows that SOFC has better intermediate performance, and it also requires lower full recovery overhead when the channel erasure rate is lower than a constant. Simulation results verify the analyses and demonstrate the superior performance of OFCNB and SOFC in comparison to other online fountain codes.

preprint2020arXiv

Fully Decentralized Federated Learning Based Beamforming Design for UAV Communications

To handle the data explosion in the era of internet of things (IoT), it is of interest to investigate the decentralized network, with the aim at relaxing the burden to central server along with keeping data privacy. In this work, we develop a fully decentralized federated learning (FL) framework with an inexact stochastic parallel random walk alternating direction method of multipliers (ISPW-ADMM). Performing more communication efficient and enhanced privacy preservation compared with the current state-of-the-art, the proposed ISPW-ADMM can be partially immune to the impacts from time-varying dynamic network and stochastic data collection, while still in fast convergence. Benefits from the stochastic gradients and biased first-order moment estimation, the proposed framework can be applied to any decentralized FL tasks over time-varying graphs. Thus to further demonstrate the practicability of such framework in providing fast convergence, high communication efficiency, and system robustness, we study the extreme learning machine(ELM)-based FL model for robust beamforming (BF) design in UAV communications, as verified by the numerical simulations.

preprint2020arXiv

Improving mobility of silicon metal-oxide-semiconductor devices for quantum dots by high vacuum activation annealing

To improve mobility of fabricated silicon metal-oxide-semiconductor (MOS) quantum devices, forming gas annealing is a common method used to mitigate the effects of disorder at the Si/SiO2 interface. However, the importance of activation annealing is usually ignored. Here, we show that a high vacuum environment for implantation activation is beneficial for improving mobility compared to nitrogen atmosphere. Low-temperature transport measurements of Hall bars show that peak mobility can be improved by a factor of two, reaching 1.5 m^2/(Vs) using high vacuum annealing during implantation activation. Moreover, the charge stability diagram of a single quantum dot is mapped, with no visible disturbance caused by disorder, suggesting possibility of fabricating high-quality quantum dots on commercial wafers. Our results may provide valuable insights into device optimization in silicon-based quantum computing.

preprint2020arXiv

Learning Based Hybrid Beamforming Design for Full-Duplex Millimeter Wave Systems

Millimeter Wave (mmWave) communications with full-duplex (FD) have the potential of increasing the spectral efficiency, relative to those with half-duplex. However, the residual self-interference (SI) from FD and high pathloss inherent to mmWave signals may degrade the system performance. Meanwhile, hybrid beamforming (HBF) is an efficient technology to enhance the channel gain and mitigate interference with reasonable complexity. However, conventional HBF approaches for FD mmWave systems are based on optimization processes, which are either too complex or strongly rely on the quality of channel state information (CSI). We propose two learning schemes to design HBF for FD mmWave systems, i.e., extreme learning machine based HBF (ELM-HBF) and convolutional neural networks based HBF (CNN-HBF). Specifically, we first propose an alternating direction method of multipliers (ADMM) based algorithm to achieve SI cancellation beamforming, and then use a majorization-minimization (MM) based algorithm for joint transmitting and receiving HBF optimization. To train the learning networks, we simulate noisy channels as input, and select the hybrid beamformers calculated by proposed algorithms as targets. Results show that both learning based schemes can provide more robust HBF performance and achieve at least 22.1% higher spectral efficiency compared to orthogonal matching pursuit (OMP) algorithms. Besides, the online prediction time of proposed learning based schemes is almost 20 times faster than the OMP scheme. Furthermore, the training time of ELM-HBF is about 600 times faster than that of CNN-HBF with 64 transmitting and receiving antennas.

preprint2020arXiv

Learning Based Hybrid Beamforming for Millimeter Wave Multi-User MIMO Systems

Hybrid beamforming (HBF) design is a crucial stage in millimeter wave (mmWave) multi-user multi-input multi-output (MU-MIMO) systems. However, conventional HBF methods are still with high complexity and strongly rely on the quality of channel state information. We propose an extreme learning machine (ELM) framework to jointly optimize transmitting and receiving beamformers. Specifically, to provide accurate labels for training, we first propose an factional-programming and majorization-minimization based HBF method (FP-MM-HBF). Then, an ELM based HBF (ELM-HBF) framework is proposed to increase the robustness of beamformers. Both FP-MM-HBF and ELM-HBF can provide higher system sum-rate compared with existing methods. Moreover, ELM-HBF cannot only provide robust HBF performance, but also consume very short computation time.

preprint2020arXiv

Multi-Agent Reinforcement Learning for Cooperative Coded Caching via Homotopy Optimization

Introducing cooperative coded caching into small cell networks is a promising approach to reducing traffic loads. By encoding content via maximum distance separable (MDS) codes, coded fragments can be collectively cached at small-cell base stations (SBSs) to enhance caching efficiency. However, content popularity is usually time-varying and unknown in practice. As a result, cache contents are anticipated to be intelligently updated by taking into account limited caching storage and interactive impacts among SBSs. In response to these challenges, we propose a multi-agent deep reinforcement learning (DRL) framework to intelligently update cache contents in dynamic environments. With the goal of minimizing long-term expected fronthaul traffic loads, we first model dynamic coded caching as a cooperative multi-agent Markov decision process. Owing to MDS coding, the resulting decision-making falls into a class of constrained reinforcement learning problems with continuous decision variables. To deal with this difficulty, we custom-build a novel DRL algorithm by embedding homotopy optimization into a deep deterministic policy gradient formalism. Next, to empower the caching framework with an effective trade-off between complexity and performance, we propose centralized, partially and fully decentralized caching controls by applying the derived DRL approach. Simulation results demonstrate the superior performance of the proposed multi-agent framework.

preprint2020arXiv

On the classification of normal Stein spaces and finite ball quotients with Bergman-Einstein metrics

In this paper, we study the Bergman metric of a finite ball quotient $\mathbb{B}^n/Γ$, where $Γ\subseteq \mathrm{Aut}(\mathbb{B}^n)$ is a finite, fixed point free, abelian group. We prove that this metric is Kähler--Einstein if and only if $Γ$ is trivial, i.e., when the ball quotient $\mathbb{B}^n/Γ$ is the unit ball $\mathbb{B}^n$ itself. As a consequence, we establish a characterization of the unit ball among normal Stein spaces with isolated singularities and abelian fundamental groups in terms of the existence of a Bergman-Einstein metric.

preprint2020arXiv

Traffic-aware Two-stage Queueing Communication Networks: Queue Analysis and Energy Saving

To boost energy saving for the general delay-tolerant IoT networks, a two-stage and single-relay queueing communication scheme is investigated. Concretely, a traffic-aware $N$-threshold and gated-service policy are applied at the relay. As two fundamental and significant performance metrics, the mean waiting time and long-term expected power consumption are explicitly derived and related with the queueing and service parameters, such as packet arrival rate, service threshold and channel statistics. Besides, we take into account the electrical circuit energy consumptions when the relay server and access point (AP) are in different modes and energy costs for mode transitions, whereby the power consumption model is more practical. The expected power minimization problem under the mean waiting time constraint is formulated. Tight closed-form bounds are adopted to obtain tractable analytical formulae with less computational complexity. The optimal energy-saving service threshold that can flexibly adjust to packet arrival rate is determined. In addition, numerical results reveal that: 1) sacrificing the mean waiting time not necessarily facilitates power savings; 2) a higher arrival rate leads to a greater optimal service threshold; and 3) our policy performs better than the current state-of-the-art.

preprint2019arXiv

Active Galactic Nuclei with Ultra-fast Outflows Monitoring Project: The Broad-line Region of Mrk 79 as a Disk Wind

We developed a spectroscopic monitoring project to investigate the kinematics of the broad-line region (BLR) in active galactic nuclei (AGN) with ultra-fast outflows (UFOs). Mrk~79 is a radio-quiet AGN with UFOs and warm absorbers, had been monitored by three reverberation mapping (RM) campaigns, but its BLR kinematics is not understood yet. In this paper, we report the results from a new RM-campaign of Mrk~79, which was undertaken by Lijiang 2.4-m telescope. Mrk~79 is seeming to come out the faint state, the mean flux approximates a magnitude fainter than historical record. We successfully measured the lags of the broad emission lines including H$β~\lambda4861$, H$γ~\lambda4340$, He II $\lambda4686$ and He I $\lambda5876$ with respect to the varying AGN continuum. Based on the broad H$β~\lambda4861$ line, we measured black hole (BH) mass of $M_{\bullet}=5.13^{+1.57}_{-1.55}\times10^{7}M_{\odot}$, estimated accretion rates of ${\dot{M}_{\bullet}}=(0.05\pm0.02)~L_{\rm Edd}~c^{-2}$, indicating that Mrk~79 is a sub-Eddington accretor. We found that Mrk~79 deviates from the canonical Radius$-$Luminosity relationship. The marginal blueshift of the broad He II $\lambda4686$ line detected from rms spectrum indicates outflow of high-ionization gas. The velocity-resolved lag profiles of the broad H$γ~\lambda4340$, H$β~\lambda4861$, and He I $\lambda5876$ lines show similar signatures that the largest lag occurs in the red wing of the lines then the lag decreases to both sides. These signatures should suggest that the BLR of Keplerian motion probably exists the outflow gas motion. All findings including UFOs, warm absorbers, and the kinematics of high- and low-ionization BLR, may provide an indirect evidence that the BLR of Mrk~79 probably originates from disk wind.

preprint2019arXiv

Kinematic signatures of reverberation mapping of close binaries of supermassive black holes in active galactic nuclei. II. Atlas of two-dimensional transfer functions

Most large galaxies harbor supermassive black holes (SMBHs) in their centers, and galaxies merge. Consequently, binary SMBHs should be common in galactic nuclei. However, close binaries of SMBH (CB-SMBHs) with sub-parsec separation cannot be imaged directly using current facilities. Some indirect signatures, such as periodic signals in light curves and double peaks in emission-line profile, have been used to find CB-SMBH candidates, but ambiguities still exist and no definitive conclusions can be made. We have recently proposed a new method focusing on kinematic signatures that can be derived from reverberation mapping of CB-SMBHs, one that offers a promising avenue to address this important problem. In this paper, we calculated models for a wide range of parameters, but BLRs of two BHs are close but still not merged. The purpose of this supplementary paper is to provide an atlas of two-dimensional transfer functions of CB-SMBHs with a wide range of orbital and geometrical parameters to aid more efficient identification of CB-SMBH candidates in reverberation mapping data.

preprint2019arXiv

Semiconductor Quantum Computation

Semiconductors, a significant type of material in the information era, are becoming more and more powerful in the field of quantum information. In the last decades, semiconductor quantum computation was investigated thoroughly across the world and developed with a dramatically fast speed. The researches vary from initialization, control and readout of qubits, to the architecture of fault tolerant quantum computing. Here, we first introduce the basic ideas for quantum computing, and then discuss the developments of single- and two- qubit gate control in semiconductor. Till now, the qubit initialization, control and readout can be realized with relatively high fidelity and a programmable two-qubit quantum processor was even demonstrated. However, to further improve the qubit quality and scale it up, there are still some challenges to resolve such as the improvement of readout method, material development and scalable designs. We discuss these issues and introduce the forefronts of progress. Finally, considering the positive trend of the research on semiconductor quantum devices and recent theoretical work on the applications of quantum computation, we anticipate that semiconductor quantum computation may develop fast and will have a huge impact on our lives in the near future.

preprint2018arXiv

Strong indirect coupling between graphene-based mechanical resonators via a phonon cavity

Mechanical resonators are promising systems for storing and manipulating information. To transfer information between mechanical modes, either direct coupling or an interface between these modes is needed. In previous works, strong coupling between different modes in a single mechanical resonator and direct interaction between neighboring mechanical resonators have been demonstrated. However, coupling between distant mechanical resonators, which is a crucial request for long-distance classical and quantum information processing using mechanical devices, remains an experimental challenge. Here, we report the experimental observation of strong indirect coupling between separated mechanical resonators in a graphene-based electromechanical system. The coupling is mediated by a far-off-resonant phonon cavity through virtual excitations via a Raman-like process. By controlling the resonant frequency of the phonon cavity, the indirect coupling can be tuned in a wide range. Our results may lead to the development of gate-controlled all-mechanical devices and open up the possibility of long-distance quantum mechanical experiments.

preprint2017arXiv

A tunable hybrid qubit in a triple quantum dot

We experimentally demonstrate quantum coherent dynamics of a triple-dot-based multi-electron hybrid qubit. Pulsed experiments show that this system can be conveniently initialized, controlled, and measured electrically, and has good coherence time as compared to gate time. Furthermore, the current multi-electron hybrid qubit has an operation frequency that is tunable in a wide range, from 2 to about 15 GHz. We provide qualitative understandings of the experimental observations by mapping it onto a three-electron system, and compare it with the double dot hybrid qubit and the all-exchange triple-dot qubit.

preprint2017arXiv

Quantum dot behavior in transition metal dichalcogenides nanostructures

Recently, transition metal dichalcogenides (TMDCs) semiconductors have been utilized for investigating quantum phenomena because of their unique band structures and novel electronic properties. In a quantum dot (QD), electrons are confined in all lateral dimensions, offering the possibility for detailed investigation and controlled manipulation of individual quantum systems. Beyond the definition of graphene QDs by opening an energy gap in nanoconstrictions, with the presence of a bandgap, gate-defined QDs can be achieved on TMDCs semiconductors. In this paper, we review the confinement and transport of QDs in TMDCs nanostructures. The fabrication techniques for demonstrating two-dimensional (2D) materials nanostructures such as field-effect transistors and QDs, mainly based on e-beam lithography and transfer assembly techniques are discussed. Subsequently, we focus on transport through TMDCs nanostructures and QDs. With steady improvement in nanoscale materials characterization and using graphene as a springboard, 2D materials offer a platform that allows creation of heterostructure QDs integrated with a variety of crystals, each of which has entirely unique physical properties.

preprint2016arXiv

Analysis of Multi-Hop Outdoor 60 GHz Wireless Networks with Full-Duplex Buffered Relays

The abundance of unlicensed spectrum in the 60 GHz band makes it an attractive alternative for future wireless communication systems. Such systems are expected to provide data transmission rates in the order of multi-gigabits per second in order to satisfy the ever-increasing demand for high rate data communication. Unfortunately, 60 GHz radio is subject to severe path loss which limits its usability for long-range outdoor communication. In this work, we propose a multi-hop 60 GHz wireless network for outdoor communication where multiple full-duplex buffered relays are used to extend the communication range while providing end-to-end performance guarantees to the traffic traversing the network. We provide a cumulative service process characterization for the 60 GHz outdoor propagation channel with self-interference in terms of the moment generating function (MGF) of its channel capacity. We then use this characterization to compute probabilistic upper bounds on the overall network performance, i.e., total backlog and end-to-end delay. Furthermore, we study the effect of self-interference on the network performance and propose an optimal power allocation scheme to mitigate its impact in order to enhance network performance. Finally, we investigate the relation between relay density and network performance under a total power budget constraint. We show that increasing relay density may have adverse effects on network performance unless self-interference can be kept sufficiently small.

preprint2016arXiv

Analysis on 60 GHz Wireless Communications with Beamwidth-Dependent Misalignment

High speed wireless access on 60 GHz spectrum relies on high-gain directional antennas to overcome the severe signal attenuation. However, perfect alignment between transmitting and receiving antenna beams is rare in practice and overheard signals from concurrent transmissions may cause significant interference. In this paper we analyze the impact of antenna beam misalignment on the system performance of 60 GHz wireless access. We quantify the signal power loss caused by beam misalignment and the interference power accumulated from neighboring concurrent transmissions whose signals are leaked either via the main-beam pointing in the similar direction or via side-lobe emission, and derive the probability distribution of the signal to interference plus noise power ratio (SINR). For scenarios where interfering transmitters are distributed uniformly at random, we derive upper and lower bounds on the cumulative distribution function (abbreviated as CDF or c.d.f.) of SINR, which can be easily applied to evaluate system performance. We validate our analytical results by simulations where random nodes are uniformly distributed within a circular hall, and evaluate the sensitivity of average throughput and outage probability against two parameters: the half-power (3 dB) beamwidth to main-lobe beamwidth ratio and the beam misalignment deviation to main-lobe beamwidth ratio. Our results indicate that the derived lower bound performs well when the half-power beamwidth to main-lobe beamwidth ratio or the number of concurrent transmission links is small. When the number of active links is high, it is desirable in antenna design to balance the degradation caused by beam misalignment (wider beam is better) and the interference from concurrent transmission (narrower beam is better).

preprint2016arXiv

Charge Number Dependence of the Dephasing Rates of a Graphene Double Quantum Dot in a Circuit QED Architecture

We use an on-chip superconducting resonator as a sensitive meter to probe the properties of graphene double quantum dots at microwave frequencies. Specifically, we investigate the charge dephasing rates in a circuit quantum electrodynamics architecture. The dephasing rates strongly depend on the number of charges in the dots, and the variation has a period of four charges, over an extended range of charge numbers. Although the exact mechanism of this fourfold periodicity in dephasing rates is an open problem, our observations hint at the fourfold degeneracy expected in graphene from its spin and valley degrees of freedom.

preprint2016arXiv

Complexity of holomorphic maps from the complex unit ball to classical domains

We study the complexity of holomorphic isometries and proper maps from the complex unit ball to type IV classical domains. We investigate on degree estimates of holomorphic isometries and holomorphic maps with minimum target dimension. We also construct a real-parameter family of mutually inequivalent holomorphic isometries from the unit ball to type IV domains. We also provide examples of non-isometric proper holomorphic maps from the complex unit ball to classical domains.

preprint2016arXiv

Delay and Backlog Analysis for 60 GHz Wireless Networks

To meet the ever-increasing demands on higher throughput and better network delay performance, 60 GHZ networking is proposed as a promising solution for the next generation of wireless communications. To successfully deploy such networks, its important to understand their performance first. However, due to the unique fading characteristic of the 60 GHz channel, the characterization of the corresponding service process, offered by the channel, using the conventional methodologies may not be tractable. In this work, we provide an alternative approach to derive a closed-form expression that characterizes the cumulative service process of the 60 GHz channel in terms of the moment generating function (MGF) of its instantaneous channel capacity. We then use this expression to derive probabilistic upper bounds on the backlog and delay that are experienced by a flow traversing this network, using results from the MGF-based network calculus. The computed bounds are validated using simulation. We provide numerical results for different networking scenarios and for different traffic and channel parameters and we show that the 60 GHz wireless network is capable of satisfying stringent quality-of-Service (QoS) requirements, in terms of network delay and reliability. With this analysis approach at hand, a larger scale 60 GHz network design and optimization is possible.

preprint2016arXiv

Efficient Coded Cooperative Networks with Energy Harvesting and Wireless Power Transfer

The optimum off-line energy management scheme for multi-user multi-relay networks employing energy harvesting and wireless energy transfer is studied. Specifically, the users are capable of harvesting and transferring energy to each other over consecutive transmissions, though they have no fixed energy supplies. Meanwhile, network coding for the users' messages is conducted at the relays to enable cooperative transmission with source nodes in independent but not necessarily identically distributed (i.n.i.d.) Nakagami-$m$ fading channels. Therefore, a simultaneous two level cooperation, i.e., information-level and energy-level cooperation is conducted. The problem of energy efficiency (EE) maximization under constraints of the energy causality and a predefined outage probability threshold is formulated and shown to be non-convex. By exploiting fractional and geometric programming, a convex form-based iterative algorithm is developed to solve the problem efficiently. Close-to-optimal power allocation and energy cooperation policies across consecutive transmissions are found. Moreover, the effects of relay locations and wireless energy transmission efficiency are investigated and the performance comparison with the current state of solutions demonstrates that the proposed policies can manage the harvested energy more efficiently.

preprint2016arXiv

Energy Efficient Cooperative Network Coding with Joint Relay Scheduling and Power Allocation

The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption and EE and formulate the maximizing EE problem under the outage probability constraints. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, \emph{etc}) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP-hard, to reduce computational complexity, the outage probability is first tightly approximated to a log-convex form. Further, the EE is converted into a subtractive form based on the fractional programming. Then a convex mixed-integer nonlinear problem (MINLP) is eventually obtained. With a generalized outer approximation (GOA) algorithm, RS and PA are solved in an iterative manner. The Pareto-optimal curves between the EE and the target outage probability show the EE gains from PA and RS. Moreover, by comparing with the no network coding (NoNC) scenario, we conclude that with the same number of relays, MDNC can lead to EE gains. However, if RS is implemented, NoNC can outperform MDNC in terms of the EE when more relays are needed in the MDNC scheme.

preprint2016arXiv

On the embeddability of real hypersurfaces into hyperquadrics

In this paper, we provide {\em effective} results on the non-embeddability of real-analytic hypersurfaces into a hyperquadric. We show that, for any $N >n \geq 1$, the defining functions $φ(z,\bar z,u)$ of all real-analytic hypersurfaces $M=\{v=φ(z,\bar z,u)\}\subset\mathbb C^{n+1}$ containing Levi-nondegenerate points and locally transversally holomorphically embeddable into some hyperquadric $\mathcal Q\subset\mathbb C^{N+1}$ satisfy an {\em universal} algebraic partial differential equation $D(φ)=0$, where the algebraic-differential operator $D=D(n,N)$ depends on $n, N$ only. To the best of our knowledge, this is the first effective result characterizing real-analytic hypersurfaces embeddable into a hyperquadric of higher dimension. As an application, we show that for every $n,N$ as above there exists $μ=μ(n,N)$ such that a Zariski generic real-analytic hypersurface $M\subset\mathbb C^{n+1}$ of degree $\geq μ$ is not transversally holomorphically embeddable into any hyperquadric $\mathcal Q\subset\mathbb C^{N+1}$. We also provide an explicit upper bound for $μ$ in terms of $n,N$. To the best of our knowledge, this gives the first effective lower bound for the CR-complexity of a Zariski generic real-algebraic hypersurface in complex space of a fixed degree.

preprint2016arXiv

Proper holomorphic maps from the unit disk to some unit ball

We study proper rational maps from the unit disk to balls in higher dimensions. After gathering some known results, we study the moduli space of unitary equivalence classes of polynomial proper maps from the disk to a ball, and we establish a normal form for these equivalence classes. We also prove that all rational proper maps from the disk to a ball are homotopic in target dimension at least $2$.

preprint2016arXiv

Spin blockade and coherent dynamics of high-spin states in a three-electron double quantum dot

Asymmetry in a three-electron double quantum dot (DQD) allows spin blockade, when spin-3/2 (quadruplet) states and spin-1/2 (doublet) states have different charge configurations. We have observed this DQD spin blockade near the (1,2)-(2,1) charge transition using a pulsed-gate technique and a charge sensor. We then use this spin blockade to detect Landau-Zener-Stückelberg (LZS) interference and coherent oscillations between the spin quadruplet and doublet states. Such studies add to our understandings of coherence and control properties of three-spin states in a double dot, which in turn would benefit the explorations into various qubit encoding schemes in semiconductor nanostructures.

preprint2016arXiv

Strongly-coupled nanotube electromechanical resonators

Coupling an electromechanical resonator with carbon-nanotube quantum dots is a significant method to control both the electronic charge and the spin quantum states. By exploiting a novel micro-transfer technique, we fabricate two strongly-coupled and electrically-tunable mechanical resonators on a single carbon nanotube for the first time. The frequency of the two resonators can be individually tuned by the bottom gates, and strong coupling is observed between the electron charge and phonon modes of each resonator. Furthermore, the conductance of either resonator can be nonlocally modulated by the phonon modes in the other resonator. Strong coupling is observed between the phonon modes of the two resonators, which provides an effective long distance electron-electron interaction. The generation of phonon-mediated-spin entanglement is also theoretically analyzed for the two resonators. This strongly-coupled nanotube electromechanical resonator array provides an experimental platform for future studies of the coherent electron-phonon interaction, the phonon mediated long-distance electron interaction, and entanglement state generation.

preprint2016arXiv

Tunable Hybrid Qubit in a GaAs Double Quantum Dot

We experimentally demonstrate a tunable hybrid qubit in a five-electron GaAs double quantum dot. The qubit is encoded in the (1,4) charge regime of the double dot and can be manipulated completely electrically. More importantly, dot anharmonicity leads to quasiparallel energy levels and a new anticrossing, which help preserve quantum coherence of the qubit and yield a useful working point. We have performed Larmor precession and Ramsey fringe experiments near the new working point and find that the qubit decoherence time is significantly improved over a charge qubit. This work shows a new way to encode a semiconductor qubit that is controllable and coherent.

preprint2015arXiv

A gate defined quantum dot on the two-dimensional transition metal dichalcogenide semiconductor WSe2

Two-dimensional layered materials, such as transition metal dichalcogenides (TMDCs), are promising materials for future electronics owing to their unique electronic properties. With the presence of a band gap, atomically thin gate defined quantum dots (QDs) can be achieved on TMDCs. Here, standard semiconductor fabrication techniques are used to demonstrate quantum confined structures on WSe2 with tunnel barriers defined by electric fields, thereby eliminating the edge states induced by etching steps, which commonly appear in gapless graphene QDs. Over 40 consecutive Coulomb diamonds with a charging energy of approximately 2 meV were observed, showing the formation of a QD, which is consistent with the simulations. The size of the QD could be tuned over a factor of 2 by changing the voltages applied to the top gates. These results shed light on quantum nano-devices on TMDCs for further researches.

preprint2015arXiv

Concept for a Future Super Proton-Proton Collider

Following the discovery of the Higgs boson at LHC, new large colliders are being studied by the international high-energy community to explore Higgs physics in detail and new physics beyond the Standard Model. In China, a two-stage circular collider project CEPC-SPPC is proposed, with the first stage CEPC (Circular Electron Positron Collier, a so-called Higgs factory) focused on Higgs physics, and the second stage SPPC (Super Proton-Proton Collider) focused on new physics beyond the Standard Model. This paper discusses this second stage.

preprint2015arXiv

Cooperative Communication Using Network Coding

We consider a cognitive radio network scenario where a primary transmitter and a secondary transmitter, respectively, communicate a message to their respective primary receiver and secondary receiver over a packet-based wireless link, using a joint automatic-repeat-request (ARQ) error control scheme. The secondary transmitter assists in the retransmission of the primary message, which improves the primary performance, and is granted limited access to the transmission resources. Conventional ARQ, as well as two network-coding schemes are investigated for application in the retransmission phase; namely the static network-coding (SNC) scheme and the adaptive network-coding (ANC) scheme. For each scheme we analyze the transmission process by investigating the distribution of the number of transmission attempts and approximate it by normal distributions. Considering both the cases of an adaptive frame size and a truncated frame size, we derive analytical results on packet throughput and infer that the ANC scheme outperforms the SNC scheme.

preprint2015arXiv

Efficient Scheduling and Power Allocation for D2D-assisted Wireless Caching Networks

We study an one-hop device-to-device (D2D) assisted wireless caching network, where popular files are randomly and independently cached in the memory of end-users. Each user may obtain the requested files from its own memory without any transmission, or from a helper through an one-hop D2D transmission, or from the base station (BS). We formulate a joint D2D link scheduling and power allocation problem to maximize the system throughput. However, the problem is non-convex and obtaining an optimal solution is computationally hard. Alternatively, we decompose the problem into a D2D link scheduling problem and an optimal power allocation problem. To solve the two subproblems, we first develop a D2D link scheduling algorithm to select the largest number of D2D links satisfying both the signal to interference plus noise ratio (SINR) and the transmit power constraints. Then, we develop an optimal power allocation algorithm to maximize the minimum transmission rate of the scheduled D2D links. Numerical results indicate that both the number of the scheduled D2D links and the system throughput can be improved simultaneously with the Zipf-distribution caching scheme, the proposed D2D link scheduling algorithm, and the proposed optimal power allocation algorithm compared with the state of arts.

preprint2015arXiv

Method Study of Parameter Choice for a Circular Proton-Proton Collider

In this paper we showed a systematic method of appropriate parameter choice for a circular pp collider by using analytical expression of beam-beam tune shift limit started from given design goal and technical limitations. A parameter space has been explored. Based on parameters scan and considerations from RF systems, a set of appropriate parameter designed for a 50Km and a 100Km circular proton-proton collider was proposed.

preprint2015arXiv

Scalable Capacity Bounding Models for Wireless Networks

The framework of network equivalence theory developed by Koetter et al. introduces a notion of channel emulation to construct noiseless networks as upper (resp. lower) bounding models, which can be used to calculate the outer (resp. inner) bounds for the capacity region of the original noisy network. Based on the network equivalence framework, this paper presents scalable upper and lower bounding models for wireless networks with potentially many nodes. A channel decoupling method is proposed to decompose wireless networks into decoupled multiple-access channels (MACs) and broadcast channels (BCs). The upper bounding model, consisting of only point-to-point bit pipes, is constructed by firstly extending the "one-shot" upper bounding models developed by Calmon et al. and then integrating them with network equivalence tools. The lower bounding model, consisting of both point-to-point and point-to-points bit pipes, is constructed based on a two-step update of the lower bounding models to incorporate the broadcast nature of wireless transmission. The main advantages of the proposed methods are their simplicity and the fact that they can be extended easily to large networks with a complexity that grows linearly with the number of nodes. It is demonstrated that the resulting upper and lower bounds can approach the capacity in some setups.

preprint2015arXiv

Secure Degrees of Freedom of Wireless X Networks Using Artificial Noise Alignment

The problem of transmitting confidential messages in $M \times K$ wireless X networks is considered, in which each transmitter intends to send one confidential message to every receiver. In particular, the secure degrees of freedom (SDOF) of the considered network are studied based on an artificial noise alignment (ANA) approach, which integrates interference alignment and artificial noise transmission. At first, an SDOF upper bound is derived for the $M \times K$ X network with confidential messages (XNCM) to be $\frac{K(M-1)}{K+M-2}$. By proposing an ANA approach, it is shown that the SDOF upper bound is tight when $K=2$ for the considered XNCM with time/frequency varying channels. For $K \geq 3$, it is shown that SDOF of $\frac{K(M-1)}{K+M-1}$ can be achieved, even when an external eavesdropper is present. The key idea of the proposed scheme is to inject artificial noise into the network, which can be aligned in the interference space at receivers for confidentiality. Moreover, for the network with no channel state information at transmitters, a blind ANA scheme is proposed to achieve SDOF of $\frac{K(M-1)}{K+M-1}$ for $K,M \geq 2$, with reconfigurable antennas at receivers. The proposed method provides a linear approach to secrecy coding and interference alignment.

preprint2015arXiv

Secure Partial Repair in Wireless Caching Networks with Broadcast Channels

We study security in partial repair in wireless caching networks where parts of the stored packets in the caching nodes are susceptible to be erased. Let us denote a caching node that has lost parts of its stored packets as a sick caching node and a caching node that has not lost any packet as a healthy caching node. In partial repair, a set of caching nodes (among sick and healthy caching nodes) broadcast information to other sick caching nodes to recover the erased packets. The broadcast information from a caching node is assumed to be received without any error by all other caching nodes. All the sick caching nodes then are able to recover their erased packets, while using the broadcast information and the nonerased packets in their storage as side information. In this setting, if an eavesdropper overhears the broadcast channels, it might obtain some information about the stored file. We thus study secure partial repair in the senses of information-theoretically strong and weak security. In both senses, we investigate the secrecy caching capacity, namely, the maximum amount of information which can be stored in the caching network such that there is no leakage of information during a partial repair process. We then deduce the strong and weak secrecy caching capacities, and also derive the sufficient finite field sizes for achieving the capacities. Finally, we propose optimal secure codes for exact partial repair, in which the recovered packets are exactly the same as erased packets.

preprint2015arXiv

Study on CEPC performances with different collision energies and geometric layouts

Circular Electron-Positron Collider(CEPC) is one of the largest plans in high energy physics study at China, which would serve as Higgs Factory firstly and then upgrade to a hadron collider. In this paper we give the 50km and 100km design in both single ring and double ring schemes, including $Z$ boson and $W$ boson and Higgs boson by using the optimized method. Also, we give the potential of CEPC running at $Z$ and $W$ poles. And we analysis the relationship of luminosity with circumference and filling factor, which gives a way to evaluate the choice of geometry. What's more, we compare the nominal performance of CEPC-SPPC and LHC and FCC.

preprint2015arXiv

Suspending Effect on Low-Frequency Charge Noise in Graphene Quantum Dot

Charge noise is critical in the performance of gate-controlled quantum dots (QDs). Here we show the 1/f noise for a microscopic graphene QD is substantially larger than that for a macroscopic graphene field-effect transistor (FET), increasing linearly with temperature. To understand its origin, we suspended the graphene QD above the substrate. In contrast to large area graphene FETs, we find that a suspended graphene QD has an almost-identical noise level as an unsuspended one. Tracking noise levels around the Coulomb blockade peak as a function of gate voltage yields potential fluctuations of order 1 "μeV", almost one order larger than in GaAs/GaAlAs QDs. Edge states rather than substrate-induced disorders, appear to dominate the 1/f noise, thus affecting the coherency of graphene nano-devices.

preprint2015arXiv

Temperature dependence of Coulomb oscillations in a few-layer two-dimensional WS2 quantum dot

Standard semiconductor fabrication techniques are used to fabricate a quantum dot (QD) made of WS2, where Coulomb oscillations were found. The full-width-at-half-maximum of the Coulomb peaks increases linearly with temperature while the height of the peaks remains almost independent of temperature, which is consistent with standard semiconductor QD theory. Unlike graphene etched QDs, where Coulomb peaks belonging to the same QD can have different temperature dependences, these results indicate the absence of the disordered confining potential. This difference in the potential-forming mechanism between graphene etched QDs and WS2 QDs may be the reason for the larger potential fluctuation found in graphene QDs.

preprint2014arXiv

Buffer-Based Distributed LT Codes

We focus on the design of distributed Luby transform (DLT) codes for erasure networks with multiple sources and multiple relays, communicating to a single destination. The erasure-floor performance of DLT codes improves with the maximum degree of the relay-degree distribution. However, for conventional DLT codes, the maximum degree is upper-bounded by the number of sources. An additional constraint is that the sources are required to have the same information block length. We introduce a $D$-bit buffer for each source-relay link, which allows the relay to select multiple encoded bits from the same source for the relay-encoding process; thus, the number of sources no longer limits the maximum degree at the relay. Furthermore, the introduction of buffers facilitates the use of different information block sizes across sources. Based on density evolution we develop an asymptotic analytical framework for optimization of the relay-degree distribution. We further integrate techniques for unequal erasure protection into the optimization framework. The proposed codes are considered for both lossless and lossy source-relay links. Numerical examples show that there is no loss in erasure performance for transmission over lossy source-relay links as compared to lossless links. Additional delays, however, may occur. The design framework and our contributions are demonstrated by a number of illustrative examples, showing the improvements obtained by the proposed buffer-based DLT codes.

preprint2014arXiv

Controlled-Not Quantum Logic Gate in Two Strongly Coupled Semiconductor Charge Qubits

A crucial requirement for scalable quantum-information processing is the realization of multiple-qubit quantum gates. Universal multiple-qubit gates can be implemented by a set of universal single qubit gates and any one kind of two-qubit gate, such as a controlled-NOT (CNOT) gate. Semiconductor quantum dot qubits are a leading approach for the physical implementation of quantum computation, due to their potential for large-scale integration. Two-qubit gate operations have been so far only demonstrated in individual electron spin-based quantum dot systems. Due to the relatively short de-coherence time, charge qubits in quantum dots are generally considered to be inferior for going beyond single qubit level. Here, we demonstrate the benchmarking CNOT gate in two capacitively coupled charge qubits, each consisting of an electron confined in a GaAs/AlGaAs double quantum dot. Owing to the strong inter-qubit coupling strength, gate operations with a clock speed up to 5GHz has been realized. A processing tomography shows encouragingly that the universal two-qubit gate operations have comparable fidelities to that of spin-based two-qubit gates. Our results suggest that semiconductor charge qubits have a considerable potential for scalable quantum computing and may stimulate the use of long-range Coulomb interaction for coherent quantum control in other devices.

preprint2014arXiv

Coupling two distant double quantum dots to a microwave resonator

With recent advances in the circuit quantum electrodynamics (cQED) architecture, hybrid systems that couple nano-devices to microwave resonators have been developing rapidly. Here we report an experimental demonstration of two graphene double quantum dots (DQDs) coupled over a distance of up to 60 μm, through a microwave resonator. We jointly measure the two DQDs' coupling to the resonator, which causes a nonlinear response in the resonator reflection amplitude in the vicinity of the degeneracy points of the two DQDs. This phenomenon is explained by the Tavis-Cummings (T-C) mode. We further characterize this nonlocal coupling by measuring the correlation between the DC currents in the two DQDs. This correlation is observed to be strongly dependent on the average photon number in the resonator. Our results explore T-C physics in electronic transport, and also contribute to the study of nonlocal transport and future implementations of remote electronic entanglement.

preprint2014arXiv

Electron spin resonance and spin-valley physics in a silicon double quantum dot

Silicon quantum dots are a leading approach for solid-state quantum bits. However, developing this technology is complicated by the multi-valley nature of silicon. Here we observe transport of individual electrons in a silicon CMOS-based double quantum dot under electron spin resonance. An anticrossing of the driven dot energy levels is observed when the Zeeman and valley splittings coincide. A detected anticrossing splitting of 60 MHz is interpreted as a direct measure of spin and valley mixing, facilitated by spin-orbit interaction in the presence of non-ideal interfaces. A lower bound of spin dephasing time of 63 ns is extracted. We also describe a possible experimental evidence of an unconventional spin-valley blockade, despite the assumption of non-ideal interfaces. This understanding of silicon spin-valley physics should enable better control and read-out techniques for the spin qubits in an all CMOS silicon approach.

preprint2014arXiv

Exact Optimized-cost Repair in Multi-hop Distributed Storage Networks

The problem of exact repair of a failed node in multi-hop networked distributed storage systems is considered. Contrary to the most of the current studies which model the repair process by the direct links from surviving nodes to the new node, the repair is modeled by considering the multi-hop network structure, and taking into account that there might not exist direct links from all the surviving nodes to the new node. In the repair problem of these systems, surviving nodes may cooperate to transmit the repair traffic to the new node. In this setting, we define the total number of packets transmitted between nodes as repair-cost. A lower bound of the repaircost can thus be found by cut-set bound analysis. In this paper, we show that the lower bound of the repair-cost is achievable for the exact repair of MDS codes in tandem and grid networks, thus resulting in the minimum-cost exact MDS codes. Further, two suboptimal (achievable) bounds for the large scale grid networks are proposed.

preprint2014arXiv

Fabrication and characterization of an undoped GaAs/AlGaAs quantum dot device

We demonstrate the development of a double quantum dot with an integrated charge sensor fabricated in undoped GaAs/AlGaAs heterostructures using a double top-gated design. Based on the evaluation of the integrated charge sensor, the double quantum dot can be tuned to a few-electron region. Additionally, the inter-dot coupling of the double quantum dot can be tuned to a large extent according to the voltage on the middle gate. The quantum dot is shown to be tunable from a single dot to a well-isolated double dot. To assess the stability of such design, the potential fluctuation induced by 1/f noise was measured. Based on the findings herein, the quantum dot design developed in the undoped GaAs/AlGaAs semiconductor shows potential for the future exploitation of nano-devices.

preprint2014arXiv

Introduction of DC line structures into a superconducting microwave 3D cavity

We report a technique that can noninvasively add multiple DC wires into a 3D superconducting microwave cavity for electronic devices that require DC electrical terminals. We studied the influence of our DC lines on the cavity performance systematically. We found that the quality factor of the cavity is reduced if any of the components of the electrical wires cross the cavity equipotential planes. Using this technique, we were able to incorporate a quantum dot (QD) device into a 3D cavity. We then controlled and measured the QD transport signal using the DC lines. We have also studied the heating effects of the QD by the microwave photons in the cavity.

preprint2014arXiv

Non-embeddability into a fixed sphere for a family of compact real algebraic hypersurfaces

We study the holomorphic embedding problem from a compact strongly pseudoconvex real algebraic hypersurface into a sphere of higher dimension. We construct a family of compact strongly pseudoconvex hypersurfaces $M_ε$ in $\mathbb{C}^2,$ and prove that for any integer $N$, there is a number $ε(N)$ with $0<ε(N)<1$ such that for any $ε$ with $0<ε<ε(N)$, $M_ε$ can not be locally holomorphically embedded into the unit sphere $\mathbb{S}^{2N-1}$ in $\mathbb{C}^N.$

preprint2014arXiv

Rateless Codes for the Multi-Way Relay Channel

We consider distributed Luby transform (DLT) codes for efficient packet transmission in a multi-way relay network, where the links are modeled as erasure channels. Density evolution is applied for asymptotic performance analysis, and subsequently used in a linear-programming design framework for optimizing the degree distribution at the relay in terms of overhead. Moreover a buffer is introduced at the relay to enable efficient downlink transmission even if packets are lost during uplink transmission. Performance losses in terms of delay and/or erasure rates caused by link erasures during uplink transmission are thus alleviated. The proposed DLT codes provide significant improvements in overhead and decoded erasure rates. Numerical results for finite-length codes follow closely the asymptotic analysis. Our results demonstrate that the proposed buffer-based DLT codes outperform its counterparts for lossy uplink transmission.

preprint2014arXiv

Repair for Distributed Storage Systems in Packet Erasure Networks

Reliability is essential for storing files in many applications of distributed storage systems. To maintain reliability, when a storage node fails, a new node should be regenerated by a repair process. Most of the previous results on the repair problem assume perfect (error-free) links in the networks. However, in practice, especially in a wireless network, the transmitted packets (for repair) may be lost due to, e.g., link failure or buffer overflow. We study the repair problem of distributed storage systems in packet erasure networks, where a packet loss is modeled as an erasure. The minimum repair-bandwidth, namely the amount of information sent from the surviving nodes to the new node, is established under the ideal assumption of infinite number of packet transmissions. We also study the bandwidth-storage tradeoffs in erasure networks. Then, the use of repairing storage nodes (nodes with smaller storage space) is proposed to reduce the repair-bandwidth. We study the minimal storage of repairing storage nodes. For the case of a finite number of packet transmissions, the probability of successful repairing is investigated. We show that the repair with a finite number of packet transmissions may use much larger bandwidth than the minimum repair-bandwidth. Finally, we propose a combinatorial optimization problem, which results in the optimal repair-bandwidth for the given packet erasure probability and finite packet transmissions.

preprint2013arXiv

A Two-Phase Maximum-Likelihood Sequence Estimation for Receivers with Partial CSI

The optimality of the conventional maximum likelihood sequence estimation (MLSE), also known as the Viterbi Algorithm (VA), relies on the assumption that the receiver has perfect knowledge of the channel coefficients or channel state information (CSI). However, in practical situations that fail the assumption, the MLSE method becomes suboptimal and then exhaustive checking is the only way to obtain the ML sequence. At this background, considering directly the ML criterion for partial CSI, we propose a two-phase low-complexity MLSE algorithm, in which the first phase performs the conventional MLSE algorithm in order to retain necessary information for the backward VA performed in the second phase. Simulations show that when the training sequence is moderately long in comparison with the entire data block such as 1/3 of the block, the proposed two-phase MLSE can approach the performance of the optimal exhaustive checking. In a normal case, where the training sequence consumes only 0.14 of the bandwidth, our proposed method still outperforms evidently the conventional MLSE.

preprint2013arXiv

Decentralized Minimum-Cost Repair for Distributed Storage Systems

There have been emerging lots of applications for distributed storage systems e.g., those in wireless sensor networks or cloud storage. Since storage nodes in wireless sensor networks have limited battery, it is valuable to find a repair scheme with optimal transmission costs (e.g., energy). The optimal-cost repair has been recently investigated in a centralized way. However a centralized control mechanism may not be available or is very expensive. For the scenarios, it is interesting to study optimal-cost repair in a decentralized setup. We formulate the optimal-cost repair as convex optimization problems for the network with convex transmission costs. Then we use primal and dual decomposition approaches to decouple the problem into subproblems to be solved locally. Thus, each surviving node, collaborating with other nodes, can minimize its transmission cost such that the global cost is minimized. We further study the optimality and convergence of the algorithms. Finally, we discuss the code construction and determine the field size for finding feasible network codes in our approaches.

preprint2013arXiv

Design of Binary Network Codes for Multi-user Multi-way Relay Networks

We study multi-user multi-way relay networks where $N$ user nodes exchange their information through a single relay node. We use network coding in the relay to increase the throughput. Due to the limitation of complexity, we only consider the binary multi-user network coding (BMNC) in the relay. We study BMNC matrix (in GF(2)) and propose several design criteria on the BMNC matrix to improve the symbol error probability (SEP) performance. Closed-form expressions of the SEP of the system are provided. Moreover, an upper bound of the SEP is also proposed to provide further insights on system performance. Then BMNC matrices are designed to minimize the error probabilities.

preprint2013arXiv

Detection and measurement of spin-dependent dynamics in random telegraph signals

A quantum point contact was used to observe single-electron fluctuations of a quantum dot in a GaAs heterostructure. The resulting random telegraph signals (RTS) contain statistical information about the electron spin state if the tunneling dynamics are spin-dependent. We develop a statistical method to extract information about spin-dependent dynamics from RTS and use it to demonstrate that these dynamics can be studied in the thermal energy regime. The tunneling rates of each spin state are independently measured in a finite external magnetic field. We confirm previous findings of a decrease in overall tunneling rates for the spin excited state compared to the ground state as an external magnetic field is increased.

preprint2013arXiv

Improved LT Codes in Low Overhead Regions for Binary Erasure Channels

We study improved degree distribution for Luby Transform (LT) codes which exhibits improved bit error rate performance particularly in low overhead regions. We construct the degree distribution by modifying Robust Soliton distribution. The performance of our proposed LT codes is evaluated and compared to the conventional LT codes via And-Or tree analysis. Then we propose a transmission scheme based on the proposed degree distribution to improve its frame error rate in full recovery regions. Furthermore, the improved degree distribution is applied to distributed multi-source relay networks and unequal error protection. It is shown that our schemes achieve better performance and reduced complexity especially in low overhead regions, compared with conventional schemes.

preprint2013arXiv

Observation of Kondo Effect in a Quadruple Quantum Dots

We investigate the Kondo effect in a quadruple quantum dot device of coupled-double quantum dots (DQDs), which simultaneously contains intra-DQDs and inter-DQDs coupling. A variety of novel behaviors are observed. The differential conductance dI/dV is measured in the upper DQDs as a function of source drain bias. It is found to exhibit multiple peaks, including a zero-bias peak, where the number of peaks exceeds five. Alternatively, tuning the lower DQDs yielded regions of four peaks. In addition, a Kondo-effect switcher is demonstrated, using the lower DQDs as the controller.

preprint2013arXiv

Optimization Parameter Design of a Circular e+e- Higgs Factory

In this paper we will show a general method of how to make an optimized parameter design of a circular e+e- Higgs Factory by using analytical expression of maximum beam-beam parameter and beamstrahlung beam lifetime started from given design goal and technical limitations. A parameter space has been explored. Based on beam parameters scan and RF parameters scan, a set of optimized parameter designs for 50 km Circular Higgs Factory (CHF) with different RF frequency was proposed.

preprint2013arXiv

Optimized-Cost Repair in Multi-hop Distributed Storage Systems with Network Coding

In distributed storage systems reliability is achieved through redundancy stored at different nodes in the network. Then a data collector can reconstruct source information even though some nodes fail. To maintain reliability, an autonomous and efficient protocol should be used to repair the failed node. The repair process causes traffic and consequently transmission cost in the network. Recent results found the optimal trafficstorage tradeoff, and proposed regenerating codes to achieve the optimality. We aim at minimizing the transmission cost in the repair process. We consider the network topology in the repair, and accordingly modify information flow graphs. Then we analyze the cut requirement and based on the results, we formulate the minimum-cost as a linear programming problem for linear costs. We show that the solution of the linear problem establishes a fundamental lower bound of the repair-cost. We also show that this bound is achievable for minimum storage regenerating, which uses the optimal-cost minimum-storage regenerating (OCMSR) code. We propose surviving node cooperation which can efficiently reduce the repair cost. Further, the field size for the construction of OCMSR codes is discussed. We show the gain of optimal-cost repair in tandem, star, grid and fully connected networks.

preprint2013arXiv

Photon-assisted-tunneling in a coupled double quantum dot out of thermal equilibrium

We perform photon-assisted-tunneling (PAT) experiments on a GaAs double quantum dot device under high microwave excitation power. Photon-assisted absorption of up to 14 photons is observed, when electron temperature (>1K) are far above the lattice temperature. Signatures of Landau-Zener-Stückelberg (LZS) interference are found even in this non-equilibrium PAT spectrum. In addition, the charge state relaxation time T_1~8ns measured in this out of thermal equilibrium double quantum dot is in agreement with other previous reports.

preprint2013arXiv

Repair for Distributed Storage Systems with Erasure Channels

We study the repair problem of distributed storage systems in erasure networks where the packets transmitted from surviving nodes to the new node might be lost. The fundamental storage-bandwidth tradeoff is calculated by multicasting analysis in erasure networks. The optimal tradeoff bound can be asymptotically achieved when the number of transmission (packets) goes to infinity. For a limited number of transmission, we study the probability of successful regenerating. Then, we investigate two approaches of increasing the probability of successful regenerating, namely, by connecting more surviving nodes or by increasing the storage space of nodes. Using more nodes may pose larger delay and in certain situation it might not be possible to connect to more nodes too. We show that in addition to reducing repair bandwidth, increasing storage space can also increase reliability for repair.

preprint2013arXiv

Symmetric reflection line resonator for semiconductor circuit quantum electrodynamics

We have designed and fabricated a half-wavelength reflection line resonator (RLR) that consists of a pair of two coupled microstrip lines on a GaAs/AlGaAs heterostructure. By changing the top gate voltage on a square of two dimensional electron gas under the resonator, a large range of the quality factors can be obtained. Energy loss in the two-dimensional electron gas can be minimized, thus realizing a versatile resonator suitable for integration with semiconductor quantum circuits.

preprint2013arXiv

Tuning inter-dot tunnel coupling of an etched graphene double quantum dot by adjacent metal gates

Graphene double quantum open the possibility to use charge or spin degrees of freedom for storing and manipulating quantum information in this new electronic material. However, impurities and edge disorders in etched graphene nano-structures hinder the ability to control the inter-dot tunnel coupling, tc,the most important property of the artificial molecule. Here we report measurements of tc in an all-metal-gates-tuned graphene DQD. We find that tc can be controlled continuously about a factor of four by employing a single gate. Furthermore, tc, can be changed monotonically about another factor of four as electrons are gate-pumped into the dot one by one. The results suggest that the strength of tunnel coupling in etched DQDs can be varied in a rather broad range and in a controllable manner, which improves the outlook to use graphene as a base material for qubit applications.

preprint2012arXiv

Degrees of Freedom of Multi-hop MIMO Broadcast Networks with Delayed CSIT

We study the sum degrees of freedom (DoF) of a class of multi-layer relay-aided MIMO broadcast networks with delayed channel state information at transmitters (CSIT). In the assumed network a K-antenna source intends to communicate to K single-antenna destinations, with the help of N-2 layers of K full-duplex single-antenna relays. We consider two practical delayed CSIT feedback scenarios. If the source can obtain the CSI feedback signals from all layers, we prove the optimal sum DoF of the network to be K/(1+1/2+...+1/K). If the CSI feedback is only within each hop, we show that when K=2 the optimal sum DoF is 4/3, and when K >= 3 the sum DoF 3/2 is achievable. Our results reveal that the sum DoF performance in the considered class of N-layer MIMO broadcast networks with delayed CSIT may depend not on N, the number of layers in the network, but only on K, the number of antennas/terminals in each layer.

preprint2012arXiv

Electron Number Dependence of Spin Triplet-Singlet Relaxation Time

In a GaAs single quantum dot, the relaxation time T_{1} between spin triplet and singlet states has been measured for the last few even number of electrons. The singlet-triplet energy separation E_{ST} is tuned as a control parameter for the comparison of T_{1} between different electron numbers. T_{1} shows a steady decrease from 2-electrons, 4-electrons, to 6-electrons, and we found this implies an enhancement of the spin-orbital coupling strength in a multi-electron quantum dot.

preprint2011arXiv

Back-action Driven Electron Spin Singlet-Triplet Excitation in a GaAs Quantum Dot

In a single quantum dot (QD), the electrons were driven out of thermal equilibrium by the back-action from a nearby quantum point contact (QPC). We found the driving to energy excited states can be probed with the random telegraph signal (RTS) statistics, when the excited states relax slowly compared with RTS tunneling rate. We studied the last few electrons, and found back-action driven spin singlet-triplet (S-T) excitation for and only for all the even number of electrons. We developed a phenomenological model to quantitatively characterize the spin S-T excitation rate, which enabled us to evaluate the influence of back-action on spin S-T based qubit operations.

preprint2011arXiv

Back-action Induced Non-equilibrium Effect in Electron Charge Counting Statistics

We report our study of the real-time charge counting statistics measured by a quantum point contact (QPC) coupled to a single quantum dot (QD) under different back-action strength. By tuning the QD-QPC coupling or QPC bias, we controlled the QPC back-action which drives the QD electrons out of thermal equilibrium. The random telegraph signal (RTS) statistics showed strong and tunable non-thermal-equilibrium saturation effect, which can be quantitatively characterized as a back-action induced tunneling out rate. We found that the QD-QPC coupling and QPC bias voltage played different roles on the back-action strength and cut-off energy.

preprint2011arXiv

Electron Spin Excited States Spectroscopy in a Quantum Dot Probed by QPC Back-action

The quantum point contact (QPC) back-action has been found to cause non-thermal-equilibrium excitations to the electron spin states in a quantum dot (QD). Here we use back-action as an excitation source to probe the spin excited states spectroscopy for both the odd and even electron numbers under a varying parallel magnetic field. For a single electron, we observed the Zeeman splitting. For two electrons, we observed the splitting of the spin triplet states $|T^{+}>$ and $|T^{0}>$ and found that back-action drives the singlet state $|S>$ overwhelmingly to $|T^{+}>$ other than $|T^{0}>$. All these information were revealed through the real-time charge counting statistics.

preprint2011arXiv

Gates controlled parallel-coupled double quantum dot on both single layer and bilayer graphene

Here we report the fabrication and quantum transport measurements of gates controlled parallel-coupled double quantum dot on both bilayer and single layer graphene. It is shown that the interdot coupling strength of the parallel double dots can be effectively tuned from weak to strong regime by both the in-plane plunger gates and back gate. All the relevant energy scales and parameters of the graphene parallel-coupled double dot can be extracted from the honeycomb charge stability diagrams revealed through the transport measurements.