Related papers: A Simple Algorithm for Local Conversion of Pure St…
Entanglement plays an important role in quantum communication, algorithms, and error correction. Schmidt coefficients are correlated to the eigenvalues of the reduced density matrix. These eigenvalues are used in Von Neumann entropy to…
Quantum operations describe any state change allowed in quantum mechanics, including the evolution of an open system or the state change due to a measurement. In this letter we present a general method based on quantum tomography for…
We study the local unitary equivalence of arbitrary dimensional multipartite quantum mixed states. We present a necessary and sufficient criterion of the local unitary equivalence for general multipartite states based on matrix realignment.…
We study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be distinguishable by separable operations. An…
In this article we investigate the possibility of encoding classical information onto multipartite quantum states in the distant laboratory framework. We show that for all states generated by Clifford operation there always exist such an…
An optimal local conversion strategy between any two pure states of a bipartite system is presented. It is optimal in that the probability of success is the largest achievable if the parties which share the system, and which can communicate…
We present an iterative method to solve the multipartite quantum state estimation problem. We demonstrate convergence for any informationally complete set of generalized quantum measurements in every finite dimension. Our method exhibits…
We give an universal algorithm for testing the local unitary equivalence of states for multipartite system with arbitrary dimensions.
Closed bipartite quantum systems subject to fast local unitary control are studied using quantum optimal control theory and a method of reduced control systems based on the Schmidt decomposition. Particular focus is given to the…
We present computable criterion for completely classifying multi-qubit quantum states under local unitary operations. The criterion can be used to detect whether two quantum states in multi-qubit systems are local unitary equivalent or not.…
There is an ongoing effort to quantify entanglement of quantum pure states for systems with more than two subsystems. We consider three approaches to this problem for three-qubit states: choosing a basis which puts the state into a standard…
We consider a protocol to perform the optimal quantum state discrimination of $N$ linearly independent non-orthogonal pure quantum states and present a computational code. Through the extension of the original Hilbert space, it is possible…
Quantum states can be written in infinitely many ways depending on the choices of basis. Schmidt decomposition of a quantum state has a lot of properties useful in the study of entanglement. All bipartite states admit Schmidt decomposition,…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
We investigate the entanglement properties of pure quantum states describing $n$ qubits. We characterize all multipartite states which can be maximally entangled to local auxiliary systems using controlled operations. A state has this…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…
We introduce a task that we call partial decoupling, in which a bipartite quantum state is transformed by a unitary operation on one of the two subsystems and then is subject to the action of a quantum channel. We assume that the subsystem…
We examine cluster states transformed by stochastic local operations and classical communication, as a resource for deterministic universal computation driven strictly by projective measurements. We identify circumstances under which such…
We introduce the general catalysts for pure entanglement transformations under local operations and classical communications in such a way that we disregard the profit and loss of entanglement of the catalysts per se. As such, the…
We examine the problem of using local operations and classical communication (LOCC) to distinguish a known pure state from an unknown (possibly mixed) state, bounding the error probability from above and below. We study the asymptotic rate…