arXiv subjects

Ming Xiao

Publications and source records attributed to Ming Xiao.

At least 217 records · Page 12Linked to original sources

arXiv2013

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.

cs.IT↗

arXiv2013

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.

cond-mat.mes-hall↗

arXiv2013

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.

cond-mat.mes-hall↗

arXiv2013

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.

cond-mat.mes-hall↗

arXiv2013

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.

cond-mat.mes-hall↗

arXiv2013

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.

cs.IT↗

arXiv2013

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.

physics.acc-ph↗

arXiv2013

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.

cs.IT↗

arXiv2013

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.

cs.IT↗

arXiv2013

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.

cs.IT↗

arXiv2013

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.

cs.IT↗

arXiv2012

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.

cs.IT↗

arXiv2012

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.

cond-mat.mes-hall↗

arXiv2011

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.

cond-mat.mes-hall↗

arXiv2011

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.

cond-mat.mes-hall↗

arXiv2011

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.

cond-mat.mes-hall↗

arXiv2011

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.

quant-ph↗

arXiv1999

Derivation of the Effective Chiral Lagrangian for Pseudoscalar Mesons from QCD

We formally derive the chiral Lagrangian for low lying pseudoscalar mesons from the first principles of QCD considering the contributions from the normal part of the theory without taking approximations. The derivation is based on the standard generating functional of QCD in the path integral formalism. The gluon-field integration is formally carried out by expressing the result in terms of physical Green's functions of the gluon. To integrate over the quark-field, we introduce a bilocal auxiliary field Phi(x,y) representing the mesons. We then develop a consistent way of extracting the local pseudoscalar degree of freedom U(x) in Phi(x,y) and integrating out the rest degrees of freedom such that the complete pseudoscalar degree of freedom resides in U(x). With certain techniques, we work out the explicit U(x)-dependence of the effective action up to the p^4-terms in the momentum expansion, which leads to the desired chiral Lagrangian in which all the coefficients contributed from the normal part of the theory are expressed in terms of certain Green's functions in QCD. Together with the existing QCD formulae for the anomaly contributions, the present results leads to the complete QCD definition of the coefficients in the chiral Lagrangian. The relation between the present QCD definition of the p^2-order coefficient F_0^2 and the well-known approximate result given by Pagels and Stokar is discussed.

hep-ph↗