Searcharxiv⌕ Search

arXiv subjects

Hong-Yu Zhou

Publications and source records attributed to Hong-Yu Zhou.

At least 73 records · Page 4Linked to original sources

Code Attention: Translating Code to Comments by Exploiting Domain Features

Appropriate comments of code snippets provide insight for code functionality, which are helpful for program comprehension. However, due to the great cost of authoring with the comments, many code projects do not contain adequate comments. Automatic comment generation techniques have been proposed to generate comments from pieces of code in order to alleviate the human efforts in annotating the code. Most existing approaches attempt to exploit certain correlations (usually manually given) between code and generated comments, which could be easily violated if the coding patterns change and hence the performance of comment generation declines. In this paper, we first build C2CGit, a large dataset from open projects in GitHub, which is more than 20$\times$ larger than existing datasets. Then we propose a new attention module called Code Attention to translate code to comments, which is able to utilize the domain features of code snippets, such as symbols and identifiers. We make ablation studies to determine effects of different parts in Code Attention. Experimental results demonstrate that the proposed module has better performance over existing approaches in both BLEU and METEOR.

cs.AI↗

Sunrise or Sunset: Selective Comparison Learning for Subtle Attribute Recognition

The difficulty of image recognition has gradually increased from general category recognition to fine-grained recognition and to the recognition of some subtle attributes such as temperature and geolocation. In this paper, we try to focus on the classification between sunrise and sunset and hope to give a hint about how to tell the difference in subtle attributes. Sunrise vs. sunset is a difficult recognition task, which is challenging even for humans. Towards understanding this new problem, we first collect a new dataset made up of over one hundred webcams from different places. Since existing algorithmic methods have poor accuracy, we propose a new pairwise learning strategy to learn features from selective pairs of images. Experiments show that our approach surpasses baseline methods by a large margin and achieves better results even compared with humans. We also apply our approach to existing subtle attribute recognition problems, such as temperature estimation, and achieve state-of-the-art results.

cs.CV↗

Adaptive Feeding: Achieving Fast and Accurate Detections by Adaptively Combining Object Detectors

Object detection aims at high speed and accuracy simultaneously. However, fast models are usually less accurate, while accurate models cannot satisfy our need for speed. A fast model can be 10 times faster but 50\% less accurate than an accurate model. In this paper, we propose Adaptive Feeding (AF) to combine a fast (but less accurate) detector and an accurate (but slow) detector, by adaptively determining whether an image is easy or hard and choosing an appropriate detector for it. In practice, we build a cascade of detectors, including the AF classifier which make the easy vs. hard decision and the two detectors. The AF classifier can be tuned to obtain different tradeoff between speed and accuracy, which has negligible training time and requires no additional training data. Experimental results on the PASCAL VOC, MS COCO and Caltech Pedestrian datasets confirm that AF has the ability to achieve comparable speed as the fast detector and comparable accuracy as the accurate one at the same time. As an example, by combining the fast SSD300 with the accurate SSD500 detector, AF leads to 50\% speedup over SSD500 with the same precision on the VOC2007 test set.

cs.CV↗

Passively self-error-rejecting qubit transmission over a collective-noise channel

We propose a passively self-error-rejecting single-qubit transmission scheme for an arbitrary polarization state of a single qubit over a collective-noise channel, without resorting to additional qubits and entanglement. By splitting a single qubit into some wavepackets with some Mach-Zehnder interferometers, we can obtain an uncorrupted state with a success probability approaching 100% via postselection in different time bins, independent of the parameters of collective noise. It is simpler and more flexible than the schemes utilizing decoherence-free subspace and those with additional qubits. One can directly apply this scheme to almost all quantum communication protocols based on single photons or entangled photon systems against a collective noise.

quant-ph↗

Efficient and economic five-party quantum state sharing of an arbitrary m-qubit state

We present an efficient and economic scheme for five-party quantum state sharing of an arbitrary m-qubit state with $2m$ three-particle Greenberger-Horne-Zeilinger (GHZ) states and three-particle GHZ-state measurements. It is more convenient than other schemes as it only resorts to three-particle GHZ states and three-particle joint measurement, not five-particle entanglements and five-particle joint measurements. Moreover, this symmetric scheme is in principle secure even though the number of the dishonest agents is more than one. Its total efficiency approaches the maximal value.

quant-ph↗

Fault tolerant quantum key distribution based on quantum dense coding with collective noise

We present two robust quantum key distribution protocols against two kinds of collective noise, following some ideas in quantum dense coding. Three-qubit entangled states are used as quantum information carriers, two of which forming the logical qubit which is invariant with a special type of collective noise. The information is encoded on logical qubits with four unitary operations, which can be read out faithfully with Bell-state analysis on two physical qubits and a single-photon measurement on the other physical qubit, not three-photon joint measurements. Two bits of information are exchanged faithfully and securely by transmitting two physical qubits through a noisy channel. When the losses in the noisy channel is low, these protocols can be used to transmit a secret message directly in principle.

quant-ph↗

Single-photon entanglement concentration for long-distance quantum communication

We present a single-photon entanglement concentration protocol for long-distance quantum communication with quantum nondemolition detector. It is the first concentration protocol for single-photon entangled states and it dose not require the two parties of quantum communication to know the accurate information about the coefficient $α$ and $β$ of the less entangled states. Also, it does not resort to sophisticated single-photon detectors, which makes this protocol more feasible in current experiments. Moreover, it can be iterated to get a higher efficiency and yield. All these advantages maybe make this protocol have more practical applications in long-distance quantum communication and quantum internet.

quant-ph↗

Genuine tripartite entanglement in quantum brachistochrone evolution of a three-qubit system

We explore the connection between quantum brachistochrone (time-optimal) evolution of a three-qubit system and its residual entanglement called three-tangle. The result shows that the entanglement between two qubits is not required for some brachistochrone evolutions of a three-qubit system. However, the evolution between two distinct states cannot be implemented without its three-tangle, except for the trivial cases in which less than three qubits attend evolution. Although both the probability density function of the time-averaged three-tangle and that of the time-averaged squared concurrence between two subsystems become more and more uniform with the decrease in angles of separation between an initial state and a final state, the features of their most probable values exhibit a different trend.

quant-ph↗

Multipartite entanglement purification with quantum nondemolition detectors

We present a scheme for multipartite entanglement purification of quantum systems in a Greenberger-Horne-Zeilinger state with quantum nondemolition detectors (QNDs). This scheme does not require the controlled-not gates which cannot be implemented perfectly with linear optical elements at present, but QNDs based on cross-Kerr nonlinearities. It works with two steps, i.e., the bit-flipping error correction and the phase-flipping error correction. These two steps can be iterated perfectly with parity checks and simple single-photon measurements. This scheme does not require the parties to possess sophisticated single photon detectors. These features maybe make this scheme more efficient and feasible than others in practical applications.

quant-ph↗

Nonlocal entanglement concentration scheme for partially entangled multipartite systems with nonlinear optics

We present a nonlocal entanglement concentration scheme for reconstructing some maximally entangled multipartite states from partially entangled ones by exploiting cross-Kerr nonlinearities to distinguish the parity of two polarization photons. Compared with the entanglement concentration schemes based on two-particle collective unitary evolution, this scheme does not require the parties to know accurately information about the partially entangled states--i.e., their coefficients. Moreover, it does not require the parties to possess sophisticated single-photon detectors, which makes this protocol feasible with present techniques. By iteration of entanglement concentration processes, this scheme has a higher efficiency and yield than those with linear optical elements. All these advantages make this scheme more efficient and more convenient than others in practical applications.

quant-ph↗

Efficient quantum key distribution over a collective noise channel

We present two efficient quantum key distribution schemes over two different collective-noise channels. The accepted hypothesis of collective noise is that photons travel inside a time window small compared to the variation of noise. Noiseless subspaces are made up of two Bell states and the spatial degree of freedom is introduced to form two nonorthogonal bases. Although these protocols resort to entangled states for encoding the key bit, the receiver is only required to perform single-particle product measurements and there is no basis mismatch. Moreover, the detection is passive as the receiver does not switch his measurements between two conjugate measurement bases to get the key.

quant-ph↗

Stable and deterministic quantum key distribution based on differential phase shift

We present a stable and deterministic quantum key distribution (QKD) system based on differential phase shift. With three cascaded Mach-Zehnder interferometers with different arm-length differences for creating key, its key creation efficiency can be improved to be 7/8, more than other systems. Any birefringence effects and polarization-dependent losses in the long-distance fiber are automatically compensated with a Faraday mirror. Added an eavesdropping check, this system is more secure than some other phase-coding-based QKD systems. Moreover, the classical information exchanged is reduces largely and the modulation of phase shifts is simplified. All these features make this QKD system more convenient than others in a practical application.

quant-ph↗

Efficient faithful qubit transmission with frequency degree of freedom

We propose an efficient faithful polarization-state transmission scheme by utilizing frequency degree of freedom besides polarization and an additional qubit prepared in a fixed polarization. An arbitrary single-photon polarization state is protected against the collective noise probabilistically. With the help of frequency beam splitter and frequency shifter, the success probability of our faithful qubit transmission scheme with frequency degree of freedom can be 1/2 in principle.

quant-ph↗

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↗

Efficient polarization entanglement concentration for electrons with charge detection

We present an entanglement concentration protocol for electrons based on their spins and their charges. The combination of an electronic polarizing beam splitter and a charge detector functions as a parity check device for two electrons, with which the parties can reconstruct maximally entangled electron pairs from those in a less-entanglement state nonlocally. This protocol has a higher efficiency than those based on linear optics and it does not require the parties to know accurately the information about the less-entanglement state, which makes it more convenient in a practical application of solid quantum computation and communication.

quant-ph↗

Efficient polarization entanglement purification based on parametric down-conversion sources with cross-Kerr nonlinearity

We present a way for entanglement purification based on two parametric down-conversion (PDC) sources with cross-Kerr nonlinearities. It is comprised of two processes. The first one is a primary entanglement purification protocol for PDC sources with nondestructive quantum nondemolition (QND) detectors by transferring the spatial entanglement of photon pairs to their polarization. In this time, the QND detectors act as the role of controlled-not (CNot) gates. Also they can distinguish the photon number of the spatial modes, which provides a good way for the next process to purify the entanglement of the photon pairs kept more. In the second process for entanglement purification, new QND detectors are designed to act as the role of CNot gates. This protocol has the advantage of high yield and it requires neither CNot gates based on linear optical elements nor sophisticated single-photon detectors, which makes it more convenient in practical applications.

quant-ph↗

Efficient high-capacity quantum secret sharing with two-photon entanglement

An efficient high-capacity quantum secret sharing scheme is proposed following some ideas in quantum dense coding with two-photon entanglement. The message sender, Alice prepares and measures the two-photon entangled states, and the two agents, Bob and Charlie code their information on their photons with four local unitary operations, which makes this scheme more convenient for the agents than others. This scheme has a high intrinsic efficiency for qubits and a high capacity.

quant-ph↗

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↗