arXiv subjects

Ping Zhou

Publications and source records attributed to Ping Zhou.

At least 163 records · Page 9Linked to original sources

arXiv2009

Nanotechnology as a Field of Science: Its Delineation in terms of Journals and Patents

The Journal Citation Reports of the Science Citation Index 2004 were used to delineate a core set of nanotechnology journals and a nanotechnology-relevant set. In comparison with 2003, the core set has grown and the relevant set has decreased. This suggests a higher degree of codification in the field of nanotechnology: the field has become more focused in terms of citation practices. Using the citing patterns among journals at the aggregate level, a core group of ten nanotechnology journals in the vector space can be delineated on the criterion of betweenness centrality. National contributions to this core group of journals are evaluated for the years 2003, 2004, and 2005. Additionally, the specific class of nanotechnology patents in the database of the U.S. Patent and Trade Office (USPTO) is analyzed to determine if non-patent literature references can be used as a source for the delineation of the knowledge base in terms of scientific journals. The references are primarily to general science journals and letters, and therefore not specific enough for the purpose of delineating a journal set.

physics.soc-ph↗

arXiv2009

Co-word Analysis using the Chinese Character Set

Until recently, Chinese texts could not be studied using co-word analysis because the words are not separated by spaces in Chinese (and Japanese). A word can be composed of one or more characters. The online availability of programs that separate Chinese texts makes it possible to analyze them using semantic maps. Chinese characters contain not only information, but also meaning. This may enhance the readability of semantic maps. In this study, we analyze 58 words which occur ten or more times in the 1652 journal titles of the China Scientific and Technical Papers and Citations Database. The word occurrence matrix is visualized and factor-analyzed.

cs.CL↗

arXiv2009

Multiparty-controlled teleportation of an arbitrary m-qudit state with pure entangled quantum channel

We present a general scheme for multiparty-controlled teleportation of an arbitrary m-qudit ($d$-dimensional quantum system) state by using non-maximally entangled states as the quantum channel. The sender performs m generalized Bell-state measurements on her 2$m$ particles, the controllers take some single-particle measurements with the measuring basis $X_{d}$ and the receiver only need to introduce one auxiliary two-level particle to extract quantum information probabilistically with the fidelity unit if he cooperates with all the controllers. All the parties can use some decoy photons to set up their quantum channel securely, which will forbid some a dishonest party to eavesdrop freely. This scheme is optimal as the probability that the receiver obtains the originally unknown m-qudit state equals to the entanglement of the quantum channel.

quant-ph↗

arXiv2007

Economical Quantum Secure Direct Communication Network with Single Photons

A scheme for quantum secure direct communication (QSDC) network is proposed with a sequence of polarized single photons. The single photons are prepared originally in the same state |0> by the servers on the network, which will reduce the difficulty for the legitimate users to check eavesdropping largely. The users code the information on the single photons with two unitary operations which do not change their measuring bases. Some decoy photons, which are produced by operating the sample photons with a Hadamard, are used for preventing a potentially dishonest server from eavesdropping the quantum lines freely. This scheme is an economical one as it is the easiest way for QSDC network communication securely.

quant-ph↗

arXiv2007

Quantum secure direct communication with quantum encryption based on pure entangled states

We present a scheme for quantum secure direct communication with quantum encryption. The two authorized users use repeatedly a sequence of the pure entangled pairs (quantum key) shared for encrypting and decrypting the secret message carried by the traveling photons directly. For checking eavesdropping, the two parties perform the single-photon measurements on some decoy particles before each round. This scheme has the advantage that the pure entangled quantum signal source is feasible at present and any eavesdropper cannot steal the message.

quant-ph↗

arXiv2007

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.

quant-ph↗

arXiv2007

Multiparty quantum secret sharing with pure entangled states and decoy photons

We present a scheme for multiparty quantum secret sharing of a private key with pure entangled states and decoy photons. The boss, say Alice uses the decoy photons, which are randomly in one of the four nonorthogonal single-photon states, to prevent a potentially dishonest agent from eavesdropping freely. This scheme requires the parties of communication to have neither an ideal single-photon quantum source nor a maximally entangled one, which makes this scheme more convenient than others in a practical application. Moreover, it has the advantage of having high intrinsic efficiency for qubits and exchanging less classical information in principle.

quant-ph↗

arXiv2007

Eavesdropping on the "Ping-Pong" Quantum Communication Protocol Freely in a Noise Channel

We introduce an attack scheme for eavesdropping the ping-pong quantum communication protocol proposed by Bostr$\ddot{o}$m and Felbinger [Phys. Rev. Lett. \textbf{89}, 187902 (2002)] freely in a noise channel. The vicious eavesdropper, Eve, intercepts and measures the travel photon transmitted between the sender and the receiver. Then she replaces the quantum signal with a multi-photon signal in a same state, and measures the photons return with the measuring basis with which Eve prepares the fake signal except for one photon. This attack increase neither the quantum channel losses nor the error rate in the sampling instances for eavesdropping check. It works for eavesdropping the secret message transmitted with the ping-pong protocol. Finally, we propose a way for improving the security of the ping-pong protocol.

quant-ph↗

arXiv2007

Efficient quantum cryptography network without entanglement and quantum memory

An efficient quantum cryptography network protocol is proposed with d-dimension polarized photons, without resorting to entanglement and quantum memory. A server on the network, say Alice, provides the service for preparing and measuring single photons whose initial state are |0>. The users code the information on the single photons with some unitary operations. For preventing the untrustworthy server Alice from eavesdropping the quantum lines, a nonorthogonal-coding technique (decoy-photon technique) is used in the process that the quantum signal is transmitted between the users. This protocol does not require the servers and the users to store the quantum state and almost all of the single photons can be used for carrying the information, which makes it more convenient for application than others with present technology. We also discuss the case with a faint laser pulse.

quant-ph↗

arXiv2007

On $L^{1}$-Convergence of Fourier Series Under $MVBV$ Condition

Let $f\in L_{2π}$ be a real-valued even function with its Fourier series $ \frac{a_{0}}{2}+\sum_{n=1}^{\infty}a_{n}\cos nx,$ and let $S_{n}(f,x), n\geq 1,$ be the $n$-th partial sum of the Fourier series. It is well-known that if the nonnegative sequence $\{a_{n}\}$ is decreasing and $\lim\limits_{n\to \infty}a_{n}=0$, then $$ \lim\limits_{n\to \infty}\Vert f-S_{n}(f)\Vert_{L}=0 {if and only if} \lim\limits_{n\to \infty}a_{n}\log n=0. $$ We weaken the monotone condition in this classical result to the so-called mean value bounded variation ($MVBV$) condition. The generalization of the above classical result in real-valued function space is presented as a special case of the main result in this paper which gives the $L^{1}$% -convergence of a function $f\in L_{2π}$ in complex space. We also give results on $L^{1}$-approximation of a function $f\in L_{2π}$ under the $% MVBV$ condition.

math.CA↗

arXiv2006

Multiparty Quantum Remote Secret Conference

We present two schemes for multiparty quantum remote secret conference in which each legitimate conferee can read out securely the secret message announced by another one, but a vicious eavesdropper can get nothing about it. The first one is based on the same key shared efficiently and securely by all the parties with Greenberger-Horne-Zeilinger (GHZ) states, and each conferee sends his secret message to the others with one-time pad crypto-system. The other one is based on quantum encryption with a quantum key, a sequence of GHZ states shared among all the conferees and used repeatedly after confirming their security. Both these schemes are optimal as their intrinsic efficiency for qubits approaches the maximal value.

quant-ph↗

arXiv2006

Ultimate Generalization to Monotonicity for Uniform Convergence of Trigonometric Series

Chaundy and Jolliffe [4] proved that if $\{a_{n}\}$ is a non-increasing (monotonic) real sequence with $\lim\limits_{n\to \infty}a_{n}=0$, then a necessary and sufficient condition for the uniform convergence of the series $\sum_{n=1}^{\infty}a_{n}\sin nx$ is $ \lim\limits_{n\to \infty}na_{n}=0$. We generalize (or weaken) the monotonic condition on the coefficient sequence $\{a_{n}\}$ in this classical result to the so-called mean value bounded variation condition and prove that the generalized condition cannot be weakened further. We also establish an analogue to the generalized Chaundy and Jolliffe theorem in the complex space.

math.CA↗

arXiv2006

Deterministic secure quantum communication without maximally entangled states

Two deterministic secure quantum communication schemes are proposed, one based on pure entangled states and the other on $d$-dimensional single-photon states. In these two schemes, only single-photon measurements are required for the two authorized users, which makes the schemes more convenient than others in practical applications. Although each qubit can be read out after a transmission of additional classical bit, it is unnecessary for the users to transmit qubits double the distance between the sender and the receiver, which will increase their bit rate and their security. The parties use decoy photons to check eavesdropping efficiently. The obvious advantage in the first scheme is that the pure entangled source is feasible with present techniques.

quant-ph↗

arXiv2006

Quantum secure direct communication network with Einstein-Podolsky-Rosen pairs

We discuss the four requirements for a real point-to-point quantum secure direct communication (QSDC) first, and then present two efficient QSDC network schemes with an N ordered Einstein-Podolsky-Rosen pairs. Any one of the authorized users can communicate another one on the network securely and directly.

quant-ph↗

arXiv2006

Quantum state sharing of an arbitrary two-qubit state with two-photon entanglements and Bell-state measurements

Two schemes for sharing an arbitrary two-qubit state based on entanglement swapping are proposed with Bell-state measurements and local unitary operations. One is based on the quantum channel with four Einstein-Podolsky-Rosen (EPR) pairs shared in advance. The other is based on a circular topological structure, i.e., each user shares an EPR pair with his neighboring one. The advantage of the former is that the construction of the quantum channel between the agents is controlled by the sender Alice, which will improve the security of the scheme. The circular scheme reduces the quantum resource largely when the number of the agents is large. Both of those schemes have the property of high efficiency as almost all the instances can be used to split the quantum information. They are more convenient in application than the other schemes existing as they require only two-qubit entanglements and two-qubit joint measurements for sharing an arbitrary two-qubit state.

quant-ph↗

arXiv2006

Multiparty Quantum Secret Report

A multiparty quantum secret report scheme is proposed with quantum encryption. The boss Alice and her $M$ agents first share a sequence of ($M$+1)-particle Greenberger--Horne--Zeilinger (GHZ) states that only Alice knows which state each ($M$+1)-particle quantum system is in. Each agent exploits a controlled-not (CNot) gate to encrypt the travelling particle by using the particle in the GHZ state as the control qubit. The boss Alice decrypts the travelling particle with a CNot gate after performing a $σ_x$ operation on her particle in the GHZ state or not. After the GHZ states (the quantum key) are used up, the parties check whether there is a vicious eavesdropper, say Eve, monitoring the quantum line, by picking out some samples from the GHZ states shared and measure them with two measuring bases. After confirming the security of the quantum key, they use the GHZ states remained repeatedly for next round of quantum communication. This scheme has the advantage of high intrinsic efficiency for qubits and the total efficiency.

quant-ph↗

arXiv2006

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.

quant-ph↗

arXiv2006

Multiparty quantum secret splitting and quantum state sharing

A protocol for multiparty quantum secret splitting is proposed with an ordered $N$ EPR pairs and Bell state measurements. It is secure and has the high intrinsic efficiency and source capacity as almost all the instances are useful and each EPR pair carries two bits of message securely. Moreover, we modify it for multiparty quantum state sharing of an arbitrary $m$-particle entangled state based on quantum teleportation with only Bell state measurements and local unitary operations which make this protocol more convenient in a practical application than others.

quant-ph↗