Local distinguishability of multipartite unitary operations

We show that any two different unitary operations acting on an arbitrary multipartite quantum system can be perfectly distinguished by local operations and classical communication when a finite number of runs is allowed. Intuitively, this result indicates that the lost identity of a nonlocal unitary operation can be recovered locally. No entanglement between distant parties is required.     

Universal and deterministic manipulation of the quantum state of harmonic oscillators: a route to unitary gates for Fock state qubits

We present a simple quantum circuit that allows for the universal and deterministic manipulation of the quantum state of confined harmonic oscillators. The scheme is based on the selective interactions of the referred oscillator with an auxiliary three-level system and a classical external driving source, and enables any unitary operations on Fock states, two by two. One circuit is equivalent to a single qubit unitary logical gate on Fock states qubits. Sequences of similar protocols allow for complete, deterministic, and state-independent manipulation of the harmonic oscillator quantum state.     

Unitary transformations can be distinguished locally

We show that, in principle, N-partite unitary transformations can be perfectly discriminated under local operations and classical communication despite their nonlocal properties. Based on this result, some related topics, including the construction of the appropriate quantum circuit together with the extension to general completely positive trace preserving operations, are discussed.     

利用单光子的量子对话

提出了一个利用一束单光子对话的方案.在方案中,利用两个不同的幺正操作对光子态进行编码,并且从一束光子中选择较大的子集进行窃听检查,该方案能够有效地抵御截取再发送袭击.此外,由于利用单光子没有利用EPR对,因此该方案是很实际的.该方案是绝对安全的.     

量子离散Fourier变换在离子阱中的实现方案

在Cirac-Zoller模型的框架下,讨论在离子阱中如何利用幺正操作实施 量子离散Fourier变换的方案。由于量子离散Fourier变换可由两个基本操作组     

Quantum Circuit Realization of Morphological Gradient for Quantum Grayscale Image

In this paper, based on the principle of classical morphology operations, the flat grayscale dilation and erosion operations are proposed for NEQR quantum image model. Furthermore, through combining these two morphology operations, we further realize the morphological gradient operation. As the basis of designing of grayscale morphology operations, a series of quantum circuit designs arepresented, which includes special add one operation UA₁(n) and special subtract one operation US₁(n) both for an n-length qubits sequence, quantum unitary operation U_C, parallel subtractor (PS) module, quantum comparator output the large QCOL and quantum comparator output the small QCOS modules. When designsthe concrete quantum circuit, a sequence of UA₁(n) and US₁(n) modules are used to obtain the quantum image sets based on the shape of specific structuring element. Then, the searching for maximaor minima in a certain space is involved, which can be solved by cascading a series of QCOL and QCOS modules in certain order. Finally, the PS module can be used to calculate the difference of the maxima and minima for producing the morphological gradient. The circuit’s complexity analysis illustrate that our scheme is very lower to the classical morphology operations.

     

Multiparty Quantum Blind Signature Scheme Based on Graph States

A multiparty quantum blind signature scheme is proposed based on the principle of graph state, in which the unitary operations of graph state particles can be applied to generate the quantum blind signature and achieve verification. Different from the classical blind signature based on the mathematical difficulty, the scheme could guarantee not only the anonymity but also the unconditionally security. The analysis shows that the length of the signature generated in our scheme does not become longer as the number of signers increases, and it is easy to increase or decrease the number of signers.     

Secure quantum dialogue based on single-photon

In this paper a quantum dialogue scheme is proposed by using N batches of single photons. The same secret message is encoded on each batch of single photons by the sender with two different unitary operations, and then the N batches of single photons are sent to the receiver. After eavesdropping check, the message is encoded on the one remaining batch by the receiver. It is shown that the intercept-and-resend attack and coupling auxiliary modes attack can be resisted more efficiently, because the photons are sent only once in our quantum dialogue scheme.     

Sequential implementation of global quantum operations

We study the possibility for a global unitary applied on an arbitrary number of qubits to be decomposed in a sequential unitary procedure, where an ancillary system is allowed to interact only once with each qubit. We prove that sequential unitary decompositions are in general impossible for genuine entangling operations, even with an infinite-dimensional ancilla, being the controlled-NOT gate a paradigmatic example. Nevertheless, we find particular nontrivial operations in quantum information that can be performed in a sequential unitary manner, as is the case of quantum error correction and quantum cloning.     

Exact two-qubit universal quantum circuit

We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly simulates arbitrary two-qubit operations in SU(4). Each block in this circuit is given in a closed form solution. We also provide a uniform upper bound of the applications of the given entangling gates, and find that exactly half of all the controlled-unitary gates satisfy the same upper bound as the CNOT gate. These results allow for the efficient implementation of operations in SU(4) required for both quantum computation and quantum simulation.     

Tripartition of Arbitrary Single-Qubit Information via a Class of AsymmetricFour-Qubit W State

A four-party scheme is put forward for a sender to partition arbitrary single-qubit information among three receivers by utilizing a class of asymmetric four-qubit W state as quantum channels. In the scheme the sender's quantum information can be recovered by the three receivers if and only if they collaborate together. Specifically, they collaborate to perform first twodifferent 2-qubit collective unitary operations and then a single-qubit unitary operation. The scheme is symmetric and (3,3)-threshold with regard to the reconstruction, for any receiver can be assigned to conclusively recover the quantum information with the other two's assistances.     

Deterministic Joint Remote Preparation of an Arbitrary Two-Qubit State Using the Cluster State

Recently, deterministic joint remote state preparation (JRSP) schemes have been proposed to achieve 100% success probability. In this paper, we propose a new version of deterministic JRSP scheme of an arbitrary two-qubit state by using the six-qubit cluster state as shared quantum resource. Compared with previous schemes, our scheme has high efficiency since less quantum resource is required, some additional unitary operations and measurements are unnecessary. We point out that the existing two types of deterministic JRSP schemes based on GHZ states and EPR pairs are equivalent.     

Unidirectional Quantum Remote Control： Teleportation of Control－State

We investigate the problem of teleportation of unitary operations by unidirectional control-state telepor-ration and propose a scheme called unidirectional quantum remote control. The scheme is based on the isomorphism between operation and state. It allows us to store a unitary operation in a control state, thereby teleportatSon of the unitary operation can be implemented by unidirectional teleportation of the control-state. We find that the probability of success for implementing an arbitrary unitary operation on arbitrary A~-qubit state by unidirectional control-state teleportation is 4^-M, and 2M ebits and 4M cbits are consumed in each teleportation.     

Probabilistic Cloning of two Single-Atom States via Thermal Cavity

We propose a cavity QED scheme for implementing the 1 → 2 probabilistic quantum cloning (PQC) of two single-atom states. In our scheme, after the to-be-cloned atom and the assistant atom passing through the first cavity, a measurement is carried out on the assistant atom. Based on the measurement outcome we can judge whether the PQC should be continued. If the cloning fails, the other operations are omitted. This makes our scheme economical. If the PQC is continued (with the optimal probability) according to the measurement outcome, two more cavities and some unitary operations are used for achieving the PQC in a deterministic way. Our scheme is insensitive to the decays of the cavities and the atoms.     

Unidirectional Quantum Remote Control:Teleportation of Control-State

We investigate the problem of teleportation of unitary operations by unidirectional control-state telepor-tation and propose a scheme called unidirectional quantum remote control. The scheme is based on the isomorphismbetween operation and state. It allows us to store a unitary operation in a control state, thereby teleportation of theunitary operation can be implemented by unidirectional teleportation of the control-state. We find that the probabilityof success for implementing an arbitrary unitary operation on arbitrary M-qubit state by unidirectional control-stateteleportation is 4-M, and 2M ebits and 4M cbits are consumed in each teleportation.     

Teleportation of A Single Qubit State via Unique W State

We propose a scheme for teleporting a single qubit state employing a unique three-particle W state as quantum channel. By adopting QED cavity technologies, our scheme does not involve the Bell-state measurements(BMs). An unknown state a|0〉 + b|1〉 can be probabilistically teleported by communicators' single particle measurements, unitary operations and classical communications. We can perfectly teleport quantum state ½1√2(|0〉 +|1〉) with 100% probability.     

Quantum Secure Direct Communication Using Entangled Photon Pairs and Local Measurement

We present a scheme for quantum secure direct communication, in which the message is encoded by local unitary operations, transmitted through entangled photons, and deduced from both the sender and receiver's local measurement results. In such a scheme, only one pair of entangled photons is consumed, and there is no need to transmit the sender's qubit carrying the secret message in a public channel, in order to transmit two-bit classical information.     

Non-Classical Rules in Quantum Games

Over the last twenty years, quantum game theory has given us many ideas of how quantum games could be played. One of the most prominent ideas in the field is a model of quantum playing bimatrix games introduced by J. Eisert, M. Wilkens and M. Lewenstein. The scheme assumes that players’ strategies are unitary operations and the players act on the maximally entangled two-qubit state. The quantum nature of the scheme has been under discussion since the article by Eisert et al. came out. The aim of our paper was to identify some of non-classical features of the quantum scheme.     

Towards optimization of quantum circuits

Any unitary operation in quantum information processing can be implemented via a sequence of simpler steps — quantum gates. However, actual implementation of a quantum gate is always imperfect and takes a finite time. Therefore, searching for a short sequence of gates — efficient quantum circuit for a given operation, is an important task. We contribute to this issue by proposing optimization of the well-known universal procedure proposed by Barenco et al. [Phys. Rev. A 52, 3457 (1995)]. We also created a computer program which realizes both Barenco’s decomposition and the proposed optimization. Furthermore, our optimization can be applied to any quantum circuit containing generalized Toffoli gates, including basic quantum gate circuits.