We study when a non--local 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 non--local operations exist. We choose the CNOT and SWAP as representatives of these classes. We show how the CNOT [SWAP] can be deterministically converted into any operation of its class. We also calculate the optimal probability of obtaining the CNOT [SWAP] from any operation of the corresponding class and provide a protocol to achieve this task.
A generalized Mach-Zehnder-type interferometer equipped with cross-Kerr elements is proposed to convert N-photon truncated single-mode quantum states into (N+1)-mode single-photon states, which are suitable for further state manipulation by means of beam splitter arrays and ON/OFF-detections, and vice versa. Applications to the realization of unitary and non-unitary transformations, quantum state reconstruction, and quantum telemanipulation are studied.
The problem behind this paper is, if the number of queries to unitary operations is fixed, say $k$, then when do local operations and classical communication (LOCC) suffice for optimally distinguishing bipartite unitary operations? We consider the above problem for two-qubit unitary operations in the case of $k=1$, showing that for two two-qubit entangling unitary operations without local parties, LOCC achieves the same distinguishability as the global operations. Specifically, we obtain: (i) if such two unitary operations are perfectly distinguishable by global operations, then they are perfe…
Unitary operations are a fundamental component of quantum algorithms, but they seem to be far more useful if given with a "quantum control" as a controlled unitary operation. However, quantum operations are not limited to unitary operations. Nevertheless, it is not a priori clear if a controlled form of these general deterministic quantum operations can be well-defined. To provide a novel tool in the toolbox for quantum programming, we propose a mathematically consistent definition of a controlled form of deterministic but non-unitary quantum operations and, more generally, of quantum combs. W…
We investigate how originally localized two pieces of quantum information represented by a tensor product of two unknown qudit states are delocalized by performing two-qudit global unitary operations. To characterize the delocalization power of global unitary operations on quantum information, we analyze the necessary and sufficient condition to deterministically relocalize one of the two pieces of quantum information to its original Hilbert space by using only LOCC. We prove that this LOCC one-piece relocalization is possible if and only if the global unitary operation is local unitary equiva…
Operator entanglement of two-qubit joint unitary operations is revisited. Schmidt number is an important attribute of a two-qubit unitary operation, and may have connection with the entanglement measure of the unitary operator. We found the entanglement measure of two-qubit unitary operators is classified by the Schmidt number of the unitary operators. The exact relation between the operator entanglement and the parameters of the unitary operator is clarified too.
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 eigenv…
Werner states are defined as bipartite qudit states that remain unchanged under application of arbitrary unitary operators acting on both subsystems simultaneously. Their preparation is a crucial ingredient in entanglement distillation protocols. This thesis deals with an iterative approach to prepare Werner states asymptotically, using random unitary operations. The asymptotic dynamics of random unitary operations are linked to algebraic properties of the involved unitary operators applying results about general quantum operations. Then a family of random unitary operations is constructed, wh…
We show that any two different unitary operations acting on an arbitrary multipartite quantum system can be perfectly distinguishable by local operations and classical communication when a finite number of runs is allowed. We then directly extend this result into the case when the number of unitary operations to be discriminated is more than two. Intuitively, our result means that the lost identity of a nonlocal (entangled) unitary operation can be recovered locally, without any use of entanglement or joint quantum operations.
Local distinguishability of bipartite unitary operations has recently received much attention. A nontrivial and interesting question concerning this subject is whether there is a sequential scheme for locally discriminating between two bipartite unitary operations, because a sequential scheme usually represents the most economic strategy for discrimination. An affirmative answer to this question was given in the literature, however with two limitations: (i) the unitary operations to be discriminated were limited to act on $d\otimes d$, i.e., a two-qudit system, and (ii) the inverses of the uni…
We present a new approach to simulating Hamiltonian dynamics based on implementing linear combinations of unitary operations rather than products of unitary operations. The resulting algorithm has superior performance to existing simulation algorithms based on product formulas and, most notably, scales better with the simulation error than any known Hamiltonian simulation technique. Our main tool is a general method to nearly deterministically implement linear combinations of nearby unitary operations, which we show is optimal among a large class of methods.
We show that a unitary operation (quantum circuit) secretely 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 is 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.
Discrimination of unitary operations is a fundamental quantum information processing task. Assisted with linear optical elements, we experimentally demonstrate perfect discrimination between single-bit unitary operations using two methods--sequential scheme and parallel scheme. The complexity and resource consumed in these two schemes are analyzed and compared.
A general method for implementing weakly entangling multipartite unitary operations using a small amount of entanglement and classical communication is presented. For the simple Hamiltonian σ_z\otimesσ_z this method requires less entanglement than previously known methods. In addition, compression of multiple operations is applied to reduce the average communication required.
Recently, the problem of discriminating multipartite unitary operations by local operations and classical communication (LOCC) has attracted significant attention. The latest work in the literature on this problem showed that two multipartite unitary operations can always be perfectly distinguished by LOCC when a finite number of runs are allowable. However, in these schemes, local entanglement (an entangled state holden by one party) was required, which seems to imply that local entanglement is necessary for perfect discrimination between unitary operations by LOCC. In this article, we show t…
We introduce a scheme for realizing arbitrary controlled-unitary operations in a two qubit system. If the 2 \times 2 unitary matrix is special unitary (has unit determinant), the controlled-unitary gate operation can be realized in a single pulse operation. The pulse, in our scheme, will constitute varying one of the parameters of the system between an arbitrarily maximum and a "calculated" minimum value. This parameter will constitute the variable parameter of the system while the other parameters, which include the coupling between the two qubits, will be treated as fixed parameters. The val…
We propose a scheme that converts a stabilizer code into another stabilizer code in a fault tolerant manner. The scheme first puts both codes in specific forms, and proceeds the conversion from a source code to a target code by applying Clifford gates. The Clifford gates are chosen from the comparisons between both codes. The fault tolerance of the conversion is guaranteed by quantum error correction in every step during the entire conversion process. As examples, we show three conversions: the $[[5,1,3]]$ stabilizer code and Steane code, Steane code and $[[15,1,3]]$ Reed-Muller code, and Stea…
We investigate the minimum entanglement cost of the deterministic implementation of two-qubit controlled-unitary operations using local operations and classical communication (LOCC). We show that any such operation can be implemented by a three-turn LOCC protocol, which requires at least 1 ebit of entanglement when the resource is given by a bipartite entangled state with Schmidt number 2. Our result implies that there is a gap between the minimum entanglement cost and the entangling power of controlled-unitary operations. This gap arises due to the requirement of implementing the operations w…
We compare three different characterizations of the globalness of bipartite unitary operations, namely, delocalization power, entanglement cost, and entangling power, to investigate global properties of unitary operations. We show that the globalness of the same unitary operation depends on whether input states are given by unknown states representing pieces of quantum information, or a set of known states for the characterization. We extend our analysis on the delocalization power in two ways. First, we show that the delocalization power differs whether the global operation is applied on one …
We consider a two-qubit unitary operation along with arbitrary local unitary operations acts on a two-qubit pure state, whose entanglement is C_0. We give the conditions that the final state can be maximally entangled and be non-entangled. When the final state can not be maximally entangled, we give the maximal entanglement C_max it can reach. When the final state can not be non-entangled, we give the minimal entanglement C_min it can reach. We think C_max and C_min represent the entanglement changing power of two-qubit unitary operations. According to this power we define an order of gates.
We study when a multipartite non--local unitary operation can deterministically or probabilistically simulate another one when local operations of a certain kind -in some cases including also classical communication- are allowed. In the case of probabilistic simulation and allowing for arbitrary local operations, we provide necessary and sufficient conditions for the simulation to be possible. Deterministic and probabilistic interconversion under certain kinds of local operations are used to define equivalence relations between gates. In the probabilistic, bipartite case this induces a finite …
The coherence resource theory needs to study the operational value and efficiency which can be broadly formulated as the question: when can one coherent state be converted into another under incoherent operations. We answer this question completely for one-mode continuous-variable systems by characterizing conversion of coherent Gaussian states under incoherent Gaussian operations in terms of their first and second moments. The no-go theorem of purification of coherent Gaussian states is also built. The structure of incoherent Gaussian operations of two-mode continuous-variable systems is disc…
We study the nonclassical correlations in a two-qubit state by the perturbing local unitary operation method. We find that the definitions of various non-classicalities including quantum discord (QD), measurement-induced nonlocality (MIN) and so on usually do not have a unique definition when expressed as the perturbation of local unitary operations, so a given non-classicality can lead to different definitions of its dual non-classicality. In addition, it is shown that QD and MIN are not the corresponding dual expressions in a simple set of unitary operations, even though they are in their or…
Extending our previous work on time optimal quantum state evolution, we formulate a variational principle for the time optimal unitary operation, which has direct relevance to quantum computation. We demonstrate our method with three examples, i.e. the swap of qubits, the quantum Fourier transform and the entangler gate, by choosing a two-qubit anisotropic Heisenberg model.
Two-qubit operations may be characterized by their capacities for communication, both with and without free entanglement, and their capacity for creating entanglement. We establish a set of inequalities that give an ordering to the capacities of two-qubit unitary operations. Specifically, we show that the capacities for entanglement creation and bidirectional communication without entanglement assistance are at least as great as half the bidirectional communication capacity with entanglement assistance. In addition, we show that the bidirectional communication that can be performed using an en…
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 $Φ\circΦ$ and present the conditions for coherence-breaking and channel amendment as well.
This paper addresses the problem of designing universal quantum circuits to transform $k$ uses of a $d$-dimensional unitary input-operation into a unitary output-operation in a probabilistic heralded manner. Three classes of protocols are considered, parallel circuits, where the input-operations can be simultaneously, adaptive circuits, where sequential uses of the input-operations are allowed, and general protocols, where the use of the input-operations may be performed without a definite causal order. For these three classes, we develop a systematic semidefinite programming approach that fin…
We establish a set of resource conversion relationships between quantum coherence and multipartite entanglement in many-body systems, where the operational measures of resource cost and distillation are focused. Under the multipartite incoherent operation, the initial coherence of single-party system bounds the maximal amounts of corresponding operational entanglement in an arbitrary bipartite partition as well as the genuine multipartite entanglement in many-body systems. Furthermore, the converted multipartite entanglement can be transferred to its subsystems and restored to coherence of a s…
How to implement a computation task efficiently is the central problem in quantum computation science. For a quantum circuit, the multi-control unitary operations are the very important components. We present an extremely efficient approach to implement multiple multi-control unitary operations directly without any decompositions to CNOT gates and single-photon gates. The necessary two-photon operations could be reduced from $\mathcal{O}(n^3)$ with the traditional decomposition approach to $\mathcal{O}(n)$ with the present approach, which will greatly relax the requirement resources and make t…
Non-unitary operations generated by an effective non-Hermitian Hamiltonian can be used to create quantum state manipulations which are impossible in Hermitian quantum mechanics. These operations include state preparation (or cooling) and non-orthogonal state discrimination. In this work we put a lower bound on the resources needed for the construction of some given non-unitary evolution. Passive systems are studied in detail and a general feature of such a system is derived. After interpreting our results using the singular value decomposition, several examples are studied analytically. In par…
The problem of distinguishing two unitary transformations, or quantum gates, is analyzed and a function reflecting their statistical distinguishability is found. Given two unitary operations, $U_1$ and $U_2$, it is proved that there always exists a finite number $N$ such that $U_1^{\otimes N}$ and $U_2^{\otimes N}$ are perfectly distinguishable, although they were not in the single-copy case. This result can be extended to any finite set of unitary transformations. Finally, a fidelity for one-qubit gates, which satisfies many useful properties from the point of view of quantum information theo…
Using the tool of unitary transformations of the extended receiver we perform simple operations with the non-diagonal elements of the initial sender's density matrix after their transferring to the receiver. These operations are following: turning some matrix elements to zero, rearranging the matrix elements and preparing their linear combinations with required coefficients. We also propose a protocol for solving a system of linear algebraic equations with a system of two equations as an example. Such operations are numerically simulated on the basis of 42-node spin-1/2 chain with the two-qubi…
We investigate the asymptotic dynamics of quantum networks under repeated applications of random unitary operations. It is shown that in the asymptotic limit of large numbers of iterations this dynamics is generally governed by a typically low dimensional attractor space. This space is determined completely by the unitary operations involved and it is independent of the probabilities with which these unitary operations are applied. Based on this general feature analytical results are presented for the asymptotic dynamics of arbitrarily large cyclic qubit networks whose nodes are coupled by ran…
We propose a scheme for implementing a controlled unitary gate between two distant atoms directly communicating through a quantum transmission line. To achieve our goal, only a series of several coherent pulses are applied to the atoms. Our scheme thus requires no ancilla atomic qubit. The simplicity of our scheme may significantly improve the scalability of quantum computers based on trapped neutral atoms or ions.
Conversions between the ground states in quantum critical systems via entanglement-assisted local operations and classical communications (eLOCC) are studied. We propose a new method to reveal the different convertibility by local operations when a quantum phase transition occurs. We have studied the ground state local convertibility in the one dimensional transverse field Ising model, XY model and XXZ model. It is found that the eLOCC convertibility sudden changes at the phase transition points. In transverse field Ising model the eLOCC convertibility between the first excited state and the g…
When a quantum system interacts with an external environment, it undergoes the loss of quantum correlation (decoherence) and the loss of energy (relaxation) and eventually all of the quantum information becomes classical. Here we show a general principle to use unitary operations to establish and preserve particular non-equilibrium states in arbitrary relaxing quantum systems. We elucidate these concepts with examples of state preservation in one-spin and two-spin entangled systems.
We describe an algorithm for converting one bipartite quantum state into another using only local operations and classical communication, which is much simpler than the original algorithm given by Nielsen [Phys. Rev. Lett. 83, 436 (1999)]. Our algorithm uses only a single measurement by one of the parties, followed by local unitary operations which are permutations in the local Schmidt bases.
We study equivalence determination of unitary operations, a task analogous to quantum state discrimination. The candidate states are replaced by unitary operations given as a quantum sample, i.e., a black-box device implementing a candidate unitary operation, and the discrimination target becomes another black-box. The task is an instance of higher-order quantum computation with the black-boxes as input. The optimal error probability is calculated by semidefinite programs. Arbitrary quantum operations applied between the black-boxes in a general protocol provide advantages over protocols restr…
We prove, using a new method based on map-state duality, lower bounds on entanglement resources needed to deterministically implement a bipartite unitary using separable (SEP) operations, which include LOCC (local operations and classical communication) as a particular case. It is known that the Schmidt rank of an entangled pure state resource cannot be less than the Schmidt rank of the unitary. We prove that if these ranks are equal the resource must be uniformly (maximally) entangled: equal nonzero Schmidt coefficients. Higher rank resources can have less entanglement: we have found numerica…
We show for the first time how deterministic unitary operations on time-bin qubits encoded in single photon pulses can be realized using fiber optics components that are available with current technology. We also generalize this result to operations on time-bin qudits, i.e. $d$-level systems, and show that this can be done efficiently using 2$\times$2 beamsplitters and phase modulators. Important benefits for experimental quantum communication are highlighted. This work shows how to bridge the gap between current proof-of-principle demonstrations and complete, deterministic experiments.
Graph states are quantum states that can be described by a stabilizer formalism and play an important role in quantum information processing. We consider the action of local unitary operations on graph states and hypergraph states. We focus on non-Clifford operations and find for certain transformations a graphical description in terms of weighted hypergraphs. This leads to the indentification of hypergraph states that are locally equivalent to graph states. Moreover, we present a systematic way to construct pairs of graph states which are equivalent under local unitary operations, but not equ…
We present numerical results on the capacities of two-qubit unitary operations for creating entanglement and increasing the Holevo information of an ensemble. In all cases tested, the maximum values calculated for the capacities based on the Holevo information are close to the capacities based on the entanglement. This indicates that the capacities based on the Holevo information, which are very difficult to calculate, may be estimated from the capacities based upon the entanglement, which are relatively straightforward to calculate.
Quantum discord is significant in analyzing quantum nonclassicality beyond the paradigm of entanglement. Presently we have explored the effectiveness of global unitary operations in manifesting quantum discord from a general two qubit zero discord state. Apart from the emergence of some obvious concepts such as absolute classical-quantum, absolute quantum-classical states, more interestingly, it is observed that set of states characterized by absoluteness contains only maximally mixed state. Consequently this marks the peak of effectiveness of global unitary operations in purview of manifestin…
The problem of optimally estimating an unknown unitary quantum operation with the aid of entanglement is addressed. The idea is to prepare an entangled pair, apply the unknown unitary to one of the two parts and then measure the joint output state. This measurement could be an entangled one or it could be separable (e.g., LOCC). A comparison is made between these possibilities and it is shown that by using non-separable measurements one can improve the accuracy of the estimation by a factor of $2(d+1)/d$ where $d$ is the dimension of the Hilbert space on which $U$ acts.
We provide several applications of a previously introduced isomorphism between physical operations acting on two systems and entangled states [1]. We show: (i) how to implement (weakly) non-local two qubit unitary operations with a small amount of entanglement; (ii) that a known, noisy, non-local unitary operation as well as an unknown, noisy, local unitary operation can be purified; (iii) how to perform the tomography of arbitrary, unknown, non-local operations; (iv) that a set of local unitary operations as well as a set of non-local unitary operations can be stored and compressed; (v) how t…
Quantum Wasserstein distance between unitary operations
Beihang University（北京航空航天大学）；LMIB(Beihang University), Ministry of education（教育部数学基础与计算科学重点实验室（北京航空航天大学））；School of Mathematical Sciences, Beihang University（北京航空航天大学数学科学学院）；International Research Institute for Multidisciplinary Science, Beihang University（北京航空航天大学多学科交叉研究院）
We propose a simple setup for the conversion of multipartite entangled states in a quantum network with restricted access. The scheme uses nonlocal operations to enable the preparation of states that are inequivalent under local operations and classical communication, but most importantly does not require full access to the states. It is based on a flexible linear optical conversion gate that uses photons, which are ideally suited for distributed quantum computation and quantum communication in extended networks. In order to show the basic working principles of the gate, we focus on converting…
We consider the change of entanglement of formation $ΔE$ produced by a unitary transformation acting on a general (pure or mixed) state $ρ$ describing a system of two qubits. We study numerically the probabilities of obtaining different values of $ΔE$, assuming that the initial state is randomly distributed in the space of all states according to the product measure introduced by Zyczkowski {\it et al.} [Phys. Rev. A {\bf 58} (1998) 883].
Theoretical Quantum Information Processing (QIP) has matured from the use of qubits to the use of qudits (systems having states> 2). Where as most of the experimental implementations have been performed using qubits, little experimental work has been carried out using qudits as yet. In this paper we demonstrate experimental realization of a qutrit system by nuclear magnetic resonance (NMR), utilizing deuterium (spin-1) nuclei partially oriented in liquid crystalline phase. Preparation of pseudopure states and implementation of unitary operations are demonstrated in this single-qutrit system, u…
We consider the implementation of an arbitrary unitary operation U upon a distant quantum system. This teleportation of U can be viewed as a quantum remote control. We investigate protocols which achieve this using local operations, classical communication and shared entanglement (LOCCSE). Lower bounds on the necessary entanglement and classical communication are determined using causality and the linearity of quantum mechanics. We examine in particular detail the resources required if the remote control is to be implemented as a classical black box. Under these circumstances, we prove that th…
One of the primary goals of information theory is to provide limits on the amount of information it is possible to send through various types of communication channels, and to understand the encoding methods that will allow one to achieve such limits. An early surprise in the study of \textit{quantum} information theory was the discovery of dense coding, which demonstrated that it is possible to achieve higher rates for communicating classical information by transmitting quantum systems, rather than classical ones. To achieve the highest possible rate, the transmitted quantum system must initi…
In order to investigate distributed quantum computation under restricted network resources, we introduce a quantum computation task over the butterfly network where both quantum and classical communications are limited. We consider deterministically performing a two-qubit global unitary operation on two unknown inputs given at different nodes, with outputs at two distinct nodes. By using a particular resource setting introduced by M. Hayashi [Phys. Rev. A \textbf{76}, 040301(R) (2007)], which is capable of performing a swap operation by adding two maximally entangled qubits (ebits) between the…
We report a bulk optics experiment demonstrating the possibility of restoring the entanglement distribution through noisy quantum channels by inserting a suitable unitary operation (filter) in the middle of the transmission process. We focus on two relevant classes of single-qubit channels consisting in repeated applications of rotated phase damping or rotated amplitude damping maps, both modeling the combined Hamiltonian and dissipative dynamics of the polarization state of single photons. Our results show that interposing a unitary filter between two noisy channels can significantly improve …
We study necessary conditions for the efficient simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues and based on the algebraic-geometric invariants introduced in [1-2]. Our results indicate that the problem of efficient simulation of Hamiltonians for arbitrary and multipartite quantum systems cannot be described by using only eigenvalues, unlike that in the two-qubit case.
Twirling operations, which average a quantum state with respect to a unitary subgroup, have become a frequently-employed tool in quantum information processing. We investigate the efficient implementation of twirling operations with minimal resources, without necessitating the ability to perform all possible unitary operations on the quantum system of interest. We present a general algebraic method allowing us to choose a set of - typically very few - unitary operators which, when applied randomly and repeatedly, produce the given twirling operation exponentially quickly. The method is applied…
