arXiv subjects

Chao Shen

Publications and source records attributed to Chao Shen.

247 records · Page 14Linked to original sources

arXiv2014

A QoS-Aware Scheduling Algorithm for High-Speed Railway Communication System

With the rapid development of high-speed railway (HSR), how to provide the passengers with multimedia services has attracted increasing attention. A key issue is to develop an effective scheduling algorithm for multiple services with different quality of service (QoS) requirements. In this paper, we investigate the downlink service scheduling problem in HSR network taking account of end-to-end deadline constraints and successfully packet delivery ratio requirements. Firstly, by exploiting the deterministic high-speed train trajectory, we present a time-distance mapping in order to obtain the highly dynamic link capacity effectively. Next, a novel service model is developed for deadline constrained services with delivery ratio requirements, which enables us to turn the delivery ratio requirement into a single queue stability problem. Based on the Lyapunov drift, the optimal scheduling problem is formulated and the corresponding scheduling service algorithm is proposed by stochastic network optimization approach. Simulation results show that the proposed algorithm outperforms the conventional schemes in terms of QoS requirements.

cs.NI↗

arXiv2014

High Fidelity Quantum Gates for Trapped Ions under Micromotion

Two or three dimensional Paul traps can confine a large number of ions forming a Wigner crystal, which would provide an ideal architecture for scalable quantum computation except for the micromotion, an issue that is widely believed to be the killer for high fidelity quantum gates. Surprisingly, here we show that the micromotion is not an obstacle at all for design of high fidelity quantum gates, even though the magnitude of the micromotion is significantly beyond the requirement of the Lamb-Dicke condition. Through exact solution of the quantum Mathieu equations, we demonstrate the principle of the gate design under micromotion using two ions in a quadrupole Paul trap as an example. The proposed micromotion quantum gates can be extended to the many ion case, paving a new way for scalable trapped ion quantum computation.

quant-ph↗

arXiv2014

Joint Beamforming Design and Time Allocation for Wireless Powered Communication Networks

This paper investigates a multi-input single-output (MISO) wireless powered communication network (WPCN) under the protocol of harvest-then-transmit. The power station (PS) with reliable power supply can replenish the passive user nodes by wireless power transfer (WPT) in the downlink (DL), then each user node transmits independent information to the sink by a time division multiple access (TDMA) scheme in the uplink (UL). We consider the joint time allocation and beamforming design to maximize the system sum-throughput. The semidefinite relaxation (SDR) technique is applied to solve the nonconvex design problem. The tightness of SDR approximation, thus the global optimality, is proved. This implies that only one single energy beamformer is required at the PS. Then a fast semiclosed form solution is proposed by exploiting the inherent structure. Simulation results demonstrate the efficiency of the proposed algorithms from the perspectives of time complexity and information throughput.

cs.IT↗

arXiv2014

A Low-Complexity Algorithm for Throughput Maximization in Wireless Powered Communication Networks

This paper investigates a wireless powered communication network (WPCN) under the protocol of harvest-then-transmit,where a hybrid access point with constant power supply replenishes the passive user nodes by wireless power transfer in the downlink,then each user node transmit independent information to the hybrid AP in a time division multiple access (TDMA) scheme in the uplink.The sum-throughput maximization and min-throughput maximization problems are considered in this paper.The optimal time allocation for the sum-throughput maximization is proposed based on the Jensen's inequality,which provides more insight into the design of WPCNs.A low-complexity fixed-point iteration algorithm for the min-throughput maximization problem,which promises a much better computation complexity than the state-of-the-art algorithm.Simulation results confirm the effectiveness of the proposed algorithm.

cs.IT↗

arXiv2013

Hopf Insulators and Their Topologically Protected Surface States

Three-dimensional (3D) topological insulators in general need to be protected by certain kinds of symmetries other than the presumed $U(1)$ charge conservation. A peculiar exception is the Hopf insulators which are 3D topological insulators characterized by an integer Hopf index. To demonstrate the existence and physical relevance of the Hopf insulators, we construct a class of tight-binding model Hamiltonians which realize all kinds of Hopf insulators with arbitrary integer Hopf index. These Hopf insulator phases have topologically protected surface states and we numerically demonstrate the robustness of these topologically protected states under general random perturbations without any symmetry other than the $U(1)$ charge conservation that is implicit in all kinds of topological insulators.

cond-mat.mes-hall↗

arXiv2013

Individual Addressing in Quantum Computation through Spatial Refocusing

Separate addressing of individual qubits is a challenging requirement for scalable quantum computation, and crosstalk between operations on neighboring qubits remains as a significant source of noise for current experimental implementation of multi-qubit platforms. We propose a scheme based on spatial refocusing from interference of several coherent laser beams to significantly reduce the crosstalk noise for any type of quantum gates. A general framework is developed for the spatial refocusing technique, in particular with practical Gaussian beams, and we show under typical experimental conditions, the crosstalk-induced infidelity of quantum gates can be reduced by several orders of magnitude with a moderate cost of a few correction laser beams.

quant-ph↗

arXiv2013

Scalable Implementation of Boson Sampling with Trapped Ions

Boson sampling solves a classically intractable problem by sampling from a probability distribution given by matrix permanents. We propose a scalable implementation of Boson sampling using local transverse phonon modes of trapped ions to encode the Bosons. The proposed scheme allows deterministic preparation and high-efficiency readout of the Bosons in the Fock states and universal mode mixing. With the state-of-the-art trapped ion technology, it is feasible to realize Boson sampling with tens of Bosons by this scheme, which would outperform the most powerful classical computers and constitute an effective disproof of the famous extended Church-Turing thesis.

quant-ph↗

arXiv2013

Wireless Information and Energy Transfer in Multi-Antenna Interference Channel

This paper considers the transmitter design for wireless information and energy transfer (WIET) in a multiple-input single-output (MISO) interference channel (IFC). The design problem is to maximize the system throughput (i.e., the weighted sum rate) subject to individual energy harvesting constraints and power constraints. Different from the conventional IFCs without energy harvesting, the cross-link signals in the considered scenario play two opposite roles in information detection (ID) and energy harvesting (EH). It is observed that the ideal scheme, where the receivers can simultaneously perform ID and EH from the received signal, may not always achieve the best tradeoff between information transfer and energy harvesting, but simple practical schemes based on time splitting may perform better. We therefore propose two practical time splitting schemes, namely time division mode switching (TDMS) and time division multiple access (TDMA), in addition to a power splitting (PS) scheme which separates the received signal into two parts for ID and EH, respectively. In the two-user scenario, we show that beamforming is optimal to all the schemes. Moreover, the design problems associated with the TDMS and TDMA schemes admit semi-analytical solutions. In the general K-user scenario, a successive convex approximation method is proposed to handle the WIET problems associated with the ideal scheme and the PS scheme, which are known to be NP-hard in general. The K-user TDMS and TDMA schemes are shown efficiently solvable as convex problems. Simulation results show that stronger cross-link channel powers actually improve the information sum rate under energy harvesting constraints. Moreover, none of the schemes under consideration can dominate another in terms of the sum rate performance.

cs.IT↗

arXiv2013

Efficient Spin Squeezing with Optimized Pulse Sequences

Spin squeezed states are a class of entangled states of spins that have practical applications to precision measurements. In recent years spin squeezing with one-axis twisting (OAT) has been demonstrated experimentally with spinor BECs with more than 10^3 atoms. Although the noise is below the standard quantum limit, the OAT scheme cannot reduce the noise down to the ultimate Heisenberg limit. Here we propose an experimentally feasible scheme based on optimized quantum control to greatly enhance the performance of OAT to approach the Heisenberg limit, requiring only an OAT Hamiltonian and the use of several coherent driving pulses. The scheme is robust against technical noise and can be readily implemented for spinor BECs or trapped ions with current technology.

quant-ph↗

arXiv2013

Simultaneous Information and Energy Transfer: A Two-User MISO Interference Channel Case

This paper considers the sum rate maximization problem of a two-user multiple-input single-output interference channel with receivers that can scavenge energy from the radio signals transmitted by the transmitters. We first study the optimal transmission strategy for an ideal scenario where the two receivers can simultaneously decode the information signal and harvest energy. Then, considering the limitations of the current circuit technology, we propose two practical schemes based on TDMA, where, at each time slot, the receiver either operates in the energy harvesting mode or in the information detection mode. Optimal transmission strategies for the two practical schemes are respectively investigated. Simulation results show that the three schemes exhibit interesting tradeoff between achievable sum rate and energy harvesting requirement, and do not dominate each other in terms of maximum achievable sum rate.

cs.IT↗

arXiv2012

State-independent experimental tests of quantum contextuality in a three dimensional system

We experimentally observed state-independent violations of Kochen-Specker inequalities for the simplest indivisible quantum system manifesting quantum contextuality, a three-level (qutrit) system. We performed the experiment with a single trapped ^{171}Yb^{+} ion, by mapping three ground states of the ^{171}Yb^{+} ion to a qutrit system and carrying out quantum operatations by applying microwaves resonant to the qutrit transition frequencies. Our results are free from the detection loophole and cannot be explained by the non-contextual hidden variable models.

quant-ph↗

arXiv2011

Distributed Robust Multi-Cell Coordinated Beamforming with Imperfect CSI: An ADMM Approach

Multi-cell coordinated beamforming (MCBF), where multiple base stations (BSs) collaborate with each other in the beamforming design for mitigating the inter-cell interference, has been a subject drawing great attention recently. Most MCBF designs assume perfect channel state information (CSI) of mobile stations (MSs); however CSI errors are inevitable at the BSs in practice. Assuming elliptically bounded CSI errors, this paper studies the robust MCBF design problem that minimizes the weighted sum power of BSs subject to worst-case signal-to-interference-plus-noise ratio (SINR) constraints on the MSs. Our goal is to devise a distributed optimization method that can obtain the worst-case robust beamforming solutions in a decentralized fashion, with only local CSI used at each BS and little backhaul signaling for message exchange between BSs. However, the considered problem is difficult to handle even in the centralized form. We first propose an efficient approximation method in the centralized form, based on the semidefinite relaxation (SDR) technique. To obtain the robust beamforming solution in a decentralized fashion, we further propose a distributed robust MCBF algorithm, using a distributed convex optimization technique known as alternating direction method of multipliers (ADMM). We analytically show the convergence of the proposed distributed robust MCBF algorithm to the optimal centralized solution and its better bandwidth efficiency in backhaul signaling over the existing dual decomposition based algorithms. Simulation results are presented to examine the effectiveness of the proposed SDR method and the distributed robust MCBF algorithm.

cs.IT↗

arXiv2011

Worst-Case SINR Constrained Robust Coordinated Beamforming for Multicell Wireless Systems

Multicell coordinated beamforming (MCBF) has been recognized as a promising approach to enhancing the system throughput and spectrum efficiency of wireless cellular systems. In contrast to the conventional single-cell beamforming (SBF) design, MCBF jointly optimizes the beamforming vectors of cooperative base stations (BSs) (via a central processing unit(CPU)) in order to mitigate the intercell interference. While most of the existing designs assume that the CPU has the perfect knowledge of the channel state information (CSI) of mobile stations (MSs), this paper takes into account the inevitable CSI errors at the CPU, and study the robust MCBF design problem. Specifically, we consider the worst-case robust design formulation that minimizes the weighted sum transmission power of BSs subject to worst-case signal-to-interference-plus-noise ratio (SINR) constraints on MSs. The associated optimization problem is challenging because it involves infinitely many nonconvex SINR constraints. In this paper, we show that the worst-case SINR constraints can be reformulated as linear matrix inequalities, and the approximation method known as semidefinite relation can be used to efficiently handle the worst-case robust MCBF problem. Simulation results show that the proposed robustMCBF design can provide guaranteed SINR performance for the MSs and outperforms the robust SBF design.

cs.IT↗