Searcharxiv⌕ Search

arXiv subjects

Ming Xiao

Publications and source records attributed to Ming Xiao.

At least 199 records · Page 11Linked to original sources
arXiv2015

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.

cs.IT↗
arXiv2015

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.

cs.IT↗
arXiv2015

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.

physics.acc-ph↗
arXiv2015

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.

cs.IT↗
arXiv2015

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.

physics.acc-ph↗
arXiv2014

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.

cond-mat.mes-hall↗
arXiv2014

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.

quant-ph↗
arXiv2014

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.

cs.IT↗
arXiv2014

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.

cs.IT↗
arXiv2014

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.

cond-mat.mes-hall↗
arXiv2014

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.

cond-mat.mes-hall↗
arXiv2014

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.

cond-mat.mes-hall↗
arXiv2014

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.

cs.IT↗
arXiv2014

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.$

math.CV↗
arXiv2014

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.

cs.IT↗
arXiv2013

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.

cond-mat.mes-hall↗