Superluminal propagation of an optical pulse in a Doppler broadened three-state, single channel active Raman gain medium

Using a single channel active Raman gain medium we show a $(220\pm 20)$ns advance time for an optical pulse of $\tau_{FWHM}=15.4 \mu$s propagating through a 10 cm medium, a lead time that is comparable to what was reported previously. In addition, we have verified experimentally all the features associated with this single channel Raman gain system. Our results show that the reported gain-assisted superluminal propagation should not be attributed to the interference between the two frequencies of the pump field.Comment: 4 pages, 3 figure

Period halving of Persistent Currents in Mesoscopic Mobius ladders

We investigate the period halving of persistent currents(PCs) of non-interacting electrons in isolated mesoscopic M\"{o}bius ladders without disorder, pierced by Aharonov-Bhom flux. The mechanisms of the period halving effect depend on the parity of the number of electrons as well as on the interchain hopping. Although the data of PCs in mesoscopic systems are sample-specific, some simple rules are found in the canonical ensemble average, such as all the odd harmonics of the PCs disappear, and the signals of even harmonics are non-negative. {PACS number(s): 73.23.Ra, 73.23.-b, 68.65.-k}Comment: 6 Pages with 3 EPS figure

Quantum secret sharing between m-party and n-party with six states

We propose a quantum secret sharing scheme between $m$-party and $n$-party using three conjugate bases, i.e. six states. A sequence of single photons, each of which is prepared in one of the six states, is used directly to encode classical information in the quantum secret sharing process. In this scheme, each of all $m$ members in group 1 choose randomly their own secret key individually and independently, and then directly encode their respective secret information on the states of single photons via unitary operations, then the last one (the $m$th member of group 1) sends $1/n$ of the resulting qubits to each of group 2. By measuring their respective qubits, all members in group 2 share the secret information shared by all members in group 1. The secret message shared by group 1 and group 2 in such a way that neither subset of each group nor the union of a subset of group 1 and a subset of group 2 can extract the secret message, but each whole group (all the members of each group) can. The scheme is asymptotically 100% in efficiency. It makes the Trojan horse attack with a multi-photon signal, the fake-signal attack with EPR pairs, the attack with single photons, and the attack with invisible photons to be nullification. We show that it is secure and has an advantage over the one based on two conjugate bases. We also give the upper bounds of the average success probabilities for dishonest agent eavesdropping encryption using the fake-signal attack with any two-particle entangled states. This protocol is feasible with present-day technique.Comment: 7 page

Evidence for the Collective Nature of the Reentrant Integer Quantum Hall States of the Second Landau Level

We report an unexpected sharp peak in the temperature dependence of the magnetoresistance of the reentrant integer quantum Hall states in the second Landau level. This peak defines the onset temperature of these states. We find that in different spin branches the onset temperatures of the reentrant states scale with the Coulomb energy. This scaling provides direct evidence that Coulomb interactions play an important role in the formation of these reentrant states evincing their collective nature

Efficient symmetric multiparty quantum state sharing of an arbitrary m-qubit state

We present a scheme for symmetric multiparty quantum state sharing of an arbitrary $m$-qubit state with $m$ Greenberger-Horne-Zeilinger states following some ideas from the controlled teleportation [Phys. Rev. A \textbf{72}, 02338 (2005)]. The sender Alice performs $m$ Bell-state measurements on her $2m$ particles and the controllers need only to take some single-photon product measurements on their photons independently, not Bell-state measurements, which makes this scheme more convenient than the latter. Also it does not require the parties to perform a controlled-NOT gate on the photons for reconstructing the unknown $m$-qubit state and it is an optimal one as its efficiency for qubits approaches the maximal value.Comment: 6 pages, no figures; It simplifies the process for sharing an arbitrary m-qubit state in Phys. Rev. A 72, 022338 (2005) (quant-ph/0501129

The Least-core and Nucleolus of Path Cooperative Games

Cooperative games provide an appropriate framework for fair and stable profit distribution in multiagent systems. In this paper, we study the algorithmic issues on path cooperative games that arise from the situations where some commodity flows through a network. In these games, a coalition of edges or vertices is successful if it enables a path from the source to the sink in the network, and lose otherwise. Based on dual theory of linear programming and the relationship with flow games, we provide the characterizations on the CS-core, least-core and nucleolus of path cooperative games. Furthermore, we show that the least-core and nucleolus are polynomially solvable for path cooperative games defined on both directed and undirected network

Quantum secure direct communication network with superdense coding and decoy photons

A quantum secure direct communication network scheme is proposed with quantum superdense coding and decoy photons. The servers on a passive optical network prepare and measure the quantum signal, i.e., a sequence of the $d$-dimensional Bell states. After confirming the security of the photons received from the receiver, the sender codes his secret message on them directly. For preventing a dishonest server from eavesdropping, some decoy photons prepared by measuring one photon in the Bell states are used to replace some original photons. One of the users on the network can communicate any other one. This scheme has the advantage of high capacity, and it is more convenient than others as only a sequence of photons is transmitted in quantum line.Comment: 6 pages, 2 figur

Probabilistic teleportation of unknown two-particle state via POVM

We propose a scheme for probabilistic teleportation of unknown two-particle state with partly entangled four-particle state via POVM. In this scheme the teleportation of unknown two-particle state can be realized with certain probability by performing two Bell state measurements, a proper POVM and a unitary transformation.Comment: 5 pages, no figur

Revisiting the characteristics of the spectral lags in short gamma-ray bursts

In this paper, we restudy the spectral lag features of short bright gamma-ray bursts (T90 < 2.6s) with a BATSE time-tagged event (TTE) sample including 65 single pulse bursts. We also make an investigation on the characteristics of ratios between the spectral lag and the full width at half maximum ($FWHM$) of the pulses, called relative spectral lags (RSLs). We draw the conclusions as follows: 1) Spectral lags of short GRBs are normally distributed and concentrated on around the value of 0.014 with 40 percent of them having negative lags. With K-S test, we find the lag distribution is identical with a normal one caused by white noises, which indicates the lags of the vast majority of short bursts are so small that they are negligible as Norris et al. have suggested.Comment: 10 pages, 3 figures, accepted for publication in MNRA