arXiv subjects

Jialin Zhang

Publications and source records attributed to Jialin Zhang.

At least 91 records · Page 5Linked to original sources

arXiv2020

Entanglement harvesting for Unruh-DeWitt detectors in circular motion

We study the properties of the transition probability and entanglement harvesting phenomenon for circularly accelerated detectors locally interacting with massless scalar fields. The dependence of the transition probability on the parameters associated with the circular motion is first analyzed in detail. By a cross-comparison with the situation of the uniformly accelerated motion, we obtain that the transition probability and the possible thermalization behavior for detectors rotating with an extremely large circular radius are analogous to that for uniformly accelerated detectors, but for a very small linear speed and a large acceleration, the effective temperature which characterizes the detectors' thermalization in a finite duration is much lower than that for uniformly accelerated detectors. We then focus on the phenomenon of entanglement harvesting in two special situations of circular trajectories, i.e., the coaxial rotation and the mutually perpendicular axial rotation by examining the concurrence as the entanglement measure in detail. We find that when two circularly accelerated detectors have equivalent acceleration and size of circular trajectory, the harvested entanglement rapidly decays with increasing acceleration or separation between two detectors. In contrast with the situation of uniform acceleration, the angular velocity would have significant impacts on entanglement harvesting. Especially for those detectors circularly moving in different directions, both the acceleration and trajectory radius play an important inhibiting role in entanglement harvesting. When two circularly accelerated detectors have different values of acceleration or angular velocity, we find that the entanglement can still be extracted by such detectors, even in the situation that one detector is at rest and the other is in a circular motion.

quant-ph↗

arXiv2020

Discouraging Pool Block Withholding Attacks in Bitcoins

The arisen of Bitcoin has led to much enthusiasm for blockchain research and block mining, and the extensive existence of mining pools helps its participants (i.e., miners) gain reward more frequently. Recently, the mining pools are proved to be vulnerable for several possible attacks, and pool block withholding attack is one of them: one strategic pool manager sends some of her miners to other pools and these miners pretend to work on the puzzles but actually do nothing. And these miners still get reward since the pool manager can not recognize these malicious miners. In this work, we revisit the game-theoretic model for pool block withholding attacks and propose a revised approach to reallocate the reward to the miners. Fortunately, in the new model, the pool managers have strong incentive to not launch such attacks. We show that for any number of mining pools, no-pool-attacks is always a Nash equilibrium. Moreover, with only two minority mining pools participating, no-pool-attacks is actually the unique Nash equilibrium.

cs.GT↗

arXiv2020

Optimization from Structured Samples for Coverage Functions

We revisit the optimization from samples (OPS) model, which studies the problem of optimizing objective functions directly from the sample data. Previous results showed that we cannot obtain a constant approximation ratio for the maximum coverage problem using polynomially many independent samples of the form $\{S_i, f(S_i)\}_{i=1}^t$ (Balkanski et al., 2017), even if coverage functions are $(1 - ε)$-PMAC learnable using these samples (Badanidiyuru et al., 2012), which means most of the function values can be approximately learned very well with high probability. In this work, to circumvent the impossibility result of OPS, we propose a stronger model called optimization from structured samples (OPSS) for coverage functions, where the data samples encode the structural information of the functions. We show that under three general assumptions on the sample distributions, we can design efficient OPSS algorithms that achieve a constant approximation for the maximum coverage problem. We further prove a constant lower bound under these assumptions, which is tight when not considering computational efficiency. Moreover, we also show that if we remove any one of the three assumptions, OPSS for the maximum coverage problem has no constant approximation.

cs.LG↗

arXiv2020

On a universal solution to the transport-of-intensity equation

Transport-of-intensity equation (TIE) is one of the most well-known approaches for phase retrieval and quantitative phase imaging. It directly recovers the quantitative phase distribution of an optical field by through-focus intensity measurements in a noninterferometic, deterministic manner. Nevertheless, the accuracy and validity of state-of-the-art TIE solvers depend on restrictive preknowledge or assumptions, including appropriate boundary conditions, a well-defined closed region, and quasi-uniform in-focus intensity distribution, which, however, cannot be strictly satisfied simultaneously under practical experimental conditions. In this Letter, we propose a universal solution to TIE with the advantages of high accuracy, convergence guarantee, applicability to arbitrarily-shaped regions, and simplified implementation and computation. With the "maximum intensity assumption", we firstly simplified TIE as a standard Possion equation to get an initial guess of the solution. Then the initial solution is further refined iteratively by solving the same Possion equation, and thus, the instability associated with the division by zero/small intensity values and large intensity variations can be effectively bypassed. Simulations and experiments with arbitrary phase, arbitrary aperture shapes, and nonuniform intensity distributions verify the effectiveness and universality of the proposed method.

eess.IV↗

arXiv2019

The BTZ black hole exhibits anti-Hawking phenomena

The Unruh effect is a surprising prediction of quantum field theory that asserts accelerating observers perceive a thermal spectrum of particles with a temperature proportional to their acceleration. However, it has recently been shown that particle detectors can click less often or even cool down as their acceleration increases, in contrast to the heating one would expect. This leads to the so called anti-Unruh phenomena. Here we consider detectors outside a BTZ black hole and demonstrate the existence of black hole analogues of these effects, which we dub anti-Hawking phenomena.

gr-qc↗

arXiv2019

Querying a Matrix through Matrix-Vector Products

We consider algorithms with access to an unknown matrix $M\in\mathbb{F}^{n \times d}$ via matrix-vector products, namely, the algorithm chooses vectors $\mathbf{v}^1, \ldots, \mathbf{v}^q$, and observes $M\mathbf{v}^1,\ldots, M\mathbf{v}^q$. Here the $\mathbf{v}^i$ can be randomized as well as chosen adaptively as a function of $ M\mathbf{v}^1,\ldots,M\mathbf{v}^{i-1}$. Motivated by applications of sketching in distributed computation, linear algebra, and streaming models, as well as connections to areas such as communication complexity and property testing, we initiate the study of the number $q$ of queries needed to solve various fundamental problems. We study problems in three broad categories, including linear algebra, statistics problems, and graph problems. For example, we consider the number of queries required to approximate the rank, trace, maximum eigenvalue, and norms of a matrix $M$; to compute the AND/OR/Parity of each column or row of $M$, to decide whether there are identical columns or rows in $M$ or whether $M$ is symmetric, diagonal, or unitary; or to compute whether a graph defined by $M$ is connected or triangle-free. We also show separations for algorithms that are allowed to obtain matrix-vector products only by querying vectors on the right, versus algorithms that can query vectors on both the left and the right. We also show separations depending on the underlying field the matrix-vector product occurs in. For graph problems, we show separations depending on the form of the matrix (bipartite adjacency versus signed edge-vertex incidence matrix) to represent the graph. Surprisingly, this fundamental model does not appear to have been studied on its own, and we believe a thorough investigation of problems in this model would be beneficial to a number of different application areas.

cs.CC↗

arXiv2019

Integrating high-quality dielectrics with one-nanometer equivalent oxide thickness on two-dimensional electronic devices

Two-dimensional (2D) semiconductors are widely recognized as attractive channel materials for low-power electronics. However, an unresolved challenge is the integration of high-quality, ultrathin high-\k{appa} dielectrics that fully meet the roadmap requirements for low-power applications. With a dangling-bond free surface, the deposition of dielectrics by atomic layer deposition (ALD) on 2D materials is usually characterized with non-uniform nucleation and island formation, producing a highly porous dielectric layer with serious leakage particularly at the small equivalent oxide thickness (EOT) limit. Here, we report the robust ALD of highly uniform high-\k{appa} dielectric on 2D semiconductors by using ~0.3 nm-thick exclusively monolayer molecular crystal as seeding layer. Ultrathin dielectrics down to 1 nm EOT is realized on graphene, MoS2 and WSe2, with considerably reduced roughness, density of interface states, leakage current and improved breakdown field compared to prior methods. Taking advantage of the reduced EOT, we demonstrate graphene RF transistors operating at 60 GHz, as well as MoS2 and WSe2 complementary metal-oxide-semiconductor (CMOS) transistors with Vdd =0.8 V and ideal subthreshold swing (SS) of 60 mV/dec, 20 nm-channel-length MoS2 transistors with on/off ratio over 10^7. These studies highlight that our dielectric integration method is generally applicable for different 2D materials, and compatible with top-down fabrication process on large-area chemical vapor deposited films.

physics.app-ph↗

arXiv2019

Speedup in Classical Simulation of Gaussian Boson Sampling

Gaussian boson sampling is a promising model for demonstrating quantum computational supremacy, which eases the experimental challenge of the standard boson-sampling proposal. Here by analyzing the computational costs of classical simulation of Gaussian boson sampling,we establish a lower bound for achieving quantum computational supremacy for a class of Gaussian boson-sampling problems, where squeezed states are injected into every input mode. Specifically, we propose a method for simplifying the brute-force calculations for the transition probabilities in Gaussian boson sampling, leading to a significant reduction of the simulation costs. Particularly, our numerical results indicate that we can simulate 18 photons Gaussian boson sampling at the output subspace on a normal laptop, 20 photons on a commercial workstation with 256 cores, and suggest about 30 photons for supercomputers. These numbers are significantly smaller than those in standard boson sampling, suggesting Gaussian boson sampling may be more feasible for demonstrating quantum computational supremacy.

quant-ph↗

arXiv2019

Strategyproof Mechanism for Two Heterogeneous Facilities with Constant Approximation Ratio

In this paper, we study the two-facility location game on a line with optional preference where the acceptable set of facilities for each agent could be different and an agent's cost is his distance to the closest facility within his acceptable set. The objective is to minimize the total cost of all agents while achieving strategyproofness. We design a deterministic strategyproof mechanism for the problem with approximation ratio of 2.75, improving upon the earlier best ratio of n/2+1.

cs.DS↗

arXiv2019

A Quantum-inspired Classical Algorithm for Separable Non-negative Matrix Factorization

Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intractable in general. In order to overcome this issue, the separability assumption is introduced which assumes all data points are in a conical hull. This assumption makes NMF tractable and is widely used in text analysis and image processing, but still impractical for huge-scale datasets. In this paper, inspired by recent development on dequantizing techniques, we propose a new classical algorithm for separable NMF problem. Our new algorithm runs in polynomial time in the rank and logarithmic in the size of input matrices, which achieves an exponential speedup in the low-rank setting.

cs.DS↗

arXiv2019

Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and envy-freeness. It is well known that a proportional allocation among $n$ agents can be found efficiently via simple protocols [16]. For envy-freeness, in a recent breakthrough, Aziz and Mackenzie [5] proposed a discrete and bounded envy-free protocol for any number of players. However, the protocol suffers from high multiple-exponential query complexity and it remains open to find simpler and more efficient envy-free protocols. In this paper we consider a variation of the cake cutting problem by assuming an underlying graph over the agents whose edges describe their acquaintance relationships, and agents evaluate their shares relatively to those of their neighbors. An allocation is called locally proportional if each agent thinks she receives at least the average value over her neighbors. Local proportionality generalizes proportionality and is in an interesting middle ground between proportionality and envy-freeness: its existence is guaranteed by that of an envy-free allocation, but no simple protocol is known to produce such a locally proportional allocation for general graphs. Previous works showed locally proportional protocols for special classes of graphs, and it is listed in both [1] and [8] as an open question to design simple locally proportional protocols for more general classes of graphs. In this paper we completely resolved this open question by presenting a discrete and bounded locally proportional protocol for any given graphs. Our protocol has a query complexity of only single exponential, which is significantly smaller than the six towers of $n$ query complexity of the envy-free protocol given in [5].

cs.DS↗

arXiv2019

Resolution analysis in a lens-free on-chip digital holographic microscope

Lens-free on-chip digital holographic microscopy (LFOCDHM) is a modern imaging technique whereby the sample is placed directly onto or very close to the digital sensor, and illuminated by a partially coherent source located far above it. The scattered object wave interferes with the reference (unscattered) wave at the plane where a digital sensor is situated, producing a digital hologram that can be processed in several ways to extract and numerically reconstruct an in-focus image using the back propagation algorithm. Without requiring any lenses and other intermediate optical components, the LFOCDHM has unique advantages of offering a large effective numerical aperture (NA) close to unity across the native wide field-of-view (FOV) of the imaging sensor in a cost-effective and compact design. However, unlike conventional coherent diffraction limited imaging systems, where the limiting aperture is used to define the system performance, typical lens-free microscopes only produce compromised imaging resolution that far below the ideal coherent diffraction limit. At least five major factors may contribute to this limitation, namely, the sample-to-sensor distance, spatial and temporal coherence of the illumination, finite size of the equally spaced sensor pixels, and finite extent of the image sub-FOV used for the reconstruction, which have not been systematically and rigorously explored until now. In this work, we derive five transfer function models that account for all these physical effects and interactions of these models on the imaging resolution of LFOCDHM. We also examine how our theoretical models can be utilized to optimize the optical design or predict the theoretical resolution limit of a given LFOCDHM system. We present a series of simulations and experiments to confirm the validity of our theoretical models.

physics.optics↗

arXiv2019

Thermodynamics of charged accelerating AdS black holes and holographic heat engines

Using a reasonable choice in normalizing the timelike Killing vector, we investigate the thermodynamic properties of charged accelerating Anti-de Sitter (AdS) black holes. We find that the expression of the thermodynamic mass in the first law of thermodynamics displays an inextricably intertwining behavior with the charge due to the unusual asymptotic structure of the accelerating black holes. Meanwhile, the thermodynamic length as a potential conjugate to the varying cosmic string tension is introduced and analyzed in detail, and the possible phase behavior of the charged accelerating black holes is also discussed in a standard thermodynamic analysis. Furthermore, we also investigate the properties of holographic heat engines with charged accelerating AdS black holes as the working substance in a benchmarking scheme. We find that the efficiencies of the black hole heat engines can be influenced by both the size of the benchmark circular cycle and the cosmic string tension. More interestingly, the existence of charge may significantly increase the efficiencies of the black hole heat engines and make them be more sensitive to a varying cosmic string tension. A cross-comparison of the efficiencies of different black hole heat engines suggests that the acceleration also increases the efficiency and renders it more sensitive as the charge varies.

hep-th↗

arXiv2019

An entropic feature selection method in perspective of Turing formula

Health data are generally complex in type and small in sample size. Such domain-specific challenges make it difficult to capture information reliably and contribute further to the issue of generalization. To assist the analytics of healthcare datasets, we develop a feature selection method based on the concept of Coverage Adjusted Standardized Mutual Information (CASMI). The main advantages of the proposed method are: 1) it selects features more efficiently with the help of an improved entropy estimator, particularly when the sample size is small, and 2) it automatically learns the number of features to be selected based on the information from sample data. Additionally, the proposed method handles feature redundancy from the perspective of joint-distribution. The proposed method focuses on non-ordinal data, while it works with numerical data with an appropriate binning method. A simulation study comparing the proposed method to six widely cited feature selection methods shows that the proposed method performs better when measured by the Information Recovery Ratio, particularly when the sample size is small.

cs.LG↗

arXiv2018

Entangling detectors in anti-de Sitter space

We examine in $(2+1)$-dimensional anti-de Sitter (AdS) space the phenomena of entanglement harvesting - the process in which a pair of detectors (two-level atoms) extract entanglement from a quantum field through local interactions with the field. We begin by reviewing the Unruh-DeWitt detector and its interaction with a real scalar field in the vacuum state, as well as the entanglement harvesting protocol in general. We then examine how the entanglement harvested by a pair of such detectors depends on their spacetime trajectory, separation, spacetime curvature, and boundary conditions satisfied by the field. The harvested entanglement is interpreted as an indicator of field entanglement between the localized regions where the detectors interact with the field, and thus this investigation allows us to probe indirectly the entanglement structure of the AdS vacuum. We find an island of separability for specific values of the detectors' energy gap and separation at intermediate values of the AdS length for which entanglement harvesting is not possible; an analogous phenomena is observed in AdS$_4$, to which we compare and contrast our results. In the process we examine how the transition probability of a single detector, as a proxy for local fluctuations of the field, depends on spacetime curvature, its location in AdS space, and boundary conditions satisfied by the field.

quant-ph↗

arXiv2018

Optimal illumination pattern for transport-of-intensity quantitative phase microscopy

The transport-of-intensity equation (TIE) is a well-established non-interferometric phase retrieval approach, which enables quantitative phase imaging (QPI) of transparent sample simply by measuring the intensities at multiple axially displaced planes. Nevertheless, it still suffers from two fundamentally limitations. First, it is quite susceptible to low-frequency errors (such as \cloudy" artifacts), which results from the poor contrast of the phase transfer function (PTF) near the zero frequency. Second, the reconstructed phase tends to blur under spatially low-coherent illumination, especially when the defocus distance is beyond the near Fresnel region. Recent studies have shown that the shape of the illumination aperture has a significant impact on the resolution and phase reconstruction quality, and by simply replacing the conventional circular illumination aperture with an annular one, these two limitations can be addressed, or at least significantly alleviated. However, the annular aperture was previously empirically designed based on intuitive criteria related to the shape of PTF, which does not guarantee optimality. In this work, we optimize the illumination pattern to maximize TIE's performance based on a combined quantitative criterion for evaluating the \goodness" of an aperture. In order to make the size of the solution search space tractable, we restrict our attention to binary coded axis-symmetric illumination patterns only, which are easier to implement and can generate isotropic TIE PTFs. We test the obtained optimal illumination by imaging both a phase resolution target and HeLa cells based on a small-pitch LED array, suggesting superior performance over other suboptimal patterns in terms of both signal-to-noise ratio (SNR) and spatial resolution.

eess.IV↗

arXiv2018

Accelerating AdS black holes as the holographic heat engines in a benchmarking scheme

We investigate the properties of holographic heat engines with an uncharged accelerating non-rotating AdS black hole as the working substance in a benchmarking scheme. We find that the efficiencies of the black hole heat engines can be influenced by both the size of the benchmark circular cycle and the cosmic string tension as a thermodynamic variable. In general, the efficiency can be increased by enlarging the cycle, but is still constrained by a universal bound $2π/(π+4)$ as expected. A cross-comparison of the efficiencies of the accelerating black hole heat engines and Schwarzschild-AdS black hole heat engines suggests that the acceleration also increases the efficiency although the amount of increase is not remarkable.

hep-th↗

arXiv2018

Coreness of Cooperative Games with Truncated Submodular Profit Functions

Coreness represents solution concepts related to core in cooperative games, which captures the stability of players. Motivated by the scale effect in social networks, economics and other scenario, we study the coreness of cooperative game with truncated submodular profit functions. Specifically, the profit function $f(\cdot)$ is defined by a truncation of a submodular function $σ(\cdot)$: $f(\cdot)=σ(\cdot)$ if $σ(\cdot)\geqη$ and $f(\cdot)=0$ otherwise, where $η$ is a given threshold. In this paper, we study the core and three core-related concepts of truncated submodular profit cooperative game. We first prove that whether core is empty can be decided in polynomial time and an allocation in core also can be found in polynomial time when core is not empty. When core is empty, we show hardness results and approximation algorithms for computing other core-related concepts including relative least-core value, absolute least-core value and least average dissatisfaction value.

cs.GT↗