arXiv subjects

Lin Chen

Publications and source records attributed to Lin Chen.

At least 415 records · Page 23Linked to original sources

arXiv2019

MoS$_2$ Dual-gate Transistors with Electrostatically Doped Contacts

Two-dimensional (2D) transition metal dichalcogenides (TMDs) such as molybdenum disulfide (MoS2) have been intensively investigated because of their exclusive physical properties for advanced electronics and optoelectronics. In the present work, we study the MoS2 transistor based on a novel tri-gate device architecture, with dual-gate (Dual-G) in the channel and the buried side-gate (Side-G) for the source/drain regions. All gates can be independently controlled without interference. For a MoS2 sheet with a thickness of 3.6 nm, the Schottky barrier (SB) and non-overlapped channel region can be effectively tuned by electrostatically doping the source/drain regions with Side-G. Thus, the extrinsic resistance can be effectively lowered, and a boost of the ON-state current can be achieved. Meanwhile, the channel control remains efficient under the Dual-G mode, with an ON-OFF current ratio of 3E7 and subthreshold swing of 83 mV/decade. The corresponding band diagram is also discussed to illustrate the device operation mechanism. This novel device structure opens up a new way toward fabrication of high-performance devices based on 2D-TMDs.

physics.app-ph↗

arXiv2019

Constructions of mutually unbiased entangled bases

We construct two mutually unbiased bases by maximally entangled states (MUMEB$s$) in $\mathbb{C}^{2}\otimes \mathbb{C}^{3}$. This is the first example of MUMEB$s$ in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ when $d\nmid d'$, namely $d'$ is not divisible by $d$. We show that they cannot be extended to four MUBs in $\mathbb{C}^6$. We propose a recursive construction of mutually unbiased bases formed by special entangled states with a fixed Schmidt number $k$ (MUSEB$k$s). It shows that $\min \{t_{1},t_{2}\}$ MUSEB$k_{1}k_{2}$s in $\mathbb{C}^{pd}\otimes \mathbb{C}^{qd'}$ can be constructed from $t_{1}$ MUSEB$k_{1}$s in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ and $t_{2}$ MUSEB$k_{2}$s in $\mathbb{C}^{p}\otimes \mathbb{C}^{q}$ for any $d,d',p,q$. Further, we show that three MUMEB$s$ exist in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ for any $d,d'$ with $d\mid d'$, and two MUMEB$s$ exist in $\mathbb{C}^{d}\otimes \mathbb{C}^{d'}$ for infinitely many $d,d'$ with $d\nmid d'$.

quant-ph↗

arXiv2019

Trade-off relation among genuine three-qubit nonlocalities in four-qubit systems

We study the trade-off relations satisfied by the genuine tripartite nonlocality in multipartite quantum systems. From the reduced three-qubit density matrices of the four-qubit generalized Greenberger-Horne-Zeilinger (GHZ) states and W states (4-qubit entangled state), we find that there exists a trade-off relation among the mean values of the Svetlichny operators associated with these reduced states. Namely, the genuine three-qubit nonlocalities are not independent. For four-qubit generalized GHZ states and W states, the summation of all their three-qubit maximal (squared) mean values of the Svetlichny operator has an upper bound. This bound is better than the one derived from the upper bounds of individual three-qubit mean values of the Svetlichny operator. Detailed examples are presented to illustrate the trade-off relation among the three-qubit nonlocalities.

quant-ph↗

arXiv2019

Open-Ended Visual Question Answering by Multi-Modal Domain Adaptation

We study the problem of visual question answering (VQA) in images by exploiting supervised domain adaptation, where there is a large amount of labeled data in the source domain but only limited labeled data in the target domain with the goal to train a good target model. A straightforward solution is to fine-tune a pre-trained source model by using those limited labeled target data, but it usually cannot work well due to the considerable difference between the data distributions of the source and target domains. Moreover, the availability of multiple modalities (i.e., images, questions and answers) in VQA poses further challenges to model the transferability between those different modalities. In this paper, we tackle the above issues by proposing a novel supervised multi-modal domain adaptation method for VQA to learn joint feature embeddings across different domains and modalities. Specifically, we align the data distributions of the source and target domains by considering all modalities together as well as separately for each individual modality. Based on the extensive experiments on the benchmark VQA 2.0 and VizWiz datasets for the realistic open-ended VQA task, we demonstrate that our proposed method outperforms the existing state-of-the-art approaches in this challenging domain adaptation setting for VQA.

cs.CV↗

arXiv2019

Stationary Ring and Concentric-Ring Solutions of the Keller-Segel Model with Quadratic Diffusion

This paper investigates the Keller-Segel model with quadratic cellular diffusion over a disk in $\mathbb R^2$ with a focus on the formation of its nontrivial patterns. We obtain explicit formulas of radially symmetric stationary solutions and such configurations give rise to the ring patterns and concentric airy patterns. These explicit formulas empower us to study the global bifurcation and asymptotic behaviors of these solutions, within which the cell population density has $δ$-type spiky structures when the chemotaxis rate is large. The explicit formulas are also used to study the uniqueness and quantitative properties of nontrivial stationary radial patterns ruled by several threshold phenomena determined by the chemotaxis rate. We find that all nonconstant radial stationary solutions must have the cellular density compactly supported unless for a discrete sequence of bifurcation values at which there exist strictly positive small-amplitude solutions. The hierarchy of free energy shows that in the radial class the inner ring solution has the least energy while the constant solution has the largest energy, and all these theoretical results are illustrated through bifurcation diagrams. A natural extension of our results to $\mathbb R^2$ yields the existence, uniqueness and closed-form solution of the problem in this whole space. Our results are complemented by numerical simulations that demonstrate the existence of non-radial stationary solutions in the disk.

math.AP↗

arXiv2019

MAT: A simple yet strong baseline for identifying self-admitted technical debt

In the process of software evolution, developers often sacrifice the long-term code quality to satisfy the short-term goals due to specific reasons, which is called technical debt. In particular, self-admitted technical debt (SATD) refers to those that were intentionally introduced and remarked by code comments. Those technical debts reduce the quality of software and increase the cost of subsequent software maintenance. Therefore, it is necessary to find out and resolve these debts in time. Recently, many approaches have been proposed to identify SATD. However, those approaches either have a low accuracy or are complex to implementation in practice. In this paper, we propose a simple unsupervised baseline approach that fuzzily matches task annotation tags (MAT) to identify SATD. MAT does not need any training data to build a prediction model. Instead, MAT only examines whether any of four task tags (i.e. TODO, FIXME, XXX, and HACK) appears in the comments of a target project to identify SATD. In this sense, MAT is a natural baseline approach, which has a good understandability, in SATD identification. In order to evaluate the usefulness of MAT, we use 10 open-source projects to conduct the experiment. The experimental results reveal that MAT has a surprisingly excellent performance for SATD identification compared with the state-of-the-art approaches. As such, we suggest that, in the future SATD identification studies, MAT should be considered as an easy-to-implement baseline to which any new approach should be compared against to demonstrate its usefulness.

cs.SE↗

arXiv2019

Locality-Sensitive Hashing for f-Divergences: Mutual Information Loss and Beyond

Computing approximate nearest neighbors in high dimensional spaces is a central problem in large-scale data mining with a wide range of applications in machine learning and data science. A popular and effective technique in computing nearest neighbors approximately is the locality-sensitive hashing (LSH) scheme. In this paper, we aim to develop LSH schemes for distance functions that measure the distance between two probability distributions, particularly for f-divergences as well as a generalization to capture mutual information loss. First, we provide a general framework to design LHS schemes for f-divergence distance functions and develop LSH schemes for the generalized Jensen-Shannon divergence and triangular discrimination in this framework. We show a two-sided approximation result for approximation of the generalized Jensen-Shannon divergence by the Hellinger distance, which may be of independent interest. Next, we show a general method of reducing the problem of designing an LSH scheme for a Krein kernel (which can be expressed as the difference of two positive definite kernels) to the problem of maximum inner product search. We exemplify this method by applying it to the mutual information loss, due to its several important applications such as model compression.

cs.LG↗

arXiv2019

Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback

In this paper, we propose three online algorithms for submodular maximisation. The first one, Mono-Frank-Wolfe, reduces the number of per-function gradient evaluations from $T^{1/2}$ [Chen2018Online] and $T^{3/2}$ [chen2018projection] to 1, and achieves a $(1-1/e)$-regret bound of $O(T^{4/5})$. The second one, Bandit-Frank-Wolfe, is the first bandit algorithm for continuous DR-submodular maximization, which achieves a $(1-1/e)$-regret bound of $O(T^{8/9})$. Finally, we extend Bandit-Frank-Wolfe to a bandit algorithm for discrete submodular maximization, Responsive-Frank-Wolfe, which attains a $(1-1/e)$-regret bound of $O(T^{8/9})$ in the responsive bandit setting.

cs.LG↗

arXiv2019

New Bounds on Augmenting Steps of Block-structured Integer Programs

We consider 4-block $n$-fold integer programs, whose constraint matrix consists of $n$ copies of small matrices $A$, $B$, and $D$, and one copy of $C$, in a specific block structure. All existing algorithms along this line of research follows an iterative augmentation framework, which relies on the so-called Graver basis of the constraint matrix that constitutes a set of fundamental augmenting steps. Bounding the $\ell_1$- or $\ell_\infty$-norm of elements of the Graver basis is the key to these algorithms. Hemmecke et al.~[Math. Prog. 2014] showed that 4-block $n$-fold IP has Graver elements of $\ell_\infty$-norm at most $O_{FPT}(n^{2^{s_{D}}})$, leading to an algorithm with a similar runtime; here, $s_{D}$ is the number of rows of matrix $D$ and $ O_{FPT}(1)$ hides a multiplicative factor that is only dependent on the small matrices $A,B,C,D$. We prove that the $\ell_{\infty}$-norm of the Graver elements of 4-block $n$-fold IP is upper bounded by $O_{FPT}(n^{s_{D}})$, improving significantly over the previous bound $O_{FPT} (n^{2^{s_{D}}})$. We also provide a matching lower bound of $Ω(n^{s_{D}})$ which even holds for arbitrary non-zero lattice elements, ruling out augmenting algorithm relying on even more restricted notions of augmentation than the Graver basis. We then consider a special case of 4-block $n$-fold in which $C$ is a zero matrix, called 3-block $n$-fold IP. We show that while even there the $\ell_{\infty}$-norm of its Graver elements is $Ω(n^{s_{D}})$, there exists a different decomposition into lattice elements whose $\ell_{\infty}$-norm is bounded by $ O_{FPT}(1)$, which allows us to provide improved upper bounds on the $\ell_{\infty}$-norm of Graver elements for 3-block $n$-fold IP.

cs.DS↗

arXiv2019

Mutually unbiased bases containing a complex Hadamard matrix of Schmidt rank three

Constructing four six-dimensional mutually unbiased bases (MUBs) is an open problem in quantum physics and measurement. We investigate the existence of four MUBs including the identity, and a complex Hadamard matrix (CHM) of Schmidt rank three. The CHM is equivalent to a controlled unitary operation on the qubit-qutrit system via local unitary transformation $I_2\otimes V$ and $I_2\otimes W$. We show that $V$ and $W$ have no zero entry, and apply it to exclude examples as members of MUBs. We further show that the maximum of entangling power of controlled unitary operation is $\log_2 3$ ebits. We derive the condition under which the maximum is achieved, and construct concrete examples. Our results describe the phenomenon that if a CHM of Schmidt rank three belongs to an MUB then its entangling power may not reach the maximum.

quant-ph↗

arXiv2019

Private and Atomic Exchange of Assets over Zero Knowledge Based Payment Ledger

Bitcoin brings a new type of digital currency that does not rely on a central system to maintain transactions. By benefiting from the concept of decentralized ledger, users who do not know or trust each other can still conduct transactions in a peer-to-peer manner. Inspired by Bitcoin, other cryptocurrencies were invented in recent years such as Ethereum, Dash, Zcash, Monero, Grin, etc. Some of these focus on enhancing privacy for instance crypto note or systems that apply the similar concept of encrypted notes used for transactions to enhance privacy (e.g., Zcash, Monero). However, there are few mechanisms to support the exchange of privacy-enhanced notes or assets on the chain, and at the same time preserving the privacy of the exchange operations. Existing approaches for fair exchanges of assets with privacy mostly rely on off-chain/side-chain, escrow or centralized services. Thus, we propose a solution that supports oblivious and privacy-protected fair exchange of crypto notes or privacy enhanced crypto assets. The technology is demonstrated by extending zero-knowledge based crypto notes. To address "privacy" and "multi-currency", we build a new zero-knowledge proving system and extend note format with new property to represent various types of tokenized assets or cryptocurrencies. By extending the payment protocol, exchange operations are realized through privacy enhanced transactions (e.g., shielded transactions). Based on the possible scenarios during the exchange operation, we add new constraints and conditions to the zero-knowledge proving system used for validating transactions publicly.

cs.CR↗

arXiv2019

Entanglement distillation in terms of a conjectured matrix inequality

Entanglement distillation is a basic task in quantum information, and the distillable entanglement of three bipartite reduced density matrices from a tripartite pure state has been studied in [Phys. Rev. A 84, 012325 (2011)]. We extend this result to tripartite mixed states by studying a conjectured matrix inequality, namely $\mathop{\rm rank}(\sum_i R_i \otimes S_i)\leq K \mathop{\rm rank}(\sum_i R_i^T \otimes S_i)$ holds for any bipartite matrix $M=\sum_i R_i \otimes S_i$ and Schmidt rank $K$. We prove that the conjecture holds for $M$ with $K=3$ and some special $M$ with arbitrary $K$.

quant-ph↗

arXiv2019

Differentially Private Aggregated Mobility Data Publication Using Moving Characteristics

With the rapid development of GPS enabled devices (smartphones) and location-based applications, location privacy is increasingly concerned. Intuitively, it is widely believed that location privacy can be preserved by publishing aggregated mobility data, such as the number of users in an area at some time. However, a recent attack shows that these aggregated mobility data can be exploited to recover individual trajectories. In this paper, we first propose two differentially private basic schemes for aggregated mobility data publication, namely direct perturbation and threshold perturbation, which preserve location privacy of users and especially resist the trajectory recovery attack. Then, we explore the moving characteristics of mobile users, and design an improved scheme named static hybrid perturbation by combining the two basic schemes according to the moving characteristics. Since static hybrid perturbation works only for static data, which are entirely available before publishing, we further adapt the static hybrid perturbation by combining it with linear regression, and yield another improved scheme named dynamic hybrid perturbation. The dynamic hybrid perturbation works also for dynamic data, which are generated on the fly during publication. Privacy analysis shows that the proposed schemes achieve differential privacy. Extensive experiments on both simulated and real datasets demonstrate that all proposed schemes resist the trajectory recovery attack well, and the improved schemes significantly outperform the basic schemes.

cs.CR↗

arXiv2019

A matrix inequality related to the entanglement distillation problem

The pure entangled state is of vital importance in the field of quantum information. The process of asymptotically extracting pure entangled states from many copies of mixed states via local operations and classical communication is called entanglement distillation. The entanglement distillability problem, which is a long-standing open problem, asks whether such process exists. The 2-copy undistillability of $4\times4$ undistillable Werner states has been reduced to the validness of the a matrix inequality, that is, the sum of the squares of the largest two singular values of matrix $A\otimes I + I \otimes B$ does not exceed $(3d-4)/d^2$ with $A,B$ traceless $d\times d$ matrices and $||A||_F^2+||B||_F^2=1/d$ when $d=4$. The latest progress, made by Ł.~Pankowski~ et al~[IEEE Trans. Inform. Theory, 56, 4085 (2010)], shows that this conjecture holds when both matrices $A$ and $B$ are normal. In this paper, we prove that the conjecture holds when one of matrices $A$ and $B$ is normal and the other one is arbitrary. Our work makes solid progress towards this conjecture and thus the distillability problem.

quant-ph↗

arXiv2019

Construction of genuine multipartite entangled states

Genuine multipartite entanglement is of great importance in quantum information, especially from the experimental point of view. Nevertheless, it is difficult to construct genuine multipartite entangled states systematically, because the genuine multipartite entanglement is unruly. We propose another product based on the Kronecker product in this paper. The Kronecker product is a common product in quantum information with good physical interpretation. We mainly investigate whether the proposed product of two genuine multipartite entangled states is still a genuine entangled one. We understand the entanglement of the proposed product better by characterizing the entanglement of the Kronecker product. Then we show the proposed product is a genuine multipartite entangled state in two cases. The results provide a systematical method to construct genuine multipartite entangled states of more parties.

quant-ph↗

arXiv2019

Surface/State correspondence and $T\overline{T}$ deformation

The surface/state correspondence suggests that the bulk co-dimensional two surface could be dual to the quantum state in the holographic conformal field theory(CFT). Inspired by the cutoff-AdS/$T\overline{T}$-deformed-CFT correspondence, we propose that the quantum states of two-dimensional $T\overline{T}$-deformed holographic CFT are dual to some particular surfaces in the AdS$_3$ gravity. In particular, the time slice of the cut-off surface is dual to the ground state of the $T\overline{T}$-deformed CFT. We examine our proposal by studying the entanglement entropy and quantum information metric. We find that the complexity of the ground state in the deformed theory is consistent with the one of a particular cMERA and the holographic complexity via CV or CA prescription.

hep-th↗

arXiv2019

Faster quantum computation with permutations and resonant couplings

Recently, there has been increasing interest in designing schemes for quantum computations that are robust against errors. Although considerable research has been devoted to developing quantum error correction schemes, much less attention has been paid to optimizing the speed it takes to perform a quantum computation and developing computation models that act on decoherence-free subspaces. Speeding up a quantum computation is important, because fewer errors are likely to result. Encoding quantum information in a decoherence-free subspace is also important, because errors would be inherently suppressed. In this paper, we consider quantum computation in a decoherence-free subspace and also optimize its speed. To achieve this, we perform certain single-qubit quantum computations by simply permuting the underlying qubits. Together with exchange-interactions or Ising-interactions and other resonant couplings, we present a new scheme for quantum computation that potentially improves the speed in which a quantum computation can be done.

quant-ph↗

arXiv2019

Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free

How can we efficiently mitigate the overhead of gradient communications in distributed optimization? This problem is at the heart of training scalable machine learning models and has been mainly studied in the unconstrained setting. In this paper, we propose Quantized-Frank-Wolfe (QFW), the first projection-free and communication-efficient algorithm for solving constrained optimization problems at scale. We consider both convex and non-convex objective functions, expressed as a finite-sum or more generally a stochastic optimization problem, and provide strong theoretical guarantees on the convergence rate of QFW. This is accomplished by proposing novel quantization schemes that efficiently compress gradients while controlling the noise variance introduced during this process. Finally, we empirically validate the efficiency of QFW in terms of communication and the quality of returned solution against natural baselines.

cs.LG↗