arXiv subjects

Xin Wang

Publications and source records attributed to Xin Wang.

At least 1,693 records · Page 94Linked to original sources

arXiv2018

PRESTO: Probabilistic Cardinality Estimation for RDF Queries Based on Subgraph Overlapping

In query optimisation accurate cardinality estimation is essential for finding optimal query plans. It is especially challenging for RDF due to the lack of explicit schema and the excessive occurrence of joins in RDF queries. Existing approaches typically collect statistics based on the counts of triples and estimate the cardinality of a query as the product of its join components, where errors can accumulate even when the estimation of each component is accurate. As opposed to existing methods, we propose PRESTO, a cardinality estimation method that is based on the counts of subgraphs instead of triples and uses a probabilistic method to estimate cardinalities of RDF queries as a whole. PRESTO avoids some major issues of existing approaches and is able to accurately estimate arbitrary queries under a bound memory constraint. We evaluate PRESTO with YAGO and show that PRESTO is more accurate for both simple and complex queries.

cs.DB↗

arXiv2018

Separation between quantum Lovász number and entanglement-assisted zero-error classical capacity

Quantum Lovász number is a quantum generalization of the Lovász number in graph theory. It is the best known efficiently computable upper bound of the entanglement-assisted zero-error classical capacity of a quantum channel. However, it remains an intriguing open problem whether quantum entanglement can always enhance the zero-error capacity to achieve the quantum Lovász number. In this paper, by constructing a particular class of qutrit-to-qutrit channels, we show that there exists a strict gap between the entanglement-assisted zero-error capacity and the quantum Lovász number. Interestingly, for this class of quantum channels, the quantum generalization of fractional packing number is strictly larger than the zero-error capacity assisted with feedback or no-signalling correlations, which differs from the case of classical channels.

quant-ph↗

arXiv2018

On the validity of microscopic calculations of double-quantum-dot spin qubits based on Fock-Darwin states

We consider two typical approximations that are used in the microscopic calculations of double-quantum dot spin qubits, namely, the Heitler-London (HL) and the Hund-Mulliken (HM) approximations, which use linear combinations of Fock-Darwin states to approximate the two-electron states under the double-well confinement potential. We compared these results to a case in which the solution to a one-dimensional Schrödinger equation was exactly known and found that typical microscopic calculations based on Fock-Darwin states substantially underestimate the value of the exchange interaction, which is the key parameter that controls the quantum dot spin qubits. This underestimation originates from the lack of tunneling of Fock-Darwin states, which is accurate only in the case with a single potential well. Our results suggest that the accuracies of the current two-dimensional molecular-orbit-theoretical calculations based on Fock-Darwin states should be revisited since underestimation could only deteriorate in dimensions that are higher than one.

quant-ph↗

arXiv2018

Magic angle for barrier-controlled double quantum dots

We show that the exchange interaction of a singlet-triplet spin qubit confined in double quantum dots, when being controlled by the barrier method, is insensitive to a charged impurity lying along certain directions away from the center of the double-dot system. These directions differ from the polar axis of the double dots by the magic angle, equaling $\arccos\left(1/\sqrt{3}\right)\approx 54.7^\circ$, a value previously found in atomic physics and nuclear magnetic resonance. This phenomenon can be understood from an expansion of the additional Coulomb interaction created by the impurity, but also relies on the fact that the exchange interaction solely depends on the tunnel coupling in the barrier-control scheme. Our results suggest that for a scaled-up qubit array, when all pairs of double dots rotate their respective polar axes from the same reference line by the magic angle, cross-talks between qubits can be eliminated, allowing clean single-qubit operations. While our model is a rather simplified version of actual experiments, our results suggest that it is possible to minimize unwanted couplings by judiciously designing the layout of the qubits.

cond-mat.mes-hall↗

arXiv2017

Paid Peering, Settlement-Free Peering, or Both?

With the rapid growth of congestion-sensitive and data-intensive applications, traditional settlement-free peering agreements with best-effort delivery often do not meet the QoS requirements of content providers (CPs). Meanwhile, Internet access providers (IAPs) feel that revenues from end-users are not sufficient to recoup the upgrade costs of network infrastructures. Consequently, some IAPs have begun to offer CPs a new type of peering agreement, called paid peering, under which they provide CPs with better data delivery quality for a fee. In this paper, we model a network platform where an IAP makes decisions on the peering types offered to CPs and the prices charged to CPs and end-users. We study the optimal peering schemes for the IAP, i.e., to offer CPs both the paid and settlement-free peering to choose from or only one of them, as the objective is profit or welfare maximization. Our results show that 1) the IAP should always offer the paid and settlement-free peering under the profit-optimal and welfare-optimal schemes, respectively, 2) whether to simultaneously offer the other peering type is largely driven by the type of data traffic, e.g., text or video, and 3) regulators might want to encourage the IAP to allocate more network capacity to the settlement-free peering for increasing user welfare.

cs.NI↗

arXiv2017

Activated zero-error classical communication over quantum channels assisted with quantum no-signalling correlations

We study the activated quantum no-signalling-assisted zero-error classical capacity by first allowing the assistance from some noiseless forward communication channel and later paying back the cost of the helper. This activated communication model considers the additional forward noiseless channel as a catalyst for communication. First, we show that the one-shot activated capacity can be formulated as a semidefinite program and we derive a number of striking properties of this capacity. We further present a sufficient condition under which a noisy channel can be activated. Second, we show that one-bit noiseless classical communication is able to fully activate any classical-quantum channel to achieve its asymptotic capacity, or the semidefinite (or fractional) packing number. Third, we prove that the asymptotic activated capacity cannot exceed the original asymptotic capacity of any quantum channel. We also show that the asymptotic no-signalling-assisted zero-error capacity does not equal to the semidefinite packing number for quantum channels, which differs from the case of classical-quantum channels.

quant-ph↗

arXiv2017

Joint Offloading and Computing Optimization in Wireless Powered Mobile-Edge Computing Systems

Mobile-edge computing (MEC) and wireless power transfer (WPT) have been recognized as promising techniques in the Internet of Things (IoT) era to provide massive low-power wireless devices with enhanced computation capability and sustainable energy supply. In this paper, we propose a unified MEC-WPT design by considering a wireless powered multiuser MEC system, where a multi-antenna access point (AP) (integrated with an MEC server) broadcasts wireless power to charge multiple users and each user node relies on the harvested energy to execute computation tasks. With MEC, these users can execute their respective tasks locally by themselves or offload all or part of them to the AP based on a time division multiple access (TDMA) protocol. Building on the proposed model, we develop an innovative framework to improve the MEC performance, by jointly optimizing the energy transmit beamformer at the AP, the central processing unit (CPU) frequencies and the numbers of offloaded bits at the users, as well as the time allocation among users. Under this framework, we address a practical scenario where latency-limited computation is required. In this case, we develop an optimal resource allocation scheme that minimizes the AP's total energy consumption subject to the users' individual computation latency constraints. Leveraging the state-of-the-art optimization techniques, we derive the optimal solution in a semi-closed form. Numerical results demonstrate the merits of the proposed design over alternative benchmark schemes.

cs.IT↗

arXiv2017

Observing pure effects of counter-rotating terms without ultrastrong coupling: A single photon can simultaneously excite two qubits

The coherent process that a single photon simultaneously excites two qubits has recently been theoretically predicted by [https://link.aps.org/doi/10.1103/PhysRevLett.117.043601 {Phys. Rev. Lett. 117, 043601 (2016)}]. We propose a different approach to observe a similar dynamical process based on a superconducting quantum circuit, where two coupled flux qubits longitudinally interact with the same resonator. We show that this simultaneous excitation of two qubits (assuming that the sum of their transition frequencies is close to the cavity frequency) is related to the counter-rotating terms in the dipole-dipole coupling between two qubits, and the standard rotating-wave approximation is not valid here. By numerically simulating the adiabatic Landau-Zener transition and Rabi-oscillation effects, we clearly verify that the energy of a single photon can excite two qubits via higher-order transitions induced by the longitudinal couplings and the counter-rotating terms. Compared with previous studies, the coherent dynamics in our system only involves one intermediate state and, thus, exhibits a much faster rate. We also find transition paths which can interfere. Finally, by discussing how to control the two longitudinal-coupling strengths, we find a method to observe both constructive and destructive interference phenomena in our system.

quant-ph↗

arXiv2017

Converse bounds for classical communication over quantum networks

We explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the classical communication assisted by non-signalling and positive-partial-transpose-preserving codes, and obtain efficiently computable one-shot bounds to assess the performance of classical communication. Second, we consider the asymptotic communication capability of communication over the QBC and QMAC. We derive an efficiently computable strong converse bound for the capacity region, which behaves better than the previous semidefinite programming strong converse bound for point-to-point channels. Third, we obtain a converse bound on the one-shot capacity region based on the hypothesis testing divergence between the given channel and a certain class of subchannels. As applications, we analyze the communication performance for some basic network channels, including the classical broadcast channels and a specific class of quantum broadcast channels.

quant-ph↗

arXiv2017

Flexpoint: An Adaptive Numerical Format for Efficient Training of Deep Neural Networks

Deep neural networks are commonly developed and trained in 32-bit floating point format. Significant gains in performance and energy efficiency could be realized by training and inference in numerical formats optimized for deep learning. Despite advances in limited precision inference in recent years, training of neural networks in low bit-width remains a challenging problem. Here we present the Flexpoint data format, aiming at a complete replacement of 32-bit floating point format training and inference, designed to support modern deep network topologies without modifications. Flexpoint tensors have a shared exponent that is dynamically adjusted to minimize overflows and maximize available dynamic range. We validate Flexpoint by training AlexNet, a deep residual network and a generative adversarial network, using a simulator implemented with the neon deep learning framework. We demonstrate that 16-bit Flexpoint closely matches 32-bit floating point in training all three models, without any need for tuning of model hyperparameters. Our results suggest Flexpoint as a promising numerical format for future hardware for training and inference.

cs.LG↗

arXiv2017

The Role of Data Cap in Optimal Two-part Network Pricing

Internet services are traditionally priced at flat rates; however, many Internet service providers (ISPs) have recently shifted towards two-part tariffs where a data cap is imposed to restrain data demand from heavy users. Although the two-part tariff could generally increase the revenue for ISPs and has been supported by the US FCC, the role of data cap and its optimal pricing structures are not well understood. In this article, we study the impact of data cap on the optimal two-part pricing schemes for congestion-prone service markets. We model users' demand and preferences over pricing and congestion alternatives and derive the market share and congestion of service providers under a market equilibrium. Based on the equilibrium model, we characterize the two-part structures of the revenue- and welfare-optimal pricing schemes. Our results reveal that 1) the data cap provides a mechanism for ISPs to transition from the flat-rate to pay-as-you-go type of schemes, 2) both the revenue and welfare objectives of the ISP will drive the optimal pricing towards usage-based schemes with diminishing data caps, and 3) the welfare-optimal tariff comprises lower fees than the revenue-optimal counterpart, suggesting that regulators might want to promote usage-based pricing but regulate the lump-sum and per-unit fees.

cs.NI↗

arXiv2017

Hybrid Surface Patterns Mimicking the Design of the Adhesive Toe Pad of Tree Frog

Biological materials achieve directional reinforcement with oriented assemblies of anisotropic building blocks. One such example is the nanocomposite structure of keratinized epithelium on the toe pad of tree frogs, in which hexagonal arrays of (soft) epithelial cells are crossed by densely packed and oriented (hard) keratin nanofibrils. Here, a method is established to fabricate arrays of tree-frog-inspired composite micropatterns composed of polydimethylsiloxane (PDMS) micropillars embedded with polystyrene (PS) nanopillars. Adhesive and frictional studies of these synthetic materials reveal a benefit of the hierarchical and anisotropic design for both adhesion and friction, in particular, at high matrix-fiber interfacial strengths. The presence of PS nanopillars alters the stress distribution at the contact interface of micropillars and therefore enhances the adhesion and friction of the composite micropattern. The results suggest a design principle for bioinspired structural adhesives, especially for wet environments.

physics.app-ph↗

arXiv2017

Analysis of the Polya-Gamma block Gibbs sampler for Bayesian logistic linear mixed models

In this article, we construct a two-block Gibbs sampler using Polson et al. (2013) data augmentation technique with Polya-Gamma latent variables for Bayesian logistic linear mixed models under proper priors. Furthermore, we prove the uniform ergodicity of this Gibbs sampler, which guarantees the existence of the central limit theorems for MCMC based estimators.

math.ST↗

arXiv2017

Machine Learning for Networking: Workflow, Advances and Opportunities

Recently, machine learning has been used in every possible field to leverage its amazing power. For a long time, the net-working and distributed computing system is the key infrastructure to provide efficient computational resource for machine learning. Networking itself can also benefit from this promising technology. This article focuses on the application of Machine Learning techniques for Networking (MLN), which can not only help solve the intractable old network questions but also stimulate new network applications. In this article, we summarize the basic workflow to explain how to apply the machine learning technology in the networking domain. Then we provide a selective survey of the latest representative advances with explanations on their design principles and benefits. These advances are divided into several network design objectives and the detailed information of how they perform in each step of MLN workflow is presented. Finally, we shed light on the new opportunities on networking design and community building of this new inter-discipline. Our goal is to provide a broad research guideline on networking with machine learning to help and motivate researchers to develop innovative algorithms, standards and frameworks.

cs.NI↗

arXiv2017

Tripartite-to-bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces

We study the problem of transforming a tripartite pure state to a bipartite one using stochastic local operations and classical communication (SLOCC). It is known that the tripartite-to-bipartite SLOCC convertibility is characterized by the maximal Schmidt rank of the given tripartite state, i.e. the largest Schmidt rank over those bipartite states lying in the support of the reduced density operator. In this paper, we further study this problem and exhibit novel results in both multi-copy and asymptotic settings. In the multi-copy regime, we observe that the maximal Schmidt rank is strictly super-multiplicative, i.e. the maximal Schmidt rank of the tensor product of two tripartite pure states can be strictly larger than the product of their maximal Schmidt ranks. We then provide a full characterization of those tripartite states whose maximal Schmidt rank is strictly super-multiplicative when taking tensor product with itself. In the asymptotic setting, we focus on determining the tripartite-to-bipartite SLOCC entanglement transformation rate, which turns out to be equivalent to computing the asymptotic maximal Schmidt rank of the tripartite state, defined as the regularization of its maximal Schmidt rank. Despite the difficulty caused by the super-multiplicative property, we provide explicit formulas for evaluating the asymptotic maximal Schmidt ranks of two important families of tripartite pure states, by resorting to certain results of the structure of matrix spaces, including the study of matrix semi-invariants. These formulas give a sufficient and necessary condition to determine whether a given tripartite pure state can be transformed to the bipartite maximally entangled state under SLOCC, in the asymptotic setting. Applying the recent progress on the non-commutative rank problem, we can verify this condition in deterministic polynomial time.

quant-ph↗

arXiv2017

$Q|SI\rangle$: A Quantum Programming Environment

This paper describes a quantum programming environment, named $Q|SI\rangle$. It is a platform embedded in the .Net language that supports quantum programming using a quantum extension of the $\mathbf{while}$-language. The framework of the platform includes a compiler of the quantum $\mathbf{while}$-language and a suite of tools for simulating quantum computation, optimizing quantum circuits, and analyzing and verifying quantum programs. Throughout the paper, using $Q|SI\rangle$ to simulate quantum behaviors on classical platforms with a combination of components is demonstrated. The scalable framework allows the user to program customized functions on the platform. The compiler works as the core of $Q|SI\rangle$ bridging the gap from quantum hardware to quantum software. The built-in decomposition algorithms enable the universal quantum computation on the present quantum hardware.

quant-ph↗

arXiv2017

A fast, wide-field and distortion-free telescope with curved detectors for surveys at ultra-low surface brightness

We present the design of an all-reflective, bi-folded Schmidt telescope aimed at surveys of extended astronomical objects with extremely-low surface brightness. The design leads to a high image quality without any diffracting spider, along with a large aperture and field of view, with a small central obstruction which barely alters the PSF. As an example, we present the design of a high-quality, 36 cm diameter, fast ( f /2.5) telescope working in the visible with a large field of view (1.6°x 2.6°). The telescope can operate with a curved detector (or with a flat detector with a field flattener) and a set of filters. The entrance mirror is anamorphic and replaces the classical Schmidt entrance corrector plate. We show that this anamorphic primary mirror can be manufactured through stress polishing, avoiding high spatial frequency errors, and tested with a simple interferometer scheme. This prototype is intended to serve as a fast-track scientific and technological pathfinder for the future space-based MESSIER mission.

astro-ph.IM↗

arXiv2017

Decoherence of Macroscopic Objects from Relativistic Effect

We study how the decoherence of macroscopic objects is induced intrisinically by relativistic effect. With the degree of freedom of center of mass (CM) characterizing the collective quantum state of a macroscopic object (MO), it is found that a MO consisting of N particles can decohere with time scale no more than sqrt(N). Here, the special relativity can induce the coupling of the collective motion mode and the relative motion modes in an order of 1/c2, which intrinsically results in the above minimum decoherence.

quant-ph↗