Entanglement is not necessary for perfect discrimination between unitary operations

We show that a unitary operation (quantum circuit) secretly chosen from a finite set of unitary operations can be determined with certainty by sequentially applying only a finite amount of runs of the unknown circuit. No entanglement or joint quantum operations are required in our scheme. We further show that our scheme is optimal in the sense that the number of the runs is minimal when discriminating only two unitary operations.     

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.     

Classical-Operation-Based Deterministic Secure Quantum Communication

We generalize the unitary-operation-based deterministic secure quantum communication (UODSQC) model (protocol) to describe the conventional deterministic secure quantum communication (DSQC) protocols in which unitary operations are usually utilized for encoding or decoding message. However, it is found that unitary operation for message encoding or decoding is not required and can be replaced with classical operation in DSQC. So the classical-operation-based deterministic secure quantum communication (CODSQC) model (protocol) is put forward. Then the rigorous mathematical analysis to explain the reason why classical operations can replace unitary operations to encode or decode secret deterministic message is given. Although unitary operations are still possibly needed in the whole communication of CODSQC model (protocol), those used for message encoding or decoding are omitted and replaced with classical operations in CODSQC model (protocol). As a result, the CODSQC model (protocol) is simpler and even more robust than the UODSQC one.     

Asymptotic evolution of random unitary operations

We analyze the asymptotic dynamics of quantum systems resulting from large numbers of iterations of random unitary operations. Although, in general, these quantum operations cannot be diagonalized it is shown that their resulting asymptotic dynamics is described by a diagonalizable superoperator. We prove that this asymptotic dynamics takes place in a typically low dimensional attractor space which is independent of the probability distribution of the unitary operations applied. This vector space is spanned by all eigenvectors of the unitary operations involved which are associated with eigenvalues of unit modulus. Implications for possible asymptotic dynamics of iterated random unitary operations are presented and exemplified in an example involving random controlled-not operations acting on two qubits.     

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.     

Local discrimination scheme for some unitary operations

It has been shown that for two different multipartite unitary operations U_1 and U_2, when tr(U_1~?U_2) = 0, they can always be perfectly distinguished by local operations and classical communication in the single-run scenario. However, how to find the detailed scheme to complete the local discrimination is still a fascinating problem. In this paper, aiming at some U_1 and U_2 acting on the bipartite and tripartite space respectively, especially for U_1~?U_2 locally unitary equivalent to the high dimensional X-type hermitian unitary matrix V with trV = 0, we put forward the explicit local distinguishing schemes in the single-run scenario.     

Distilling Gaussian states with Gaussian operations is impossible

We show that no distillation protocol for Gaussian quantum states exists that relies on (i) arbitrary local unitary operations that preserve the Gaussian character of the state and (ii) homodyne detection together with classical communication and postprocessing by means of local Gaussian unitary operations on two symmetric identically prepared copies. This is in contrast to the finite-dimensional case, where entanglement can be distilled in an iterative protocol using two copies at a time. The ramifications for the distribution of Gaussian states over large distances will be outlined. We also comment on the generality of the approach and sketch the most general form of a Gaussian local operation with classical communication in a bipartite setting.     

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.     

Efficient Multiparty-to-Multiparty Quantum Secret Sharing via Continuous Variable Operations

The one-to-multiparty quantum secret sharing scheme [Phys. Rev. A 71 （2005） 044301] proposed recently is extended to a multiparty-to-multiparty case. Furthermore, the continuous variable operations are employed in the extended scheme to replace the specific discrete unitary operations used in the original scheme. The complete randomicity of the continuous variable characterizing the unitary operations can ensure the security of secret sharing. Moreover, the present scheme is compared with the recent similar scheme [Phys. Rev. A 72 （2005） 012304]. It is found that the efficiency of the present scheme is n times of that of the previous one.     

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.     

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

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

Operator Entanglement of Two-Qubit Joint Unitary Operations Revisited: Schmidt Number Approach

The operator entanglement of two-qubit joint unitary operations is revisited. The Schmidt number, an important attribute of a two-qubit unitary operation, may have connection with the entanglement measure of the unitary operator. We find that the entanglement measure of a two-qubit unitary operators is classified by the Schmidt number of the unitary operators. We also discuss the exact relation between the operator entanglement and the parameters of the unitary operator.     

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.     

基于非对称量子通道受控QOT量子投票协议

提出一种量子投票协议, 协议基于非对称量子通道受控量子局域幺正操作隐形传输(quantum operation teleportation, QOT). 由公正机构CA提供的零知识证明的量子身份认证, 保证选民身份认证的匿名性. 计票机构Bob制造高维Greenberger-Horne-Zeilinger 纠缠态建立一个高维量子通信信道. 选民对低维的量子选票进行局域幺正操作的量子投票, 是通过非对称基的测量和监票机构Charlie的辅助测量隐形传输的. Bob在Charlie帮助下可以通过幺正操作结果得到投票结果. 与其他一般的QOT量子投票协议相比, 该协议利用量子信息与传输的量子信道不同维, 使单粒子信息不能被窃取、防止伪造.选举过程由于有Charlie的监督, 使得投票公正和不可抵赖.由于量子局域幺正操作隐形传输的成功概率是1, 使量子投票的可靠性得以保证. 关键词： 量子投票 高维GHZ纠缠态 非对称基测量 量子操作隐形传输     

Controlled unknown quantum operations on hybrid systems

Any unknown unitary operations conditioned on a control system can be deterministically performed if ancillary subspaces are available for the target systems [Zhou X Q, et al. 2011 Nat. Commun. 2 413]. In this paper, we show that previous optical schemes may be extended to general hybrid systems if unknown operations are provided by optical instruments. Moreover, a probabilistic scheme is proposed when the unknown operation may be performed on the subspaces of ancillary high-dimensional systems. Furthermore, the unknown operations conditioned on the multi-control system may be reduced to the case with a control system using additional linear circuit complexity. The new schemes may be more flexible for different systems or hybrid systems.     

Perfect Teleportation of an Arbitrary Three-Qubit State by Using W-Class States

A new application of the W-class state is investigated for teleportation of an arbitrary three-qubit state. We demonstrate that three sets of W-class states can be used to realize the perfect teleportation of an arbitrary three-qubit state by performing only the three-qubit von Neumann measurements and local unitary operations.     

Optimal conversion of nonlocal unitary operations

We study when a nonlocal unitary operation acting on two d-level systems can probabilistically simulate another one when arbitrary local operations and classical communication are allowed. We provide necessary and sufficient conditions for the simulation to be possible. Probabilistic interconvertability is used to define an equivalence relation between gates. We show that this relation induces a finite number of classes that we identify. In the case of two qubits, two classes of nonlocal operations exist. We show how the representatives of these classes, CNOT and SWAP, can be deterministically converted into any operation of its class and calculate the optimal probability of the reverse process.     

Controlled Remote State Preparation of an Arbitrary Two-Qubit State by Using GHZ States

In this paper, we demonstrate that two Greenberger-Horne-Zeilinger (GHZ) states can be used to realize the perfect and deterministic controlled remote state preparation of an arbitrary two-qubit state by performing only the two-qubit projective measurements and appropriate unitary operations.     

Amending Coherence-Breaking Channels via Unitary Operations

The coherence-breaking channels play a significant role in quantum information theory. We study the coherence-breaking channels and give a method to amend the coherence-breaking channels by applying unitary operations. For given incoherent channel Φ, we give necessary and sufficient conditions for the channel to be a coherence-breaking channel and amend it via unitary operations. For qubit incoherent channels Φ that are not coherence-breaking ones, we consider the mapping Φ °Φ and present the conditions for coherence-breaking and channel amendment as well.