arXiv subjects
Publications and source records attributed to Xiaoming Sun.
In this letter, we revisit the {\em orbit problem}, which was studied in \cite{HAR69,SHA79,KL86}. In \cite{KL86}, Kannan and Lipton proved that this problem is decidable in polynomial time. In this paper, we study the {\em approximate orbit problem}, and show that this problem is decidable except for one case.
There are three different types of nondeterminism in quantum communication: i) $\nqp$-communication, ii) $\qma$-communication, and iii) $\qcma$-communication. In this \redout{paper} we show that multiparty $\nqp$-communication can be exponentially stronger than $\qcma$-communication. This also implies an exponential separation with respect to classical multiparty nondeterministic communication complexity. We argue that there exists a total function that is hard for $\qcma$-communication and easy for $\nqp$-communication. The proof of it involves an application of the pattern tensor method and a new lower bound for polynomial threshold degree. Another important consequence of this result is that nondeterministic rank can be exponentially lower than the discrepancy bound.
Sensitivity \cite{CD82,CDR86} and block sensitivity \cite{Nisan91} are two important complexity measures of Boolean functions. A longstanding open problem in decision tree complexity, the "Sensitivity versus Block Sensitivity" question, proposed by Nisan and Szegedy \cite{Nisan94} in 1992, is whether these two complexity measures are polynomially related, i.e., whether $bs(f)=O(s(f)^{O(1)})$. We prove an new upper bound on block sensitivity in terms of sensitivity: $bs(f) \leq 2^{s(f)-1} s(f)$. Previously, the best upper bound on block sensitivity was $bs(f) \leq (\frac{e}{\sqrt{2π}}) e^{s(f)} \sqrt{s(f)}$ by Kenyon and Kutin \cite{KK}. We also prove that if $\min\{s_0(f),s_1(f)\}$ is a constant, then sensitivity and block sensitivity are linearly related, i.e. $bs(f)=O(s(f))$.
As an important tool for information filtering in the era of socialized web, recommender systems have witnessed rapid development in the last decade. As benefited from the better interpretability, neighborhood-based collaborative filtering techniques, such as item-based collaborative filtering adopted by Amazon, have gained a great success in many practical recommender systems. However, the neighborhood-based collaborative filtering method suffers from the rating bound problem, i.e., the rating on a target item that this method estimates is bounded by the observed ratings of its all neighboring items. Therefore, it cannot accurately estimate the unobserved rating on a target item, if its ground truth rating is actually higher (lower) than the highest (lowest) rating over all items in its neighborhood. In this paper, we address this problem by formalizing rating estimation as a task of recovering a scalar rating function. With a linearity assumption, we infer all the ratings by optimizing the low-order norm, e.g., the $l_1/2$-norm, of the second derivative of the target scalar function, while remaining its observed ratings unchanged. Experimental results on three real datasets, namely Douban, Goodreads and MovieLens, demonstrate that the proposed approach can well overcome the rating bound problem. Particularly, it can significantly improve the accuracy of rating estimation by 37% than the conventional neighborhood-based methods.
Motivated by a hat guessing problem proposed by Iwasawa \cite{Iwasawa10}, Butler and Graham \cite{Butler11} made the following conjecture on the existence of certain way of marking the {\em coordinate lines} in $[k]^n$: there exists a way to mark one point on each {\em coordinate line} in $[k]^n$, so that every point in $[k]^n$ is marked exactly $a$ or $b$ times as long as the parameters $(a,b,n,k)$ satisfies that there are non-negative integers $s$ and $t$ such that $s+t = k^n$ and $as+bt = nk^{n-1}$. In this paper we prove this conjecture for any prime number $k$. Moreover, we prove the conjecture for the case when $a=0$ for general $k$.
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: $bs(f)=(2/3)s(f)^2-(1/3)s(f)$.
Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of $n$ players is assigned a hat from a given color set. Simultaneously, each player tries to guess the color of his/her own hat by looking at colors of hats worn by other players. In this paper, we consider a new variation of this game, in which we require at least $k$ correct guesses and no wrong guess for the players to win the game, but they can choose to "pass". A strategy is called {\em perfect} if it can achieve the simple upper bound $\frac{n}{n+k}$ of the winning probability. We present sufficient and necessary condition on the parameters $n$ and $k$ for the existence of perfect strategy in the hat guessing games. In fact for any fixed parameter $k$, the existence of perfect strategy can be determined for every sufficiently large $n$. In our construction we introduce a new notion: $(d_1,d_2)$-regular partition of the boolean hypercube, which is worth to study in its own right. For example, it is related to the $k$-dominating set of the hypercube. It also might be interesting in coding theory. The existence of $(d_1,d_2)$-regular partition is explored in the paper and the existence of perfect $k$-dominating set follows as a corollary.
Two-dimensional graphene offers interesting electronic, thermal and mechanical properties that are currently explored for advanced electronics, membranes and composites. Here we synthesize and explore the biological application of nano-graphene oxide NGO, single-layer graphene oxide sheets down to a few nanometers in lateral width. We develop functionalization chemistry to impart solubility and compatibility of NGO in biological environments. We obtain size separated pegylated NGO sheets that are soluble in buffers and serum without agglomeration. The NGO sheets are found to be photoluminescent in the visible and infrared regions. The intrinsic photoluminescence of NGO is used for live cell imaging in the near-infrared with little background. We found that simple physisorption via pi-stacking can be used for loading doxorubicin, a widely used cancer drug onto NGO functionalized with antibody for selective cancer cell killing in vitro. Owing to the small size, intrinsic optical properties, large specific surface area,low cost, and useful non-covalent interactions with aromatic drug molecules, NGO is a promising new material for biological and medical applications.
Graphene is an intriguing material with properties that are distinct from those of other graphitic systems. The first samples of pristine graphene were obtained by peeling off and epitaxial growth. Recently, the chemical reduction of graphite oxide was used to produce covalently functionalized single-layer graphene oxide. However, chemical approaches for the large-scale production of highly conducting graphene sheets remain elusive. Here, we report that the exfoliation-reintercalation-expansion of graphite can produce high-quality single-layer graphene sheets stably suspended in organic solvents. The graphene sheets exhibit high electrical conductance at room and cryogenic temperatures. Large amounts of graphene sheets in organic solvents are made into large transparent conducting films by Langmuir-Blodgett assembly in a layer-by-layer manner. The chemically derived high quality graphene sheets could lead to future scalable graphene devices.
It is known that many potent, often aromatic drugs are water insoluble, which has hampered their use for disease treatment. In this work, we functionalized nano-graphene oxide (NGO), a novel graphitic material, with branched polyethylene glycol (PEG) to obtain a biocompatible NGO-PEG conjugate stable in various biological solutions, and used them for attaching hydrophobic aromatic molecules including a camptothecin (CPT) analog, SN38 non-covalently via pi-pi stacking. The resulting NGO-PEG-SN38 complex exhibited excellent water solubility while maintaining its high cancer cell killing potency similar to that of the free SN38 molecules in organic solvents. The efficacy of NGO-PEG-SN38 was far higher than that of irinotecan (CPT-11), a FDA approved water soluble SN38 prodrug used for the treatment of colon cancer. Our results showed that graphene is a novel class of material promising for biological applications including future in vivo cancer treatment with various aromatic, low-solubility drugs.
Single-walled carbon nanotubes (SWNTs) are typically long (>100 nm) and have been well established as novel quasi one-dimensional systems with interesting electrical, mechanical, and optical properties. Here, quasi zero-dimensional SWNTs with finite lengths down to the molecular scale (7.5 nm in average) were obtained by length separation using a density gradient ultracentrifugation method. Different sedimentation rates of nanotubes with different lengths in a density gradient were taken advantage of to sort SWNTs according to length. Optical experiments on the SWNT fractions revealed that the UV-vis-NIR absorption and photoluminescence peaks of the ultrashort SWNTs blue-shift up to 30 meV compared to long nanotubes, owing to quantum confinement effects along the length of ultrashort SWNTs. These nanotube capsules essentially correspond to SWNT quantum dots.
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as multi-prover interactive proof systems. This paper develops a new method for proving limits of nonlocal strategies that make use of prior entanglement among players (or, provers, in the terminology of multi-prover interactive proofs). Instead of proving the limits for usual isolated provers who initially share entanglement, this paper proves the limits for "commuting-operator provers", who share private space, but can apply only such operators that are commutative with any operator applied by other provers. Commuting-operator provers are at least as powerful as usual isolated but prior-entangled provers, and thus, limits for commuting-operator provers immediately give limits for usual entangled provers. Using this method, we obtain an n-party generalization of the Tsirelson bound for the Clauser-Horne- Shimony-Holt inequality for every n. Our bounds are tight in the sense that, in every n-party case, the equality is achievable by a usual nonlocal strategy with prior entanglement. We also apply our method to a 3-prover 1-round binary interactive proof for NEXP. Combined with the technique developed by Kempe, Kobayashi, Matsumoto, Toner and Vidick to analyze the soundness of the proof system, it is proved to be NP-hard to distinguish whether the entangled value of a 3-prover 1-round binary-answer game is equal to 1 or at most 1-1/p(n) for some polynomial p, where n is the number of questions. This is in contrast to the 2-prover 1-round binary-answer case, where the corresponding problem is efficiently decidable. Alternatively, NEXP has a 3-prover 1-round binary interactive proof system with perfect completeness and soundness 1-2^{-poly}.
Single walled carbon nanotubes exhibit advanced electrical and surface properties useful for high performance nanoelectronics. Important to future manufacturing of nanotube circuits is large scale assembly of SWNTs into aligned forms. Despite progress in assembly and oriented synthesis, pristine SWNTs in aligned and close-packed form remain elusive and needed for high current, speed and density devices through collective operations of parallel SWNTs. Here, we develop a Langmuir Blodgett method achieving monolayers of aligned SWNTs with dense packing, central to which is a non covalent polymer functionalization by PmPV imparting high solubility and stability of SWNTs in an organic solvent DCE. Pressure cycling or annealing during LB film compression reduces hysteresis and facilitates high degree alignment and packing of SWNTs characterized by microscopy and polarized Raman spectroscopy. The monolayer SWNTs are readily patterned for device integration by microfabrication, enabling the highest currents 3mA through the narrowest regions packed with aligned SWNTs thus far.
In this paper we investigate the problem of searching monotone multi-dimensional arrays. We generalize Linial and Saks' search algorithm \cite{LS1} for monotone 3-dimensional arrays to $d$-dimensions with $d\geq 4$. Our new search algorithm is asymptotically optimal for $d=4$.
Without additional resources, it is often impossible to transform one entangled quantum state into another with local quantum operations and classical communication. Jonathan and Plenio [Phys. Rev. Lett. 83, 3566(1999)] presented an interesting example showing that the presence of another state, called a catalyst, enables such a transformation without changing the catalyst. They also pointed out that in general it is very hard to find an analytical condition under which a catalyst exists. In this paper we study the existence of catalysts for two incomparable quantum states. For the simplest case of $2\times 2$ catalysts for transformations from one $4\times 4$ state to another, a necessary and sufficient condition for existence is found. For the general case, we give an efficient polynomial time algorithm to decide whether a $k\times k$ catalyst exists for two $n\times n$ incomparable states, where $k$ is treated as a constant.