Search arXiv⌕ Search

arXiv subjects

Xin Wang

Publications and source records attributed to Xin Wang.

At least 1,711 records · Page 95Linked to original sources

Distributed Coordinated Multicell Beamforming for Wireless Cellular Networks Powered by Renewables: A Stochastic ADMM Approach

The integration of renewable energy sources (RES) has facilitated efficient and sustainable resource allocation for wireless communication systems. In this paper, a novel framework is introduced to develop coordinated multicell beamforming (CMBF) design for wireless cellular networks powered by a smart microgrid, where the BSs are equipped with RES harvesting devices and can perform two-way (i.e., buying/selling) energy trading with the main grid. To this end, new models are put forth to account for the stochastic RES harvesting, two-way energy trading, and conditional value-at-risk (CVaR) based energy transaction cost. Capitalizing on these models, we propose a distributed CMBF solution to minimize the grid-wide transaction cost subject to user quality-of-service (QoS) constraints. Specifically, relying on state-of-the-art optimization tools, we show that the relevant task can be formulated as a convex problem that is well suited for development of a distributed solver. To cope with stochastic availability of the RES, the stochastic alternating direction method of multipliers (ADMM) is then leveraged to develop a novel distributed CMBF scheme. It is established that the proposed scheme is guaranteed to yield the optimal CMBF solution, with only local channel state information available at each BS and limited information exchange among the BSs. Numerical results are provided to corroborate the merits of the proposed scheme.

eess.SP↗

Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose

We demonstrate the irreversibility of asymptotic entanglement manipulation under quantum operations that completely preserve the positivity of partial transpose (PPT), resolving a major open problem in quantum information theory. Our key tool is a new efficiently computable additive lower bound for the asymptotic relative entropy of entanglement with respect to PPT states, which can be used to evaluate the entanglement cost under local operations and classical communication (LOCC). We find that for any rank-two mixed state supporting on the $3\otimes3$ antisymmetric subspace, the amount of distillable entanglement by PPT operations is strictly smaller than one entanglement bit (ebit) while its entanglement cost under PPT operations is exactly one ebit. As byproduct, we find that for this class of states, both the Rains' bound and its regularization, are strictly less than the asymptotic relative entropy of entanglement. So, in general, there is no unique entanglement measure for the manipulation of entanglement by PPT operations. We further show a computable sufficient condition for the irreversibility of entanglement distillation by LOCC (or PPT) operations.

quant-ph↗

Two-Way Energy Trading and Online Planning for Fifth-Generation Communications with Renewables

Future fifth-generation (5G) cellular networks, equipped with energy harvesting devices, are uniquely positioned to closely interoperate with smart grid. New interoperable functionalities are discussed in stochastic two-way energy trading and online planning to improve efficiency and productivity. Challenges lie in the unavailability of a-priori knowledge on future wireless channels, energy pricing and harvesting. Lyapunov optimization techniques are utilized to address the challenges and stochastically optimize energy trading and planning. Particularly, it is able to decouple the optimization of energy trading and planning during individual time slots, hence eliminating the need for joint optimization across a large number of slots.

eess.SY↗

Fast pulse sequences for dynamically corrected gates in single-triplet qubits

We present a set of experimentally feasible pulse sequences that implement any single-qubit gate on a singlet-triplet spin qubit and demonstrate that these new sequences are up to three times faster than existing sequences in the literature. We show that these sequences can be extended to incorporate built-in dynamical error correction, yielding gates that are robust to both charge and magnetic field noise and up to twice as fast as previous dynamically corrected gate schemes. We present a thorough comparison of the performance of our new sequences with that of several existing ones using randomized benchmarking, considering both quasistatic and $1/f^α$ noise models. We provide our results both as a function of evolution time and as a function of the number of gates, which respectively yield both an effective coherence time and an estimate of the number of gates that can be performed within this coherence time. We determine which set of pulse sequences gives the best results for a wide range of noise strengths and power spectra. Overall, we find that the traditional, slower sequences perform best when there is no field noise or when the noise contains significant high-frequency components; otherwise, our new, fast sequences exhibit the best performance.

cond-mat.mes-hall↗

Distinguishing f(R) theories from general relativity by gravitational lensing effect

The post-Newtonian formulation of a general class of f(R) theories is set up to 3rd order approximation. It turns out that the information of a specific form of f(R) gravity is encoded in the Yukawa potential, which is contained in the perturbative expansion of the metric components. Although the Yukawa potential is canceled in the 2nd order expression of the effective refraction index of light, detailed analysis shows that the difference of the lensing effect between the f(R) gravity and general relativity does appear at the 3rd order when $\sqrt{f''(0)/f'(0)}$ is larger than the distance $d_0$ to the gravitational source. However, the difference between these two kinds of theories will disappear in the axially symmetric spacetime region. Therefore only in very rare case the f(R) theories are distinguishable from general relativity by gravitational lensing effect at the 3rd order post-Newtonian approximation.

gr-qc↗

Approximate broadcasting of quantum correlations

Broadcasting quantum and classical information is a basic task in quantum information processing, and is also a useful model in the study of quantum correlations including quantum discord. We establish a full operational characterization of two-sided quantum discord in terms of bilocal broadcasting of quantum correlations. Moreover, we show that both the optimal fidelity of unilocal broadcasting of the correlations in an arbitrary bipartite quantum state and that of broadcasting an arbitrary set of quantum states can be formulized as semidefinite programs (SDPs), which are efficiently computable. We also analyze some properties of these SDPs and evaluate the broadcasting fidelities for some cases of interest.

quant-ph↗

Characterizing Intra-cluster light in the Hubble Frontier Fields

We investigate the intra-cluster light (ICL) in the 6 Hubble Frontier Field clusters at $0.3 150$kpc) lies in a younger/bluer stellar population ($\sim1$Gyr), a phenomenon not seen in local samples. We attribute this light to the higher fraction of starforming/(post-)starburst galaxies in clusters at $z\sim0.5$. Ultimately, we find the ICL's total mass to be $\log M_{\rm *}^{\rm ICL}/M_\odot\sim11$-12, constituting 5%-20% of the clusters' total stellar mass, or about a half of the value at $z\sim0$. The above implies distinct formation histories for the ICL and BCGs/other massive cluster galaxies; i.e. the ICL at this epoch is still being constructed rapidly ($\sim40M_\odot$yr$^{-1}$), while the BCGs have mostly completed their evolution. To be consistent with the ICL measurements of local massive clusters, such as the Virgo, our data suggest mass acquisition mainly from quiescent cluster galaxies is the principal source of ICL material in the subsequent $\sim$5 Gyr of cosmic time.

astro-ph.GA↗

DeepProf: Performance Analysis for Deep Learning Applications via Mining GPU Execution Patterns

Deep learning applications are computation-intensive and often employ GPU as the underlying computing devices. Deep learning frameworks provide powerful programming interfaces, but the gap between source codes and practical GPU operations make it difficult to analyze the performance of deep learning applications. In this paper, through examing the features of GPU traces and deep learning applications, we use the suffix tree structure to extract the repeated patten in GPU traces. Performance analysis graphs can be generated from the preprocessed GPU traces. We further present \texttt{DeepProf}, a novel tool to automatically process GPU traces and generate performance analysis reports for deep learning applications. Empirical study verifies the effectiveness of \texttt{DeepProf} in performance analysis and diagnosis. We also find out some interesting properties of Tensorflow, which can be used to guide the deep learning system setup.

cs.SE↗

Heralded quantum controlled phase gates with dissipative dynamics in macroscopically-distant resonators

Heralded near-deterministic multi-qubit controlled phase gates with integrated error detection have recently been proposed by Borregaard et al. [Phys. Rev. Lett. 114, 110502 (2015)]. This protocol is based on a single four-level atom (a heralding quartit) and $N$ three-level atoms (operational qutrits) coupled to a single-resonator mode acting as a cavity bus. Here we generalize this method for two distant resonators without the cavity bus between the heralding and operational atoms. Specifically, we analyze the two-qubit controlled-Z gate and its multi-qubit-controlled generalization (i.e., a Toffoli-like gate) acting on the two-lowest levels of $N$ qutrits inside one resonator, with their successful actions being heralded by an auxiliary microwave-driven quartit inside the other resonator. Moreover, we propose a circuit-quantum-electrodynamics realization of the protocol with flux and phase qudits in linearly-coupled transmission-line resonators with dissipation. These methods offer a quadratic fidelity improvement compared to cavity-assisted deterministic gates.

quant-ph↗

A region-growing approach for automatic outcrop fracture extraction from a three-dimensional point cloud

Conventional manual surveys of rock mass fractures usually require large amounts of time and labor; yet, they provide a relatively small set of data that cannot be considered representative of the study region. Terrestrial laser scanners are increasingly used for fracture surveys because they can efficiently acquire large area, high-resolution, three-dimensional (3D) point clouds from outcrops. However, extracting fractures and other planar surfaces from 3D outcrop point clouds is still a challenging task. No method has been reported that can be used to automatically extract the full extent of every individual fracture from a 3D outcrop point cloud. In this study, we propose a method using a region-growing approach to address this problem; the method also estimates the orientation of each fracture. In this method, criteria based on the local surface normal and curvature of the point cloud are used to initiate and control the growth of the fracture region. In tests using outcrop point cloud data, the proposed method identified and extracted the full extent of individual fractures with high accuracy. Compared with manually acquired field survey data, our method obtained better-quality fracture data, thereby demonstrating the high potential utility of the proposed method.

cs.CV↗

Outcrop fracture characterization on suppositional planes cutting through digital outcrop models (DOMs)

Conventional fracture data collection methods are usually implemented on planar surfaces or assuming they are planar; these methods may introduce sampling errors on uneven outcrop surfaces. Consequently, data collected on limited types of outcrop surfaces (mainly bedding surfaces) may not be a sufficient representation of fracture network characteristic in outcrops. Recent development of techniques that obtain DOMs from outcrops and extract the full extent of individual fractures offers the opportunity to address the problem of performing the conventional sampling methods on uneven outcrop surfaces. In this study, we propose a new method that performs outcrop fracture characterization on suppositional planes cutting through DOMs. The suppositional plane is the best fit plane of the outcrop surface, and the fracture trace map is extracted on the suppositional plane so that the fracture network can be further characterized. The amount of sampling errors introduced by the conventional methods and avoided by the new method on 16 uneven outcrop surfaces with different roughnesses are estimated. The results show that the conventional sampling methods don't apply to outcrops other than bedding surfaces or outcrops whose roughness > 0.04 m, and that the proposed method can greatly extend the types of outcrop surfaces for outcrop fracture characterization with the suppositional plane cutting through DOMs.

physics.geo-ph↗

Nonadditivity of Rains' bound for distillable entanglement

Rains' bound is arguably the best known upper bound of the distillable entanglement by operations completely preserving positivity of partial transpose (PPT) and was conjectured to be additive and coincide with the asymptotic relative entropy of entanglement. We disprove both conjectures by explicitly constructing a special class of mixed two-qubit states. We then introduce an additive semidefinite programming lower bound ($E_M$) for the asymptotic Rains' bound, and it immediately becomes a computable lower bound for entanglement cost of bipartite states. Furthermore, $E_M$ is also proved to be the best known upper bound of the PPT-assisted deterministic distillable entanglement and gives the asymptotic rates for all pure states and some class of genuinely mixed states.

quant-ph↗

Suppression of charge noise using barrier control of a singlet-triplet qubit

It has been recently demonstrated that a singlet-triplet spin qubit in semiconductor double quantum dots can be controlled by changing the height of the potential barrier between the two dots ("barrier control"), which has led to a considerable reduction of charge noises as compared to the traditional tilt control method. In this paper we show, through a molecular-orbital-theoretic calculation of double quantum dots influenced by a charged impurity, that the relative charge noise for a system under the barrier control not only is smaller than that for the tilt control, but actually decreases as a function of an increasing exchange interaction. This is understood as a combined consequence of the greatly suppressed detuning noise when the two dots are symmetrically operated, as well as an enhancement of the inter-dot hopping energy of an electron when the barrier is lowered which in turn reduces the relative charge noise at large exchange interaction values. We have also studied the response of the qubit to charged impurities at different locations, and found that the improvement of barrier control is least for impurities equidistant from the two dots due to the small detuning noise they cause, but is otherwise significant along other directions.

quant-ph↗

A Novel Construction of Low-Complexity MDS Codes with Optimal Repair Capability for Distributed Storage Systems

Maximum-distance-separable (MDS) codes are a class of erasure codes that are widely adopted to enhance the reliability of distributed storage systems (DSS). In (n, k) MDS coded DSS, the original data are stored into n distributed nodes in an efficient manner such that each storage node only contains a small amount (i.e., 1/k) of the data and a data collector connected to any k nodes can retrieve the entire data. On the other hand, a node failure can be repaired (i.e., stored data at the failed node can be successfully recovered) by downloading data segments from other surviving nodes. In this paper, we develop a new approach to construction of simple (5, 3) MDS codes. With judiciously block-designed generator matrices, we show that the proposed MDS codes have a minimum stripe size α = 2 and can be constructed over a small (Galois) finite field F4 of only four elements, both facilitating low-complexity computations and implementations for data storage, retrieval and repair. In addition, with the proposed MDS codes, any single node failure can be repaired through interference alignment technique with a minimum data amount downloaded from the surviving nodes; i.e., the proposed codes ensure optimal exact-repair of any single node failure using the minimum bandwidth. The low-complexity and all-node-optimal-repair properties of the proposed MDS codes make them readily deployed for practical DSS.

cs.IT↗

On Optimal Two-Sided Pricing of Congested Networks

Traditionally, Internet Access Providers (APs) only charge end-users for Internet access services; however, to recoup infrastructure costs and increase revenues, some APs have recently adopted two-sided pricing schemes under which both end-users and content providers are charged. Meanwhile, with the rapid growth of traffic, network congestion could seriously degrade user experiences and influence providers' utility. To optimize profit and social welfare, APs and regulators need to design appropriate pricing strategies and regulatory policies that take the effects of network congestion into consideration. In this paper, we model two-sided networks under which users' traffic demands are influenced by exogenous pricing and endogenous congestion parameters and derive the system congestion under an equilibrium. We characterize the structures and sensitivities of profit- and welfare-optimal two-sided pricing schemes and reveal that 1) the elasticity of system throughput plays a crucial role in determining the structures of optimal pricing, 2) the changes of optimal pricing under varying AP's capacity and users' congestion sensitivity are largely driven by the type of data traffic, e.g., text or video, and 3) APs and regulators will be incentivized to shift from one-sided to two-sided pricing when APs' capacities and user demand for video traffic grow. Our results can help APs design optimal two-sided pricing and guide regulators to legislate desirable policies.

cs.NI↗

Shape of the Growing Front of Biofilms

The spatial organization of bacteria in dense biofilms is key to their collective behaviour, and understanding it will be important for medical and technological applications. Here we study the morphology of a compact biofilm that undergoes unidirectional growth, and determine the condition for the stability of the growing interface as a function of the nutrient concentration and mechanical tension. Our study suggests that transient behaviour may play an important role in shaping the structure of a biofilm.

physics.bio-ph↗

Discovery of three strongly lensed quasars in the Sloan Digital Sky Survey

We present the discovery of 3 quasar lenses in the Sloan Digital Sky Survey (SDSS), selected using two novel photometry-based selection techniques. The J0941+0518 system, with two point sources separated by 5.46" on either side of a galaxy, has source and lens redshifts $z_s = 1.54$ and $z_l = 0.343$. The AO-assisted images of J2211+1929 show two point sources separated by 1.04", corresponding to the same quasar at $z_s = 1.07,$ besides the lens galaxy and Einstein ring. Images of J2257+2349 show two point sources separated by 1.67" on either side of an E/S0 galaxy. The extracted spectra show two images of the same quasar at redshift $z_s = 2.10$. In total, the two selection techniques identified 309 lens candidates, including 47 known lenses, and 6 previously ruled out candidates. 55 of the remaining candidates were observed using NIRC2 and ESI at Keck Observatory, EFOSC2 at the ESO-NTT (La Silla), and SAM and the Goodman spectrograph at SOAR. Of the candidates observed, 3 were confirmed as lenses, 36 were ruled out, and 16 remain inconclusive. Taking into account that we recovered known lenses, this gives us a success rate of at least 50/309 (16%). This initial campaign demonstrates the power of purely photometric selection techniques in finding lensed quasars. Developing and refining these techniques is essential for efficient identification of these rare lenses in ongoing and future photometric surveys.

astro-ph.GA↗

Randomized benchmarking of barrier versus tilt control of a singlet-triplet qubit

Decoherence due to charge noise is one of the central challenges in using spin qubits in semiconductor quantum dots as a platform for quantum information processing. Recently, it has been experimentally demonstrated in both Si and GaAs singlet-triplet qubits that the effects of charge noise can be suppressed if qubit operations are implemented using symmetric barrier control instead of the standard tilt control. Here, we investigate the key issue of whether the benefits of barrier control persist over the entire set of single-qubit gates by performing randomized benchmarking simulations. We find the surprising result that the improvement afforded by barrier control depends sensitively on the amount of spin noise: for the minimal nuclear spin noise levels present in Si, the coherence time improves by more than two orders of magnitude whereas in GaAs, by contrast the coherence time is essentially the same for barrier and tilt control. However, we establish that barrier control becomes beneficial if qubit operations are performed using a new family of composite pulses that reduce gate times by up to 90%. With these optimized pulses, barrier control is the best way to achieve high-fidelity quantum gates in singlet-triplet qubits.

cond-mat.mes-hall↗