Haplogroup N-M231 of human Y chromosome is a common clade from Eastern Asia to Northern Europe, being one of the most frequent haplogroups in Altaic and Uralic-speaking populations. Using newly discovered bi-allelic markers from high-throughput DNA s
equencing, we largely improved the phylogeny of Haplogroup N, in which 16 subclades could be identified by 33 SNPs. More than 400 males belonging to Haplogroup N in 34 populations in China were successfully genotyped, and populations in Northern Asia and Eastern Europe were also compared together. We found that all the N samples were typed as inside either clade N1-F1206 (including former N1a-M128, N1b-P43 and N1c-M46 clades), most of which were found in Altaic, Uralic, Russian and Chinese-speaking populations, or N2-F2930, common in Tibeto-Burman and Chinese-speaking populations. Our detailed results suggest that Haplogroup N developed in the region of China since the final stage of late Paleolithic Era.
The recent renaissance of black phosphorus (BP) as a two-dimensional 2D layered material has generated tremendous interest in its tunable electronic band gap and highly anisotropic transport properties that offer new opportunities for device applicat
ions. Many of these outstanding properties are attributed to its unique structural characters that still need elucidation. Here we show Raman measurements that reveal an ultralow-frequency collective compression mode (CCM), which is unprecedented among similar 2D layered materials. This novel CCM indicates an unusually strong interlayer coupling in BP, which is quantitatively supported by a phonon frequency analysis and first-principles calculations. Moreover, the CCM and another branch of low-frequency Raman modes shift sensitively with changing number of layers, allowing an accurate determination of the thickness up to tens of atomic layers, which is considerably higher than those previously achieved by using high-frequency Raman modes. These results offer fundamental insights and practical tools for exploring multilayer BP in new device applications.
The recently discovered layered BiS2-based superconductors have attracted a great deal of interest due to their structural similarity to cuprate and iron-pnictide superconductors. We have performed Raman scattering measurements on two superconducting
crystals NdO0.5F0.5BiS2 (Tc = 4.5 K) and NdO0.7F0.3BiS2 (Tc = 4.8 K). The observed Raman phonon modes are assigned with the aid of first-principles calculations. The asymmetrical phonon mode around 118 cm-1 reveals a small electron-phonon (e-ph) coupling constant 0.16, which is insufficient to generate superconductivity at ~ 4.5 K. In the Raman spectra there exists a clear temperature-dependent hump around 100 cm-1, which can be well understood in term of inter-band vertical transitions around Fermi surface. The transitions get boosted when the particular rectangular-like Fermi surface meets band splitting caused by spin-orbit coupling. It enables a unique and quantitative insight into the band splitting.
Isolated qubits are a special class of quantum devices, which can be used to implement tamper-resistant cryptographic hardware such as one-time memories (OTMs). Unfortunately, these OTM constructions leak some information, and standard methods for pr
ivacy amplification cannot be applied here, because the adversary has advance knowledge of the hash function that the honest parties will use. In this paper we show a stronger form of privacy amplification that solves this problem, using a fixed hash function that is secure against all possible adversaries in the isolated qubits model. This allows us to construct single-bit OTMs which only leak an exponentially small amount of information. We then study a natural generalization of the isolated qubits model, where the adversary is allowed to perform a polynomially-bounded number of entangling gates, in addition to unbounded local operations and classical communication (LOCC). We show that our technique for privacy amplification is also secure in this setting.
One-time memories (OTMs) are simple, tamper-resistant cryptographic devices, which can be used to implement sophisticated functionalities such as one-time programs. Can one construct OTMs whose security follows from some physical principle? This is n
ot possible in a fully-classical world, or in a fully-quantum world, but there is evidence that OTMs can be built using isolated qubits -- qubits that cannot be entangled, but can be accessed using adaptive sequences of single-qubit measurements. Here we present new constructions for OTMs using isolated qubits, which improve on previous work in several respects: they achieve a stronger single-shot security guarantee, which is stated in terms of the (smoothed) min-entropy; they are proven secure against adversaries who can perform arbitrary local operations and classical communication (LOCC); and they are efficiently implementable. These results use Wiesners idea of conjugate coding, combined with error-correcting codes that approach the capacity of the q-ary symmetric channel, and a high-order entropic uncertainty relation, which was originally developed for cryptography in the bounded quantum storage model.
One-time memories (OTMs) are simple tamper-resistant cryptographic devices, which can be used to implement one-time programs, a very general form of software protection and program obfuscation. Here we investigate the possibility of building OTMs usi
ng quantum mechanical devices. It is known that OTMs cannot exist in a fully-quantum world or in a fully-classical world. Instead, we propose a new model based on isolated qubits -- qubits that can only be accessed using local operations and classical communication (LOCC). This model combines a quantum resource (single-qubit measurements) with a classical restriction (on communication between qubits), and can be implemented using current technologies, such as nitrogen vacancy centers in diamond. In this model, we construct OTMs that are information-theoretically secure against one-pass LOCC adversaries that use 2-outcome measurements. Our construction resembles Wiesners old idea of quantum conjugate coding, implemented using random error-correcting codes; our proof of security uses entropy chaining to bound the supremum of a suitable empirical process. In addition, we conjecture that our random codes can be replaced by some class of efficiently-decodable codes, to get computationally-efficient OTMs that are secure against computationally-bounded LOCC adversaries. In addition, we construct data-hiding states, which allow an LOCC sender to encode an (n-O(1))-bit messsage into n qubits, such that at most half of the message can be extracted by a one-pass LOCC receiver, but the whole message can be extracted by a general quantum receiver.
Atomically thin MoS$_{2}$ crystals have been recognized as a quasi-2D semiconductor with remarkable physics properties. This letter reports our Raman scattering measurements on multilayer and monolayer MoS$_{2}$, especially in the low-frequency range
($<$50 cm$^{-1}$). We find two low-frequency Raman modes with contrasting thickness dependence. With increasing the number of MoS$_{2}$ layers, one shows a significant increase in frequency while the other decreases following a 1/N (N denotes layer-number) trend. With the aid of first-principle calculations we assign the former as the shear mode $E_{2g}^{2}$ and the latter as the compression vibrational mode. The opposite evolution of the two modes with thickness demonstrates novel vibrational modes in atomically thin crystal as well as a new and more precise way to characterize thickness of atomically thin MoS$_{2}$ films. In addition, we observe a broad feature around 38 cm$^{-1}$ (~5 meV) which is visible only under near-resonance excitation and pinned at the fixed energy independent of thickness. We interpret the feature as an electronic Raman scattering associated with the spin-orbit coupling induced splitting in conduction band at K points in their Brillouin zone.
Accurate vehicular localization is important for various cooperative vehicle safety (CVS) applications such as collision avoidance, turning assistant, etc. In this paper, we propose a cooperative vehicular distance measurement technique based on the
sharing of GPS pseudorange measurements and a weighted least squares method. The classic double difference pseudorange solution, which was originally designed for high-end survey level GPS systems, is adapted to low-end navigation level GPS receivers for its wide availability in ground vehicles. The Carrier to Noise Ratio (CNR) of raw pseudorange measurements are taken into account for noise mitigation. We present a Dedicated Short Range Communications (DSRC) based mechanism to implement the exchange of pseudorange information among neighboring vehicles. As demonstrated in field tests, our proposed technique increases the accuracy of the distance measurement significantly compared with the distance obtained from the GPS fixes.
We study the problem of reconstructing an unknown matrix M of rank r and dimension d using O(rd poly log d) Pauli measurements. This has applications in quantum state tomography, and is a non-commutative analogue of a well-known problem in compressed
sensing: recovering a sparse vector from a few of its Fourier coefficients. We show that almost all sets of O(rd log^6 d) Pauli measurements satisfy the rank-r restricted isometry property (RIP). This implies that M can be recovered from a fixed (universal) set of Pauli measurements, using nuclear-norm minimization (e.g., the matrix Lasso), with nearly-optimal bounds on the error. A similar result holds for any class of measurements that use an orthonormal operator basis whose elements have small operator norm. Our proof uses Dudleys inequality for Gaussian processes, together with bounds on covering numbers obtained via entropy duality.
We study quantum algorithms for testing bipartiteness and expansion of bounded-degree graphs. We give quantum algorithms that solve these problems in time O(N^(1/3)), beating the Omega(sqrt(N)) classical lower bound. For testing expansion, we also pr
ove an Omega(N^(1/4)) quantum query lower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantum algorithms follow from a combination of classical property testing techniques due to Goldreich and Ron, derandomization, and the quantum algorithm for element distinctness. The quantum lower bound is obtained by the polynomial method, using novel algebraic techniques and combinatorial analysis to accommodate the graph structure.
