Long Gui-Lu

Quantum secure direct communication and deterministic secure quantum communication

In this review article, we review the recent development of quantum secure direct communication (QSDC) and deterministic secure quantum communication (DSQC) which both are used to transmit secret message, including the criteria for QSDC, some interesting QSDC protocols, the DSQC protocols and QSDC network, etc. The difference between these two branches of quantum communication is that DSQC requires the two parties exchange at least one bit of classical information for reading out the message in each qubit, and QSDC does not. They are attractive because they are deterministic, in particular, the QSDC protocol is fully quantum mechanical. With sophisticated quantum technology in the future, the QSDC may become more and more popular. For ensuring the safety of QSDC with single photons and quantum information sharing of single qubit in a noisy channel, a quantum privacy amplification protocol has been proposed. It involves very simple CHC operations and reduces the information leakage to a negligible small level. Moreover, with the one-party quantum error correction, a relation has been established between classical linear codes and quantum one-party codes, hence it is convenient to transfer many good classical error correction codes to the quantum world. The one-party quantum error correction codes are especially designed for quantum dense coding and related QSDC protocols based on dense coding.

General Quantum Interference Principle and Duality Computer

In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the quantum computer. According to the general principle of quantum interference, the very essence of quantum interference is the interference of the sub-waves of the quantum system itself. A quantum system considered here can be any quantum system: a single microscopic particle, a composite quantum system such as an atom or a molecule, or a loose collection of a few quantum objects such as two independent photons. In the duality computer, the wave of the duality computer is split into several sub-waves and they pass through different routes, where different computing gate operations are performed. These sub-waves are then re-combined to interfere to give the computational results. The quantum computer, however, has only used the particle nature of quantum object. In a duality computer, it may be possible to find a marked item from an unsorted database using only a single query, and all NP-complete problems may have polynomial algorithms. Two proof-of-the-principle designs of the duality computer are presented: the giant molecule scheme and the nonlinear quantum optics scheme. We also propose thought experiment to check the related fundamental issues, the measurement efficiency of a partial wave function.In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the quantum computer. According to the general principle of quantum interference, the very essence of quantum interference is the interference of the sub-waves of the quantum system itself. A quantum system considered here can be any quantum system: a single microscopic particle, a composite quantum system such as an atom or a molecule, or a loose collection of a few quantum objects such as two independent photons. In the duality computer, the wave of the duality computer is split into several sub-waves and they pass through different routes, where different computing gate operations are performed. These sub-waves are then re-combined to interfere to give the computational results. The quantum computer, however, has only used the particle nature of quantum object. In a duality computer, it may be possible to find a marked item from an unsorted database using only a single query, and all NP-complete problems may have polynomial algorithms. Two proof-of-the-principle designs of the duality computer are presented: the giant molecule scheme and the nonlinear quantum optics scheme. We also proposed thought experiment to check the related fundamental issues, the measurement efficiency of a partial wave function

Increasing the Efficiencies of Random-Choice-Based Quantum Communication Protocols with Delayed Measurement

The security of quantum communications lies in the capability of the legitimate parties to detect eavesdropping. Here we propose to use delayed measurement to increase the efficiency of protocols of quantum key distribution and quantum secret sharing that uses a random choice of measuring-basis. In addition to a higher efficiency, these measures also bring the benefit of much reduced amount of classical communications.

High-dimensional multi-particle cat-like state teleportation

Two kinds of M-particle d-dimensional Schmidt-form entangled state teleportation protocols are presented. In the first protocol, the teleportation is achieved by d-dimensional Bell-basis measurements, while in the second protocol it is realized by d-dimensional GHZ-basis measurement.

Allowable Generalized Quantum Gates

In this paper, we give the most general duality gates, or generalized quantum gates in duality quantum computers. Here we show by explicit construction that a n-bit duality quantum computer with d slits can be simulated perfectly with an ordinary quantum computer with n qubits and one auxiliary qudit. Using this model, we give the most general form of duality gates which is of the form Σd-1i = 0 pi U i, and the pis are complex numbers with module less or equal to 1 and constrained by |Σi pi|≤1.

Arbitrary Phase Rotation of the Marked State Cannot Be Used for Grover's Quantum Search Algorithm

A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation can be used to construct a (less efficient) quantum search algorithm is cleared. The rotation of the phase of the marked state is not only the choice for efficiency, but also vital in Grovers quantum search algorithm. The results also show that Grovers quantum search algorithm is robust.

Duality Computing in Quantum Computers

In this letter, we propose a duality computing mode, which resembles particle-wave duality property when a quantum system such as a quantum computer passes through a double-slit. In this mode, computing operations are not necessarily unitary. The duality mode provides a natural link between classical computing and quantum computing. In addition, the duality mode provides a new tool for quantum algorithm design.Quantum computer possesses quantum parallelism and offers great computing power over classical computer [1, 2]. As is well-know, a moving quantum object passing through a double-slit exhibits particle wave duality. A quantum computer is static and lacks this duality property. The recently proposed duality computer has exploited this particle wave duality property, and it may offer additional computing power [3]. Simply put it, a duality computer is a moving quantum computer passing through a double-slit. A duality computer offers the capability to perform separate operations on the sub-waves coming out of the different slits, in the so-called duality parallelism. Here we show that an n-dubit duality computer can be modeled by an (n + 1)-qubit quantum computer. In a duality mode, computing operations are not necessarily unitary. A n-qubit quantum computer can be used as an n-bit reversible classical computer and is energy efficient. Our result further enables a (n + 1)qubit quantum computer to run classical algorithms in a O(2)-bit classical computer. The duality mode provides a natural link between classical computing and quantum computing. Here we also propose a recycling computing mode in which a quantum computer will continue to compute until the result is obtained. These two modes provide new tool for algorithm design. A search algorithm for the unsorted database search problem is designed. In a duality computer, there exist two new computing gates in addition to the usual universal gates for quantum computers [3]. One such gate is the quantum wave divider (QWD), and a double-slit is an example of such gate. Suppose there is a complex Hilbert space H , a QWD reproduces copies of the wave function with attenuated coefficient in m direct summed Hilbert spaces H⊕ m = ∑m i=1 ⊕Hi, namely Dp(|ψ〉) = ∑

Quantum secure direct communication

Quantum communication exploits the principles of quantum mechanics in the transmision and processing of information. It has the advantages of high security and high capacity. Quantum secure direct communication (QSDC) is a new mode of quantum coomunication by Long and Liu in which secret information can be transmitted securely and directly over quantum channels. Since it was first proposed in 2000, QSDC has been developed very fast. In this review, we will explain the basic principles of QSDC and describe some typical QSDC protocols. Toward the end of the review, we will introduce the new trends in the QSDC research and give a perspectiv of QSDC research.

A Theoretical Scheme for Multi-user Quantum Key Distribution with N Einstein-Podolsky-Rosen Pairs on a Passive Optical Network

We propose a theoretical scheme for any-to-any multi-user quantum key distribution on a passive optical network with ordered N Einstein-Podolsky-Rosen pairs. This scheme is safe and more efficient than those with single photons. Its efficiency approaches 100% in the limit that the number of pairs used in the eavesdropping check becomes negligible. It also has high capacity and is convenient for users.

Prime Factorization in the Duality Computer

We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermats method in classical computing. All these algorithms may be polynomial in the input size.We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermats method in classical computing. All these algorithms are polynomial in the input size.